Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Szegedy, Mario - Department of Computer Science, Rutgers University
Quantum and Classical Query Complexities of Local Search are Polynomially Related
CURRICULUM VITAE MARIO SZEGEDY
Algorithms to Tile the Infinite Grid with Finite Clusters Mario Szegedy
Product rules in Semidefinite Programming Rajat Mittal, Mario Szegedy and Troy Lee
Quantum Speed-up of Markov Chain Based Algorithms Mario Szegedy
A note on the ` number of Lov'asz and the generalized Delsarte bound Mario Szegedy
On the communication complexity of distributions
Geometric representation of cubic graphs with four directions
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Handbook of Combinatorial Optimization D.Z. Du and P.M. Pardalos (Eds.) pp. -- --
In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
Languages with Bounded Multiparty Communication Complexity
PCP Course; Lectures 1, 2 Mario Szegedy
