The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Udi Wieder" ( http://dblp.L3S.de/Authors/Udi_Wieder )

URL (Homepage):  http://www.wisdom.weizmann.ac.il/~uwieder/  Author page on DBLP  Author page in RDF  Community of Udi Wieder in ASPL-2

Publication years (Num. hits)
2002-2008 (19) 2009-2013 (16) 2014-2018 (15) 2019 (2)
Publication types (Num. hits)
article(21) inproceedings(31)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 19 occurrences of 16 keywords

Results
Found 53 publication records. Showing 52 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Mihai Budiu, Parikshit Gopalan, Lalith Suresh, Udi Wieder, Han Kruiger, Marcos K. Aguilera Hillview: A trillion-cell spreadsheet for big data. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Mihai Budiu, Parikshit Gopalan, Lalith Suresh, Udi Wieder, Han Kruiger, Marcos K. Aguilera Hillview: A trillion-cell spreadsheet for big data. Search on Bibsonomy PVLDB The full citation details ... 2019 DBLP  BibTeX  RDF
1Udi Wieder Another Proof of Cuckoo hashing with New Variants. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Parikshit Gopalan, Vatsal Sharan, Udi Wieder Faster Anomaly Detection via Matrix Sketching. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Benny Pinkas, Thomas Schneider 0003, Christian Weinert, Udi Wieder Efficient Circuit-based PSI via Cuckoo Hashing. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2018 DBLP  BibTeX  RDF
1Benny Pinkas, Thomas Schneider 0003, Christian Weinert, Udi Wieder Efficient Circuit-Based PSI via Cuckoo Hashing. Search on Bibsonomy EUROCRYPT (3) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vatsal Sharan, Parikshit Gopalan, Udi Wieder Efficient Anomaly Detection via Matrix Sketching. Search on Bibsonomy NeurIPS The full citation details ... 2018 DBLP  BibTeX  RDF
1Udi Wieder Hashing, Load Balancing and Multiple Choice. Search on Bibsonomy Foundations and Trends in Theoretical Computer Science The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Wei, Amy Tai, Christopher J. Rossbach, Ittai Abraham, Maithem Munshed, Medhavi Dhawan, Jim Stabile, Udi Wieder, Scott Fritchie, Steven Swanson, Michael J. Freedman, Dahlia Malkhi vCorfu: A Cloud-Scale Object Store on a Shared Log. Search on Bibsonomy NSDI The full citation details ... 2017 DBLP  BibTeX  RDF
1Tal Wagner, Eric Schkufza, Udi Wieder A sampling-based approach to accelerating queries in log management systems. Search on Bibsonomy SPLASH (Companion Volume) The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael Wei, Christopher J. Rossbach, Ittai Abraham, Udi Wieder, Steven Swanson, Dahlia Malkhi, Amy Tai Silver: A Scalable, Distributed, Multi-versioning, Always Growing (Ag) File System. Search on Bibsonomy HotStorage The full citation details ... 2016 DBLP  BibTeX  RDF
1Yuval Peres, Kunal Talwar, Udi Wieder Graphical balanced allocations and the (1 + β)-choice process. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ittai Abraham, Shiri Chechik, Robert Krauthgamer, Udi Wieder Approximate Nearest Neighbor Search in Metrics of Planar Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Anupam Gupta, Kunal Talwar, Udi Wieder Changing Bases: Multistage Optimization for Matroids and Matchings. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Kunal Talwar, Udi Wieder Balanced Allocations: A Simple Proof for the Heavily Loaded Case. Search on Bibsonomy ICALP (1) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Anupam Gupta, Kunal Talwar, Udi Wieder Changing Bases: Multistage Optimization for Matroids and Matchings. Search on Bibsonomy ICALP (1) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Omer Reingold, Ron D. Rothblum, Udi Wieder Pseudorandom Graphs in Data Structures. Search on Bibsonomy ICALP (1) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Kunal Talwar, Udi Wieder Balanced Allocations: A Simple Proof for the Heavily Loaded Case. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Rasmus Pagh, Gil Segev 0001, Udi Wieder How to Approximate A Set Without Knowing Its Size In Advance Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1L. Elisa Celis, Omer Reingold, Gil Segev 0001, Udi Wieder Balls and Bins: Smaller Hash Families and Faster Evaluation. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Aditya Bhaskara, Ravishankar Krishnaswamy, Kunal Talwar, Udi Wieder Minimum Makespan Scheduling with Low Rank Processing Times. Search on Bibsonomy SODA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Rasmus Pagh, Gil Segev 0001, Udi Wieder How to Approximate a Set without Knowing Its Size in Advance. Search on Bibsonomy FOCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1L. Elisa Celis, Omer Reingold, Gil Segev 0001, Udi Wieder Balls and Bins: Smaller Hash Families and Faster Evaluation. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1L. Elisa Celis, Omer Reingold, Gil Segev 0001, Udi Wieder Balls and Bins: Smaller Hash Families and Faster Evaluation. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder Strong-Diameter Decompositions of Minor Free Graphs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rina Panigrahy, Kunal Talwar, Udi Wieder Lower Bounds on Near Neighbor Search via Metric Expansion Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Yuval Peres, Kunal Talwar, Udi Wieder The (1 + beta)-Choice Process and Weighted Balls-into-Bins. Search on Bibsonomy SODA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rina Panigrahy, Kunal Talwar, Udi Wieder Lower Bounds on Near Neighbor Search via Metric Expansion. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1James Aspnes, Udi Wieder The expansion and mixing time of skip graphs with applications. Search on Bibsonomy Distributed Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1John MacCormick, Nicholas Murphy, Venugopalan Ramasubramanian, Udi Wieder, Junfeng Yang, Lidong Zhou Kinesis: A new approach to replica placement in distributed storage systems. Search on Bibsonomy TOS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF multiple-choice paradigm, load balancing, Storage system
1Adam Kirsch, Michael Mitzenmacher, Udi Wieder More Robust Hashing: Cuckoo Hashing with a Stash. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dahlia Malkhi, Siddhartha Sen 0001, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder Virtual Ring Routing Trends. Search on Bibsonomy DISC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew V. Goldberg Quincy: fair scheduling for distributed computing clusters. Search on Bibsonomy SOSP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF cluster scheduling, dryad, network flow scheduling, mapreduce, fair scheduling
1Moni Naor, Gil Segev 0001, Udi Wieder History-Independent Cuckoo Hashing. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder Routing complexity of faulty networks. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder Trace reconstruction with constant deletion probability and related results. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
1Rina Panigrahy, Kunal Talwar, Udi Wieder A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Adam Kirsch, Michael Mitzenmacher, Udi Wieder More Robust Hashing: Cuckoo Hashing with a Stash. Search on Bibsonomy ESA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Moni Naor, Gil Segev 0001, Udi Wieder History-Independent Cuckoo Hashing. Search on Bibsonomy ICALP (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Moni Naor, Udi Wieder Novel architectures for P2P applications: The continuous-discrete approach. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF routing, Peer-to-peer networks
1Kunal Talwar, Udi Wieder Balanced allocations: the weighted case. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF balls and bins, the multiple choice paradigm
1Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder Strong-diameter decompositions of minor free graphs. Search on Bibsonomy SPAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF minor free graphs, compact routing
1Udi Wieder Balanced allocations with heterogenous bins. Search on Bibsonomy SPAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF balls and bins, the multiple choice paradigm
1Moni Naor, Udi Wieder Scalable and dynamic quorum systems. Search on Bibsonomy Distributed Computing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder Routing complexity of faulty networks. Search on Bibsonomy PODC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF fault tolerance, routing, random graphs, percolation
1James Aspnes, Udi Wieder The expansion and mixing time of skip graphs with applications. Search on Bibsonomy SPAA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF P2P, expansion
1Moni Naor, Udi Wieder Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds. Search on Bibsonomy IPTPS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Gurmeet Singh Manku, Moni Naor, Udi Wieder Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF random structures, peer to peer networks, greedy routing
1Moni Naor, Udi Wieder A Simple Fault Tolerant Distributed Hash Table. Search on Bibsonomy IPTPS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Moni Naor, Udi Wieder Scalable and dynamic quorum systems. Search on Bibsonomy PODC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Moni Naor, Udi Wieder Novel architectures for P2P applications: the continuous-discrete approach. Search on Bibsonomy SPAA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF fault tolerance, distributed systems, peer-to-peer, hash tables
1Uriel Feige, Eran Ofek, Udi Wieder Approximating Maximum Edge Coloring in Multigraphs. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #52 of 52 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license