|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 19 occurrences of 16 keywords
|
|
|
|
|
Results
Found 30 publication records. Showing 30 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder |
Balls and Bins: Smaller Hash Families and Faster Evaluation.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder |
Balls and Bins: Smaller Hash Families and Faster Evaluation. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Panigrahy, Kunal Talwar, Udi Wieder |
Lower Bounds on Near Neighbor Search via Metric Expansion |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder |
Strong-Diameter Decompositions of Minor Free Graphs. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Peres, Kunal Talwar, Udi Wieder |
The (1 + beta)-Choice Process and Weighted Balls-into-Bins. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rina Panigrahy, Kunal Talwar, Udi Wieder |
Lower Bounds on Near Neighbor Search via Metric Expansion. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | John MacCormick, Nicholas Murphy, Venugopalan Ramasubramanian, Udi Wieder, Junfeng Yang, Lidong Zhou |
Kinesis: A new approach to replica placement in distributed storage systems. |
TOS |
2009 |
DBLP DOI BibTeX RDF |
multiple-choice paradigm, load balancing, Storage system |
| 1 | James Aspnes, Udi Wieder |
The expansion and mixing time of skip graphs with applications. |
Distributed Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Kirsch, Michael Mitzenmacher, Udi Wieder |
More Robust Hashing: Cuckoo Hashing with a Stash. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew Goldberg |
Quincy: fair scheduling for distributed computing clusters. |
SOSP |
2009 |
DBLP DOI BibTeX RDF |
cluster scheduling, dryad, network flow scheduling, mapreduce, fair scheduling |
| 1 | Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder |
Virtual Ring Routing Trends. |
DISC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev, Udi Wieder |
History-Independent Cuckoo Hashing. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder |
Routing complexity of faulty networks. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Kirsch, Michael Mitzenmacher, Udi Wieder |
More Robust Hashing: Cuckoo Hashing with a Stash. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder |
Trace reconstruction with constant deletion probability and related results. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev, Udi Wieder |
History-Independent Cuckoo Hashing. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rina Panigrahy, Kunal Talwar, Udi Wieder |
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Udi Wieder |
Novel architectures for P2P applications: The continuous-discrete approach. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
routing, Peer-to-peer networks |
| 1 | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder |
Strong-diameter decompositions of minor free graphs. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
minor free graphs, compact routing |
| 1 | Udi Wieder |
Balanced allocations with heterogenous bins. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
balls and bins, the multiple choice paradigm |
| 1 | Kunal Talwar, Udi Wieder |
Balanced allocations: the weighted case. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
balls and bins, the multiple choice paradigm |
| 1 | Moni Naor, Udi Wieder |
Scalable and dynamic quorum systems. |
Distributed Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | James Aspnes, Udi Wieder |
The expansion and mixing time of skip graphs with applications. |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
P2P, expansion |
| 1 | Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder |
Routing complexity of faulty networks. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
fault tolerance, routing, random graphs, percolation |
| 1 | Moni Naor, Udi Wieder |
Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds. |
IPTPS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gurmeet Singh Manku, Moni Naor, Udi Wieder |
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
random structures, peer to peer networks, greedy routing |
| 1 | Moni Naor, Udi Wieder |
A Simple Fault Tolerant Distributed Hash Table. |
IPTPS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Udi Wieder |
Novel architectures for P2P applications: the continuous-discrete approach. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
fault tolerance, distributed systems, peer-to-peer, hash tables |
| 1 | Moni Naor, Udi Wieder |
Scalable and dynamic quorum systems. |
PODC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Eran Ofek, Udi Wieder |
Approximating Maximum Edge Coloring in Multigraphs. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #30 of 30 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")