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.

 

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

Regular Languages are Testable with a Constant Number of Queries, , , и . SIAM J. Comput., 30 (6): 1842-1862 (2000)Estimating arbitrary subset sums with few probes., , , и . PODS, стр. 317-325. ACM, (2005)Biomolecular network motif counting and discovery by color coding., , , , и . ISMB, стр. 241-249. (2008)The Price of Bounded Preemption., , и . SPAA, стр. 301-310. ACM, (2018)Basic network creation games., , , и . SPAA, стр. 106-113. ACM, (2010)A general approach to online network optimization problems., , , , и . ACM Trans. Algorithms, 2 (4): 640-660 (2006)Admission control to minimize rejections and online set cover with repetitions., , и . ACM Trans. Algorithms, 6 (1): 11:1-11:13 (2009)Quadratic forms on graphs., , , и . STOC, стр. 486-493. ACM, (2005)Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths., , и . RANDOM-APPROX, том 1671 из Lecture Notes in Computer Science, стр. 16-27. Springer, (1999)Testing Low-Degree Polynomials over GF(2(., , , , и . RANDOM-APPROX, том 2764 из Lecture Notes in Computer Science, стр. 188-199. Springer, (2003)