| 2025 | ICALP | On the Quantum Time Complexity of Divide and Conquer. | Jonathan Allcock, Jinge Bao, Aleksandrs Belovs, Troy Lee, Miklos Santha |
| 2022 | ESA | Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming. | Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhfer, Miklos Santha |
| 2021 | SODA | Quantum algorithms for graph problems with cut queries. | Troy Lee, Miklos Santha, Shengyu Zhang |
| 2019 | ICALP | A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. | Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal |
| 2018 | CRYPTO | A New Public-Key Cryptosystem via Mersenne Numbers. | Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha |
| 2018 | CSR | Quadratically Tight Relations for Randomized Query Complexity. | Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs |
| 2018 | ESA | On Learning Linear Functions from Subset and Its Applications in Quantum Computing. | Gbor Ivanyos, Anupam Prakash, Miklos Santha |
| 2018 | MFCS | Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). | Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka |
| 2016 | FOCS | Separations in Communication Complexity Using Cheat Sheets and Information Complexity. | Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Gs, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha |
| 2016 | ICALP | Linear Time Algorithm for Quantum 2SAT. | Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang |
| 2016 | MFCS | On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. | Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang |
| 2016 | STOC | Separations in query complexity based on pointer functions. | Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs |
| 2015 | FAW | On Solving Systems of Diagonal Polynomial Equations Over Finite Fields. | Gbor Ivanyos, Miklos Santha |
| 2015 | TAMC | Quantum and Randomized Query Complexities (Extended Abstract). | Miklos Santha |
| 2014 | ICALP | On the Complexity of Trial and Error for Constraint Satisfaction Problems. | Gbor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram |
| 2014 | MFCS | An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. | Thomas Decker, Gbor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha |
| 2014 | STACS | Generalized Wong sequences and their applications to Edmonds' problems. | Gbor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha |
| 2013 | CIAC | Query Complexity of Matroids. | Raghav Kulkarni, Miklos Santha |
| 2013 | SODA | Improved quantum query algorithms for triangle finding and associativity testing. | Troy Lee, Frdric Magniez, Miklos Santha |
| 2011 | ICALP | Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. | Frdric Magniez, Ashwin Nayak, Miklos Santha, David Xiao |
| 2010 | CSR | Quantization of Random Walks: Search Algorithms and Hitting Time. | Miklos Santha |
| 2009 | SODA | On the hitting times of quantum versus random walks. | Frdric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha |
| 2008 | LATIN | An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. | Gbor Ivanyos, Luc Sanselme, Miklos Santha |
| 2008 | SAGT | Approximate Nash Equilibria for Multi-player Games. | Sbastien Hmon, Michel de Rougemont, Miklos Santha |
| 2008 | TAMC | Quantum Walk Based Search Algorithms. | Miklos Santha |
| 2007 | STOC | Search via quantum walk. | Frdric Magniez, Ashwin Nayak, Jrmie Roland, Miklos Santha |
| 2007 | STACS | An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups. | Gbor Ivanyos, Luc Sanselme, Miklos Santha |
| 2006 | CIAC | Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. | Katalin Friedl, Gbor Ivanyos, Miklos Santha, Yves F. Verhoeven |
| 2005 | FCT | On the Black-Box Complexity of Sperner's Lemma. | Katalin Friedl, Gbor Ivanyos, Miklos Santha, Yves F. Verhoeven |
| 2005 | SODA | Quantum algorithms for the triangle problem. | Frdric Magniez, Miklos Santha, Mario Szegedy |
| 2005 | STOC | Efficient testing of groups. | Katalin Friedl, Gbor Ivanyos, Miklos Santha |
| 2004 | STOC | Quantum and classical query complexities of local search are polynomially related. | Miklos Santha, Mario Szegedy |
| 2003 | MFCS | Quantum Testers for Hidden Group Properties. | Katalin Friedl, Frdric Magniez, Miklos Santha, Pranab Sen |
| 2003 | STOC | Hidden translation and orbit coset in quantum computing. | Katalin Friedl, Gbor Ivanyos, Frdric Magniez, Miklos Santha, Pranab Sen |
| 2001 | SPAA | Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. | Gbor Ivanyos, Frdric Magniez, Miklos Santha |
| 2000 | CIAC | Semantical Counting Circuits. | Fabrice Noilhan, Miklos Santha |
| 2000 | STOC | Self-testing of universal and fault-tolerant sets of quantum gates. | Wim van Dam, Frdric Magniez, Michele Mosca, Miklos Santha |
| 1999 | STOC | Approximate Testing with Relative Error. | Marcos A. Kiwi, Frdric Magniez, Miklos Santha |
| 1998 | ICALP | Efficient Approximation Algorithms for the Subset-Sums Equality Problem. | Cristina Bazgan, Miklos Santha, Zsolt Tuza |
| 1998 | STACS | On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract). | Cristina Bazgan, Miklos Santha, Zsolt Tuza |
| 1996 | FOCS | A Decision Procedure for Unitary Linear Quantum Cellular Automata. | Christoph Drr, Miklos Santha |
| 1996 | STACS | A Decision Procedure for Well-Formed Linear Quantum Cellular Automata. | Christoph Drr, Huong L Thanh, Miklos Santha |
| 1994 | ISAAC | Verifying the Determinant in Parallel. | Miklos Santha, Sovanna Tan |
| 1991 | EuroCrypt | On the Reversibility of Oblivious Transfer. | Claude Crpeau, Miklos Santha |
| 1991 | STACS | Polynomial Size Constant Depth Circuits with a Limited Number of Negations. | Miklos Santha, Christopher B. Wilson |
| 1984 | FOCS | Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) | Miklos Santha, Umesh V. Vazirani |