From post

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.

 

Другие публикации лиц с тем же именем

On (epsilon, k)-min-wise independent permutations., , и . Random Struct. Algorithms, 31 (3): 384-389 (2007)Smaller explicit superconcentrators., и . SODA, стр. 340-346. ACM/SIAM, (2003)On Disseminating Information Reliably without Broadcasting., , и . ICDCS, стр. 74-81. IEEE Computer Society, (1987)Approximation Schemes for Scheduling., , , и . SODA, стр. 493-500. ACM/SIAM, (1997)Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs, и . CoRR, (2008)Comparison-Sorting and Selecting in Totally Monotone Matrices., и . SODA, стр. 403-408. ACM/SIAM, (1992)The Online Set Cover Problem., , , , и . SIAM J. Comput., 39 (2): 361-370 (2009)Balanced families of perfect hash functions and their applications., и . ACM Trans. Algorithms, 6 (3): 54:1-54:12 (2010)The space complexity of approximating the frequency moments, , и . J. Comput.\~Syst.\~Sci., 58 (1): 137--147 (1999)The Probabilistic Method, и . Wiley, Hoboken, NJ, Third издание, (2008)