| Year |
Citation |
Score |
| 2020 |
Huang C, Newman M, Szegedy M. Explicit Lower Bounds on Strong Quantum Simulation Ieee Transactions On Information Theory. 66: 5585-5600. DOI: 10.1109/Tit.2020.3004427 |
0.315 |
|
| 2016 |
Kun G, Szegedy M. A new line of attack on the dichotomy conjecture European Journal of Combinatorics. 52: 338-367. DOI: 10.1016/J.Ejc.2015.07.011 |
0.4 |
|
| 2016 |
Halldórsson BV, Halldórsson MM, Losievskaja E, Szegedy M. Streaming Algorithms for Independent Sets in Sparse Hypergraphs Algorithmica. 76: 490-501. DOI: 10.1007/S00453-015-0051-5 |
0.346 |
|
| 2009 |
Mukkamala P, Szegedy M. Geometric representation of cubic graphs with four directions Computational Geometry: Theory and Applications. 42: 842-851. DOI: 10.1016/J.Comgeo.2009.01.005 |
0.364 |
|
| 2009 |
Santha M, Szegedy M. Quantum and Classical Query Complexities of Local Search Are Polynomially Related Algorithmica. 55: 557-575. DOI: 10.1007/S00453-008-9169-Z |
0.374 |
|
| 2007 |
Magniez F, Santha M, Szegedy M. Quantum Algorithms for the Triangle Problem Siam Journal On Computing. 37: 413-424. DOI: 10.1137/050643684 |
0.373 |
|
| 2006 |
Laplante S, Lee T, Szegedy M. The Quantum Adversary Method And Classical Formula Size Lower Bounds Computational Complexity. 15: 163-196. DOI: 10.1007/S00037-006-0212-7 |
0.374 |
|
| 2004 |
Balogh J, Regev O, Smyth C, Steiger W, Szegedy M. Long Monotone Paths in Line Arrangements Discrete & Computational Geometry. 32. DOI: 10.1007/S00454-004-1119-1 |
0.301 |
|
| 2001 |
Alon N, Krivelevich M, Newman I, Szegedy M. Regular Languages are Testable with a Constant Number of Queries Siam Journal On Computing. 30: 1842-1862. DOI: 10.1137/S0097539700366528 |
0.327 |
|
| 2001 |
Alon N, Fischer E, Szegedy M. Parent-Identifying Codes Journal of Combinatorial Theory, Series A. 95: 349-359. DOI: 10.1006/Jcta.2001.3177 |
0.302 |
|
| 2000 |
Alon N, Fischer E, Krivelevich M, Szegedy M. Efficient Testing of Large Graphs Combinatorica. 20: 451-476. DOI: 10.1007/S004930070001 |
0.409 |
|
| 1998 |
Arora S, Lund C, Motwani R, Sudan M, Szegedy M. Proof verification and the hardness of approximation problems Journal of the Acm. 45: 501-555. DOI: 10.1145/278298.278306 |
0.411 |
|
| 1997 |
Lovász L, Pach J, Szegedy M. On Conway"s thrackle conjecture Discrete and Computational Geometry. 18: 369-376. DOI: 10.1007/Pl00009322 |
0.391 |
|
| 1996 |
Feige U, Goldwasser S, Lovász L, Safra S, Szegedy M. Interactive proofs and the hardness of approximating cliques Journal of the Acm. 43: 268-292. DOI: 10.1145/226643.226652 |
0.381 |
|
| 1996 |
Pach J, Shahrokhi F, Szegedy M. Applications of the Crossing Number Algorithmica (New York). 16: 111-117. DOI: 10.1007/Bf02086610 |
0.425 |
|
| 1994 |
Halldórsson MM, Szegedy M. Lower bounds for on-line graph coloring Theoretical Computer Science. 130: 163-174. DOI: 10.1016/0304-3975(94)90157-0 |
0.406 |
|
| 1994 |
Nisan N, Szegedy M. On the degree of Boolean functions as real polynomials Computational Complexity. 4: 301-313. DOI: 10.1007/Bf01263419 |
0.342 |
|
| 1993 |
Hajnal A, Maass W, Pudlák P, Szegedy M, Turán G. Threshold circuits of bounded depth Journal of Computer and System Sciences. 46: 129-154. DOI: 10.1016/0022-0000(93)90001-D |
0.321 |
|
| 1992 |
Babai L, Szegedy M. Local Expansion of Symmetrical Graphs Combinatorics, Probability and Computing. 1: 1-11. DOI: 10.1017/S0963548300000031 |
0.317 |
|
| 1992 |
Babai L, Nisant N, Szegedy M. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs Journal of Computer and System Sciences. 45: 204-232. DOI: 10.1016/0022-0000(92)90047-M |
0.421 |
|
| 1992 |
Hajnal P, Szegedy M. On packing bipartite graphs Combinatorica. 12: 295-301. DOI: 10.1007/Bf01285818 |
0.356 |
|
| 1988 |
Rubinstein D, Shallit J, Szegedy M. A Subset Coloring Algorithm and Its Applications to Computer Graphics Communications of the Acm. 31: 1228-1232. DOI: 10.1145/63039.63046 |
0.325 |
|
| 1986 |
Szegedy M. The solution of Graham's greatest common divisor problem Combinatorica. 6: 67-71. DOI: 10.1007/Bf02579410 |
0.317 |
|
| Show low-probability matches. |