Author:
Dietzfelbinger Martin,Goerdt Andreas,Mitzenmacher Michael,Montanari Andrea,Pagh Rasmus,Rink Michael
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced allocations. SIAM J. Comput. 29(1), 180–200 (1999)
2. Batu, T., Berenbrink, P., Cooper, C.: Balanced allocations: Balls-into-bins revisited and chains-into-bins, CDAM Research Report Series. LSE-CDAM-2007-34
3. Cain, J.A., Sanders, P., Wormald, N.C.: The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation. In: Proc. 18th ACM-SIAM SODA, pp. 469–476 (2007)
4. Calkin, N.J.: Dependent sets of constant weight binary vectors. Combinatorics, Probability, and Computing 6(3), 263–271 (1997)
5. Cooper, C.: The size of the cores of a random graph with a given degree sequence. Random Structures and Algorithms 25(4), 353–375 (2004)
Cited by
78 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Panacea: Non-Interactive and Stateless Oblivious RAM;2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P);2024-07-08
2. CodingSketch: A Hierarchical Sketch with Efficient Encoding and Recursive Decoding;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
3. The $k$-XORSAT Threshold Revisited;The Electronic Journal of Combinatorics;2024-04-19
4. One-Step Replica Symmetry Breaking of Random Regular NAE-SAT II;Communications in Mathematical Physics;2024-02-23
5. Lightweight Acquisition and Ranging of Flows in the Data Plane;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2023-12-07