Mario Szegedy

Artificial Intelligence · with Alon · 1991–2003

A researcher in the Science corpus: 4 papers; trusts 2 researchers and is trusted by 5 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 6 citations into it; #15,137 of 35,345 by trust here, #27,551 by citations
• Computational Theory and Mathematics — 6 citations into it; #4,740 of 12,182 by trust here, #7,851 by citations

Whom Mario Szegedy trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Andris Ambainis
2. Yaoyun Shi

Who trusts Mario Szegedy overall

1. Eli Ben-Sasson
2. Srinath T. V. Setty
3. Andrew M. Childs
4. Alessandro Chiesa
5. Miklos Santha
6. Salvador Elías Venegas-Andraca
7. Subhash Khot
8. Silvio Micali
9. Oded Goldreich
10. Yuval Ishai

Papers from Mario Szegedy's perspective

Ordered by how strongly the researchers Mario Szegedy trusts endorse each paper. Same corpus, a different order for every researcher.

1. Quantum walks on graphs (Symposium on the Theory of Computing)
2. Quantum lower bounds for the collision and the element distinctness problems (The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.)
3. A personal communication
4. Quantum walk algorithm for element distinctness (45th Annual IEEE Symposium on Foundations of Computer Science)
5. An Example of the Difference Between Quantum and Classical Random Walks (Quantum Information Processing)
6. Spatial search by quantum walk
7. Quantum Walk on the Line
8. Quantum Amplitude Amplification and Estimation
9. Quantum random walks: An introductory overview
10. Quantum Computation and Quantum Information

Their papers

• Quantum algorithms for the triangle problem (2003) — 379 citations
• Efficient Testing of Large Graphs (2000) — 384 citations
• Proof verification and hardness of approximation problems (1992)
• Checking computations in polylogarithmic time (1991)