Author of the publication

Towards a Study of Low-Complexity Graphs.

, , and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 119-131. Springer, (2009)

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.

 

Other publications of authors with the same name

Superpolynomial Lower Bounds for Monotone Span Programs., , and . Comb., 19 (3): 301-319 (1999)Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity., , and . Comput. Complex., 5 (3/4): 191-204 (1995)An Analysis of a Simple Genetic Algorithm., and . ICGA, page 215-221. Morgan Kaufmann, (1991)On data structures and asymmetric communication complexity., , , and . STOC, page 103-111. ACM, (1995)Self-Testing/Correcting for Polynomials and for Approximate Functions, , , , and . STOC, page 32-42. ACM, (1991)Composition of the Universal Relation., and . Advances In Computational Complexity Theory, volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 119-134. DIMACS/AMS, (1990)Multi-Layer Grid Embeddings, , , , and . FOCS, page 186-196. IEEE Computer Society, (1985)Probabilistic Communication Complexity of Boolean Relations (Extended Abstract), and . FOCS, page 562-567. IEEE Computer Society, (1989)Extracting Randomness via Repeated Condensing., , and . FOCS, page 22-31. IEEE Computer Society, (2000)Much Faster Algorithms for Matrix Scaling., , , and . FOCS, page 890-901. IEEE Computer Society, (2017)