The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase parallel rounds (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1991-2010 (6)
Publication types (Num. hits)
inproceedings(6)
Venues (Conferences, Journals, ...)
ASIACRYPT(1) CRYPTO(1) DFT(1) FOCS(1) RECOMB(1) SPAA(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 18 occurrences of 18 keywords

Results
Found 6 publication records. Showing 6 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Pierre Fraigniaud, George Giakkoupis On the bit communication complexity of randomized rumor spreading. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF bit communication complexity, random phone call, rumor spreading
1Pradeep Kumar Mishra, Palash Sarkar Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves. Search on Bibsonomy ASIACRYPT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF hyperelliptic curve cryptography, encapsulated add-and-double, parallel algorithm, Jacobian, explicit formula
1Richard Beigel, Noga Alon, Simon Kasif, Mehmet Serkan Apaydin, Lance Fortnow An optimal procedure for gap closing in whole genome shotgun sequencing. Search on Bibsonomy RECOMB The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Richard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vöcking Randomized Rumor Spreading. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF randomized rumor spreading, epidemic algorithms, lazy update transmission, distributed database copies, randomized communication mechanism, parallel rounds, randomly selected communication partner, address-oblivious algorithm, random telephone calls, commmunication complexity, robustness, lower bound, information theory, communication complexity, database theory, time optimality, communication overhead, communication optimality, randomised algorithms, replicated databases, message transmissions
1Fred J. Meyer, Fabrizio Lombardi, Jun Zhao Good Processor Identification in Two-Dimensional Grids. (PDF / PS) Search on Bibsonomy DFT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF regular array, repair, PMC model, sequential diagnosis, homogeneous system
1Dror Lapidot, Adi Shamir A One-Round, Two-Prover, Zero-Knowledge Protocol for NP. Search on Bibsonomy CRYPTO The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #6 of 6 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.