The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase O(log n) messages (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1995-2007 (11)
Publication types (Num. hits)
article(1) inproceedings(10)
Venues (Conferences, Journals, ...)
PODC(2) Algorithmica(1) CCGRID(1) Euro-Par(1) ICPADS(1) ICPP(1) IPPS(1) SODA(1) SPAA(1) WOWMOM(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 31 occurrences of 26 keywords

Results
Found 11 publication records. Showing 11 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
2Theodore Johnson A performance comparison of fast distributed mutual exclusion algorithms. (PDF / PS) Search on Bibsonomy IPPS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF O(log n) messages, distributed virtual memory, computational complexity, distributed algorithms, distributed algorithms, software performance evaluation, performance comparison, distributed object systems, distributed synchronization, mutual exclusion algorithms, coherent caches
1Petra Berenbrink, Colin Cooper, Zengjian Hu Energy efficient randomised communication in unknown AdHoc networks. Search on Bibsonomy SPAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF ad hoc networks, energy efficiency, broadcasting, randomized algorithms, gossiping
1Valerie King, Scott Lewis, Jared Saia, Maxwell Young Choosing a Random Peer in Chord. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Attack-resistance, Peer-to-peer, Distributed algorithms, Randomized algorithms, Distributed Hash table, Data collection, Chord
1Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lars Arge, David Eppstein, Michael T. Goodrich Skip-webs: efficient distributed data structures for multi-dimensional data sets. Search on Bibsonomy PODC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF trapezoidal maps, peer-to-peer networks, quadtrees, octrees, distributed data structures, tries, skip lists
1Sylvain Dahan, Jean-Marc Nicod, Laurent Philippe The distributed spanning tree: a scalable interconnection topology for efficient and equitable traversal. Search on Bibsonomy CCGRID The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Ioannis Ioannidis, Bogdan Carbunar, Cristina Nita-Rotaru High Throughput Routing in Hybrid Cellular and Ad-Hoc Networks. Search on Bibsonomy WOWMOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Valerie King, Jared Saia Choosing a random peer. Search on Bibsonomy PODC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF peer-to-peer, distributed hash table, random sampling
1Hung-Chang Hsiao, Chung-Ta King Similarity Discovery in Structured P2P Overlays. Search on Bibsonomy ICPP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Joffroy Beauquier, Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit Group Mutual Exclusion In Tree Networks. Search on Bibsonomy ICPADS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Distributed algorithms, mutual exclusion, group mutual exclusion
1Claus Wagner, Frank Mueller Token-Based Read/Write-Locks for Distributed Mutual Exclusion. Search on Bibsonomy Euro-Par The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #11 of 11 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.