Author of the publication

Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs.

, , and . TCC, volume 3378 of Lecture Notes in Computer Science, page 66-85. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Naor, Moni
add a person with the name Naor, Moni
 

Other publications of authors with the same name

On fairness in the carpool problem.. J. Algorithms, 55 (1): 93-98 (2005)Fairness in Scheduling, , , , , and . J. Algorithms, 29 (2): 306-357 (1998)On Dice and Coins: Models of Computation for Random Generation, , , , , and . Inf. Comput., 104 (2): 159-174 (June 1993)On the Decisional Complexity of Problems Over the Reals., and . Inf. Comput., 167 (1): 27-45 (2001)Computationally Secure Oblivious Transfer., and . J. Cryptology, 18 (1): 1-35 (2005)Tight Bounds for Sliding Bloom Filters., and . Algorithmica, 73 (4): 652-672 (2015)Implicit O(1) Probe Search., and . SIAM J. Comput., 22 (1): 1-10 (1993)Small-Bias Probability Spaces: Efficient Constructions and Applications., and . SIAM J. Comput., 22 (4): 838-856 (1993)Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract), and . FOCS, page 46-54. IEEE Computer Society, (1990)Amortized Communication Complexity (Preliminary Version), , and . FOCS, page 239-248. IEEE Computer Society, (1991)