| 2026 | SODA | Interaction Between Skew-representability, Tensor Products, Extension Properties, and Rank Inequalities. | Kristf Brczi, Boglrka Gehr, Andrs Imolay, Lszl Lovsz, Carles Padr, Tams Schwarcz |
| 2025 | STOC | Matroid Products via Submodular Coupling. | Kristf Brczi, Boglrka Gehr, Andrs Imolay, Lszl Lovsz, Balzs Maga, Tams Schwarcz |
| 2008 | ALT | Some Mathematics behind Graph Property Testing. | Lszl Lovsz |
| 2008 | DIS | Some Mathematics Behind Graph Property Testing. | Lszl Lovsz |
| 2007 | FCT | Approximating Graphs by Graphs and Functions (Abstract). | Lszl Lovsz |
| 2006 | FOCS | Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization. | Lszl Lovsz, Santosh S. Vempala |
| 2006 | SODA | Local versus global properties of metric spaces. | Sanjeev Arora, Lszl Lovsz, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh S. Vempala |
| 2006 | STOC | Graph limits and parameter testing. | Christian Borgs, Jennifer T. Chayes, Lszl Lovsz, Vera T. Ss, Balzs Szegedy, Katalin Vesztergombi |
| 2005 | PODC | Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. | Kamal Jain, Lszl Lovsz, Philip A. Chou |
| 2004 | STOC | (Almost) tight bounds and existence theorems for confluent flows. | Jiangzhuo Chen, Robert D. Kleinberg, Lszl Lovsz, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta |
| 2004 | STOC | Hit-and-run from a corner. | Lszl Lovsz, Santosh S. Vempala |
| 2003 | FOCS | Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm. | Lszl Lovsz, Santosh S. Vempala |
| 2003 | FOCS | Logconcave Functions: Geometry and Efficient Sampling Algorithms | Lszl Lovsz, Santosh S. Vempala |
| 2003 | WADS | Semi-matchings for Bipartite Graphs and Load Balancing. | Nicholas J. A. Harvey, Richard E. Ladner, Lszl Lovsz, Tami Tamir |
| 2002 | FOCS | Proving Integrality Gaps without Knowing the Linear Program. | Sanjeev Arora, Bla Bollobs, Lszl Lovsz |
| 2002 | FOCS | Global Information from Local Observation. | Itai Benjamini, Lszl Lovsz |
| 2000 | FOCS | The Cover Time, the Blanket Time, and the Matthews Bound. | Jeff Kahn, Jeong Han Kim, Lszl Lovsz, Van H. Vu |
| 1999 | STOC | Lifting Markov Chains to Speed up Mixing. | Fang Chen, Lszl Lovsz, Igor Pak |
| 1999 | STOC | Faster Mixing via Average Conductance. | Lszl Lovsz, Ravi Kannan |
| 1998 | FOCS | Approximation of Diameters: Randomization Doesn't Help. | Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, Lszl Lovsz, Mikls Simonovits |
| 1995 | STOC | Efficient stopping rules for Markov chains. | Lszl Lovsz, Peter Winkler |
| 1992 | FOCS | On the Randomized Complexity of Volume and Diameter | Lszl Lovsz, Mikls Simonovits |
| 1992 | STOC | Linear Decision Trees: Volume Estimates and Topological Bounds | Anders Bjrner, Lszl Lovsz, Andrew Chi-Chih Yao |
| 1992 | STOC | Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) | Uriel Feige, Lszl Lovsz |
| 1991 | FOCS | Approximating Clique is Almost NP-Complete (Preliminary Version) | Uriel Feige, Shafi Goldwasser, Lszl Lovsz, Shmuel Safra, Mario Szegedy |
| 1991 | FOCS | Search Problems in the Decision Tree Model (Preliminary Version) | Lszl Lovsz, Moni Naor, Ilan Newman, Avi Wigderson |
| 1990 | FOCS | The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume | Lszl Lovsz, Mikls Simonovits |
| 1988 | FOCS | Lattices, Mbius Functions and Communication Complexity | Lszl Lovsz, Michael E. Saks |
| 1986 | FOCS | A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications | Nathan Linial, Lszl Lovsz, Avi Wigderson |
| 1985 | FOCS | Computing ears and branchings in parallel | Lszl Lovsz |
| 1985 | ICALP | Vertex Packing Algorithms. | Lszl Lovsz |
| 1984 | STOC | Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers | Ravindran Kannan, Arjen K. Lenstra, Lszl Lovsz |
| 1981 | FCT | Mathematical Structures Underlying Greedy Algorithms. | Bernhard Korte, Lszl Lovsz |
| 1979 | FCT | On determinants, matchings, and random algorithms. | Lszl Lovsz |
| 1979 | FOCS | Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems | Romas Aleliunas, Richard M. Karp, Richard J. Lipton, Lszl Lovsz, Charles Rackoff |