( en | de | ru )

 

Disambiguation of "Szegedy, Mario"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Testing of Large Graphs.

, , , and . FOCS, page 656-666. IEEE Computer Society, (1999)

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.

Christian Szegedy

Simone Marion

Ernst Marioth-Wirtz

Martin Marioth

Anneliese Marioth

 

Other publications of authors with the same name

Long Monotone Paths in Line Arrangements., , , , and . Discrete & Computational Geometry, 32 (2): 167-176 (2004)On the Complexity of RAM with Various Operation Sets, and . STOC, page 624-631. ACM, (1992)Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract)., and . STOC, page 561-570. ACM, (1996)Near optimality of the priority sampling procedure. Electron. Colloquium Comput. Complex., (2005)On Rearrangement of Items Stored in Stacks., and . WAFR, volume 17 of Springer Proceedings in Advanced Robotics, page 518-533. Springer, (2021)A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications., and . Advances In Computational Complexity Theory, volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 183-193. DIMACS/AMS, (1990)Moser and tardos meet Lovász, and . STOC, page 235-244. ACM, (2011)Rubik Tables, Stack Rearrangement, and Multi-Robot Path Planning., , , and . Allerton, page 1-4. IEEE, (2022)A note on the Theta number of Lovász and the generalized Delsarte bound. FOCS, page 36-39. IEEE Computer Society, (1994)Regular Languages Are Testable with a Constant Number of Queries., , , and . FOCS, page 645-655. IEEE Computer Society, (1999)