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)Approximate Hypergraph Coloring., , , и . Nord. J. Comput., 3 (4): 425-439 (1996)Disjoint Directed Cycles.. J. Comb. Theory, Ser. B, 68 (2): 167-178 (1996)The 123 Theorem and Its Extensions., и . J. Comb. Theory, Ser. A, 72 (2): 322-331 (1995)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)The Maximum Size of a Convex Polygon in a Restricted Set in the Plane., , и . Discret. Comput. Geom., (1989)Can Visibility Graphs Be Represented Compactly?., , , и . Discret. Comput. Geom., (1994)Introduction., и . Comb. Probab. Comput., 18 (1-2): 1 (2009)Locally Thin Set Families., , и . Comb. Probab. Comput., 9 (6): 481-488 (2000)