Miklos Santha - RankMe

165 papers A* 19A 14B 8C 5Misc 3Journal 101Unranked 15

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	On the Quantum Time Complexity of Divide and Conquer. ICALP Jonathan Allcock, Jinge Bao, Aleksandrs Belovs, Troy Lee, Miklos Santha
2025	J	`jnl`	Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more. CoRR Jonathan Allcock, João F. Doriguello, Gábor Ivanyos, Miklos Santha
2025	A	`conf`	The Local Hamiltonian Problem for Quasi-Quantum States: A Toy Model for the Quantum PCP Conjecture (Extended Abstract). ITCS Itai Arad, Miklos Santha
2024	J	`jnl`	Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits. CoRR Jonathan Allcock, João F. Doriguello, Gábor Ivanyos, Miklos Santha
2024	J	`jnl`	Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates. Quantum Jonathan Allcock, Jinge Bao, João F. Doriguello, Alessandro Luongo, Miklos Santha
2024	J	`jnl`	Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime. CoRR Divesh Aggarwal, Antoine Joux, Miklos Santha, Karol Wegrzycki
2024	J	`jnl`	Quasi-quantum states and the quasi-quantum PCP theorem. CoRR Itai Arad, Miklos Santha
2023	J	`jnl`	Constant-depth circuits for Uniformly Controlled Gates and Boolean functions with application to quantum memory circuits. CoRR Jonathan Allcock, Jinge Bao, João F. Doriguello, Alessandro Luongo, Miklos Santha
2023	J	`jnl`	On the quantum time complexity of divide and conquer. CoRR Jonathan Allcock, Jinge Bao, Aleksandrs Belovs, Troy Lee, Miklos Santha
2023	J	`jnl`	Optimal Composition Theorem for Randomized Query Complexity. Theory Comput. Dmytro Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal
2023	J	`jnl`	Quantum Alphatron: quantum advantage for learning with kernels and noise. Quantum Siyi Yang, Naixu Guo, Miklos Santha, Patrick Rebentrost
2022	A	`conf`	Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming. ESA Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha
2022	—	`conf`	Quantum Algorithm for Stochastic Optimal Stopping Problems with Applications in Finance. TQC João F. Doriguello, Alessandro Luongo, Jinge Bao, Patrick Rebentrost, Miklos Santha
2022	J	`jnl`	Quantum generalizations of the polynomial hierarchy with applications to QMA(2). Comput. Complex. Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka
2021	J	`jnl`	Characterising the intersection of QMA and coQMA. Quantum Inf. Process. Serge Massar, Miklos Santha
2021	J	`jnl`	Classical and quantum dynamic programming for Subset-Sum and variants. CoRR Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha
2021	A	`conf`	On the Cut Dimension of a Graph. CCC Troy Lee, Tongyang Li, Miklos Santha, Shengyu Zhang
2021	A*	`conf`	Quantum algorithms for graph problems with cut queries. SODA Troy Lee, Miklos Santha, Shengyu Zhang
2021	J	`jnl`	Total functions in QMA. Quantum Inf. Process. Serge Massar, Miklos Santha
2020	J	`jnl`	On the cut dimension of a graph. CoRR Troy Lee, Tongyang Li, Miklos Santha, Shengyu Zhang
2020	J	`jnl`	Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
2020	J	`jnl`	Quantum algorithms for graph problems with cut queries. CoRR Troy Lee, Miklos Santha, Shengyu Zhang
2019	A*	`conf`	A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. ICALP Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal
2019	J	`jnl`	Discrete logarithm and Diffie-Hellman problems in identity black-box groups. CoRR Gábor Ivanyos, Antoine Joux, Miklos Santha
2019	J	`jnl`	Quantum and Classical Algorithms for Approximate Submodular Function Minimization. CoRR Yassine Hamoudi, Patrick Rebentrost, Ansis Rosmanis, Miklos Santha
2019	J	`jnl`	Quantum and classical algorithms for approximate submodular function minimization. Quantum Inf. Comput. Yassine Hamoudi, Patrick Rebentrost, Ansis Rosmanis, Miklos Santha
2019	A	`conf`	Strategies for Quantum Races. ITCS Troy Lee, Maharshi Ray, Miklos Santha
2018	—	`conf`	A New Public-Key Cryptosystem via Mersenne Numbers. CRYPTO (3) Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha
2018	J	`jnl`	A composition theorem for randomized query complexity via max conflict complexity. CoRR Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal
2018	J	`jnl`	Linear-Time Algorithm for Quantum 2SAT. Theory Comput. Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
2018	A	`conf`	On Learning Linear Functions from Subset and Its Applications in Quantum Computing. ESA Gábor Ivanyos, Anupam Prakash, Miklos Santha
2018	J	`jnl`	On learning linear functions from subset and its applications in quantum computing. CoRR Gábor Ivanyos, Anupam Prakash, Miklos Santha
2018	J	`jnl`	On the complexity of trial and error for constraint satisfaction problems. J. Comput. Syst. Sci. Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
2018	J	`jnl`	On the randomised query complexity of composition. CoRR Dmitry Gavinsky, Troy Lee, Miklos Santha
2018	J	`jnl`	Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields. Algorithmica Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski
2018	Misc	`conf`	Quadratically Tight Relations for Randomized Query Complexity. CSR Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
2018	J	`jnl`	Quantum Attacks on Bitcoin, and How to Protect Against Them. Ledger Divesh Aggarwal, Gavin K. Brennen, Troy Lee, Miklos Santha, Marco Tomamichel
2018	B	`conf`	Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). MFCS Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka
2018	J	`jnl`	Quantum generalizations of the polynomial hierarchy with applications to QMA(2). CoRR Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka
2018	J	`jnl`	Strategies for quantum races. CoRR Troy Lee, Maharshi Ray, Miklos Santha
2017	—	`conf`	A Composition Theorem for Randomized Query Complexity. FSTTCS Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal
2017	J	`jnl`	A Composition Theorem for Randomized Query Complexity. CoRR Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal
2017	J	`jnl`	A Composition Theorem for Randomized Query complexity. Electron. Colloquium Comput. Complex. Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal
2017	J	`jnl`	A New Public-Key Cryptosystem via Mersenne Numbers. IACR Cryptol. ePrint Arch. Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha
2017	J	`jnl`	Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing. Algorithmica Troy Lee, Frédéric Magniez, Miklos Santha
2017	A	`conf`	On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. CCC Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang
2017	J	`jnl`	On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. CoRR Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang
2017	J	`jnl`	Quadratically Tight Relations for Randomized Query Complexity. CoRR Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
2017	J	`jnl`	Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
2017	J	`jnl`	Separations in Query Complexity Based on Pointer Functions. J. ACM Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs
2017	J	`jnl`	Solving systems of diagonal polynomial equations over finite fields. Theor. Comput. Sci. Gábor Ivanyos, Miklos Santha
2016	J	`jnl`	Improved bounds for the randomized decision tree Complexity of recursive majority. Random Struct. Algorithms Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao
2016	A*	`conf`	Linear Time Algorithm for Quantum 2SAT. ICALP Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
2016	B	`conf`	On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. MFCS Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
2016	J	`jnl`	On the complexity of probabilistic trials for hidden satisfiability problems. CoRR Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
2016	A*	`conf`	Separations in Communication Complexity Using Cheat Sheets and Information Complexity. FOCS Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha
2016	J	`jnl`	Separations in communication complexity using cheat sheets and information complexity. CoRR Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha
2016	J	`jnl`	Separations in communication complexity using cheat sheets and information complexity. Electron. Colloquium Comput. Complex. Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha
2016	A*	`conf`	Separations in query complexity based on pointer functions. STOC Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs
2015	J	`jnl`	Generalized Wong sequences and their applications to Edmonds' problems. J. Comput. Syst. Sci. Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha
2015	J	`jnl`	Linear time algorithm for quantum 2SAT. CoRR Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
2015	Misc	`conf`	On Solving Systems of Diagonal Polynomial Equations Over Finite Fields. FAW Gábor Ivanyos, Miklos Santha
2015	J	`jnl`	On solving systems of diagonal polynomial equations over finite fields. CoRR Gábor Ivanyos, Miklos Santha
2015	J	`jnl`	Polynomial Interpolation and Identity Testing from High Powers over Finite Fields. CoRR Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski
2015	C	`conf`	Quantum and Randomized Query Complexities (Extended Abstract). TAMC Miklos Santha
2015	—	`conf`	Separating Decision Tree Complexity from Subcube Partition Complexity. APPROX-RANDOM Robin Kothari, David Racicot-Desloges, Miklos Santha
2015	J	`jnl`	Separating decision tree complexity from subcube partition complexity. CoRR Robin Kothari, David Racicot-Desloges, Miklos Santha
2015	J	`jnl`	Separations in Query Complexity Based on Pointer Functions. CoRR Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs
2015	J	`jnl`	Separations in Query Complexity Based on Pointer Functions. Electron. Colloquium Comput. Complex. Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs
2014	—	`conf`	An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. MFCS (2) Thomas Decker, Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha
2014	A	`conf`	Generalized Wong sequences and their applications to Edmonds' problems. STACS Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha
2014	J	`jnl`	Hidden Translation and Translating Coset in Quantum Computing. SIAM J. Comput. Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen
2014	—	`conf`	On the Complexity of Trial and Error for Constraint Satisfaction Problems. ICALP (1) Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
2014	J	`jnl`	On the Complexity of Trial and Error for Constraint Satisfaction Problems. CoRR Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
2014	J	`jnl`	On the complexity of trial and error for constraint satisfaction problems. Electron. Colloquium Comput. Complex. Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
2014	J	`jnl`	Polynomial time quantum algorithms for certain bivariate hidden polynomial problems. Quantum Inf. Comput. Thomas Decker, Peter Høyer, Gábor Ivanyos, Miklos Santha
2013	J	`jnl`	Generalized Wong sequences and their applications to Edmonds' problems. CoRR Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha
2013	J	`jnl`	Generalized Wong sequences and their applications to Edmonds' problems. Electron. Colloquium Comput. Complex. Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha
2013	J	`jnl`	Hidden Symmetry Subgroup Problems. SIAM J. Comput. Thomas Decker, Gábor Ivanyos, Miklos Santha, Pawel Wocjan
2013	J	`jnl`	Improved bounds for the randomized decision tree complexity of recursive majority. CoRR Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao
2013	A*	`conf`	Improved quantum query algorithms for triangle finding and associativity testing. SODA Troy Lee, Frédéric Magniez, Miklos Santha
2013	C	`conf`	Query Complexity of Matroids. CIAC Raghav Kulkarni, Miklos Santha
2012	J	`jnl`	An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. Algorithmica Gábor Ivanyos, Luc Sanselme, Miklos Santha
2012	J	`jnl`	Learning graph based quantum query algorithms for finding constant-size subgraphs. Chic. J. Theor. Comput. Sci. Troy Lee, Frédéric Magniez, Miklos Santha
2012	J	`jnl`	New bounds on the classical and quantum communication complexity of some graph properties CoRR Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf
2012	—	`conf`	New bounds on the classical and quantum communication complexity of some graph properties. FSTTCS Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf
2012	J	`jnl`	On the Hitting Times of Quantum Versus Random Walks. Algorithmica Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha
2012	J	`jnl`	On the Power of a Unique Quantum Witness. Theory Comput. Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang
2012	J	`jnl`	Query complexity of matroids. Electron. Colloquium Comput. Complex. Raghav Kulkarni, Miklos Santha
2011	J	`jnl`	A learning graph based quantum query algorithm for finding constant-size subgraphs CoRR Troy Lee, Frédéric Magniez, Miklos Santha
2011	—	`conf`	Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. ICALP (1) Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao
2011	J	`jnl`	Search via Quantum Walk. SIAM J. Comput. Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha
2011	—	`conf`	The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays. WINE Frédéric Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun
2011	J	`jnl`	The complexity of approximate Nash equilibrium in congestion games with negative delays CoRR Frédéric Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun
2010	J	`jnl`	Improved bounds for the randomized decision tree complexity of recursive majority. Electron. Colloquium Comput. Complex. Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao
2010	A	`conf`	On the Power of a Unique Quantum Witness. ICS Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang
2010	J	`jnl`	Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity CoRR Rahul Jain, Hartmut Klauck, Miklos Santha
2010	J	`jnl`	Optimal direct sum results for deterministic and randomized decision tree complexity. Inf. Process. Lett. Rahul Jain, Hartmut Klauck, Miklos Santha
2010	Misc	`conf`	Quantization of Random Walks: Search Algorithms and Hitting Time. CSR Miklos Santha
2009	J	`jnl`	On the Black-Box Complexity of Sperner's Lemma. Theory Comput. Syst. Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
2009	A*	`conf`	On the hitting times of quantum versus random walks. SODA Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha
2009	J	`jnl`	Quantum Testers for Hidden Group Properties. Fundam. Informaticae Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen
2009	J	`jnl`	Quantum and Classical Query Complexities of Local Search Are Polynomially Related. Algorithmica Miklos Santha, Mario Szegedy
2008	B	`conf`	An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. LATIN Gábor Ivanyos, Luc Sanselme, Miklos Santha
2008	B	`conf`	Approximate Nash Equilibria for Multi-player Games. SAGT Sébastien Hémon, Michel de Rougemont, Miklos Santha
2008	J	`jnl`	On the hitting times of quantum versus random walks. CoRR Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha
2008	C	`conf`	Quantum Walk Based Search Algorithms. TAMC Miklos Santha
2008	J	`jnl`	Quantum walk based search algorithms CoRR Miklos Santha
2007	A	`conf`	An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups. STACS Gábor Ivanyos, Luc Sanselme, Miklos Santha
2007	J	`jnl`	Quantum Algorithms for the Triangle Problem. SIAM J. Comput. Frédéric Magniez, Miklos Santha, Mario Szegedy
2007	A*	`conf`	Search via quantum walk. STOC Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha
2007	J	`jnl`	Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. SIAM J. Comput. Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
2006	C	`conf`	Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. CIAC Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
2006	J	`jnl`	Search via Quantum Walk. CoRR Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha
2005	A*	`conf`	Efficient testing of groups. STOC Katalin Friedl, Gábor Ivanyos, Miklos Santha
2005	B	`conf`	On the Black-Box Complexity of Sperner's Lemma. FCT Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
2005	J	`jnl`	Quantum Algorithms for Element Distinctness. SIAM J. Comput. Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
2005	A*	`conf`	Quantum algorithms for the triangle problem. SODA Frédéric Magniez, Miklos Santha, Mario Szegedy
2004	A*	`conf`	Quantum and classical query complexities of local search are polynomially related. STOC Miklos Santha, Mario Szegedy
2003	J	`jnl`	Approximate testing with error relative to input size. J. Comput. Syst. Sci. Marcos A. Kiwi, Frédéric Magniez, Miklos Santha
2003	J	`jnl`	Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem. Int. J. Found. Comput. Sci. Gábor Ivanyos, Frédéric Magniez, Miklos Santha
2003	A*	`conf`	Hidden translation and orbit coset in quantum computing. STOC Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen
2003	B	`conf`	Quantum Testers for Hidden Group Properties. MFCS Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen
2003	J	`jnl`	Semantical Counting Circuits. Theory Comput. Syst. Fabrice Noilhan, Miklos Santha
2002	J	`jnl`	A Decision Procedure for Unitary Linear Quantum Cellular Automata. SIAM J. Comput. Christoph Dürr, Miklos Santha
2002	J	`jnl`	Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem. J. Comput. Syst. Sci. Cristina Bazgan, Miklos Santha, Zsolt Tuza
2001	B	`conf`	Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. SPAA Gábor Ivanyos, Frédéric Magniez, Miklos Santha
2001	J	`jnl`	Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey Electron. Colloquium Comput. Complex. Marcos A. Kiwi, Frédéric Magniez, Miklos Santha
2001	A	`conf`	Quantum Algorithms for Element Distinctness. CCC Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
2000	A	`conf`	Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey. Theoretical Aspects of Computer Science Marcos A. Kiwi, Frédéric Magniez, Miklos Santha
2000	A*	`conf`	Self-testing of universal and fault-tolerant sets of quantum gates. STOC Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
2000	C	`conf`	Semantical Counting Circuits. CIAC Fabrice Noilhan, Miklos Santha
1999	J	`jnl`	A decision procedure for well-formed linear quantum cellular automata CoRR Christoph Dürr, Huong Lê Thanh, Miklos Santha
1999	A*	`conf`	Approximate Testing with Relative Error. STOC Marcos A. Kiwi, Frédéric Magniez, Miklos Santha
1999	J	`jnl`	On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs. J. Algorithms Cristina Bazgan, Miklos Santha, Zsolt Tuza
1999	J	`jnl`	Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates CoRR Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
1998	J	`jnl`	Average-Case Analysis of the Merging Algorithm of Hwang and Lin. Algorithmica Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha
1998	A*	`conf`	Efficient Approximation Algorithms for the Subset-Sums Equality Problem. ICALP Cristina Bazgan, Miklos Santha, Zsolt Tuza
1998	A	`conf`	On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract). STACS Cristina Bazgan, Miklos Santha, Zsolt Tuza
1998	J	`jnl`	Verifying the Determinant in Parallel. Comput. Complex. Miklos Santha, Sovanna Tan
1997	J	`jnl`	A decision procedure for well-formed linear quantum cellular automata. Random Struct. Algorithms Christoph Dürr, Huong Lê Thanh, Miklos Santha
1996	A*	`conf`	A Decision Procedure for Unitary Linear Quantum Cellular Automata. FOCS Christoph Dürr, Miklos Santha
1996	A	`conf`	A Decision Procedure for Well-Formed Linear Quantum Cellular Automata. STACS Christoph Dürr, Huong Lê Thanh, Miklos Santha
1996	J	`jnl`	A decision procedure for unitary linear quantum cellular automata CoRR Christoph Dürr, Miklos Santha
1996	J	`jnl`	Oblivious Transfers and Intersecting Codes. IACR Cryptol. ePrint Arch. Gilles Brassard, Claude Crépeau, Miklos Santha
1996	J	`jnl`	Oblivious transfers and intersecting codes. IEEE Trans. Inf. Theory Gilles Brassard, Claude Crépeau, Miklos Santha
1995	J	`jnl`	A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. J. Algorithms Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha
1995	J	`jnl`	On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. Random Struct. Algorithms Miklos Santha
1994	—	`conf`	On the Interactive Complexity of Graph Reliability. FSTTCS Jean Marc Couveignes, Juan Francisco Díaz-Frías, Michel de Rougemont, Miklos Santha
1994	B	`conf`	Verifying the Determinant in Parallel. ISAAC Miklos Santha, Sovanna Tan
1993	—	`conf`	A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. PARLE Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha
1993	J	`jnl`	Limiting Negations in Constant Depth Circuits. SIAM J. Comput. Miklos Santha, Christopher B. Wilson
1993	J	`jnl`	Parallel searching of multidimensional cubes. Discret. Math. Miklos Santha, Umesh V. Vazirani
1993	J	`jnl`	Two Probabilistic Results on Merging. SIAM J. Comput. Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
1992	J	`jnl`	Deciding Bisimilarity is P-Complete. Formal Aspects Comput. José L. Balcázar, Joaquim Gabarró, Miklos Santha
1991	—	`conf`	On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. SCT Miklos Santha
1991	A*	`conf`	On the Reversibility of Oblivious Transfer. EUROCRYPT Claude Crépeau, Miklos Santha
1991	—	`conf`	Parallel Complexity in the Design and Analysis on Conurrent Systems. PARLE (1) Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, Miklos Santha
1991	A	`conf`	Polynomial Size Constant Depth Circuits with a Limited Number of Negations. STACS Miklos Santha, Christopher B. Wilson
1990	—	`conf`	Two Probabilistic Results on Merging. SIGAL International Symposium on Algorithms Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
1989	J	`jnl`	Relativized Arthur-Merlin versus Merlin-Arthur Games Inf. Comput. Miklos Santha
1987	J	`jnl`	On Using Deterministic Functions to Reduce Randomness in Probabilistic Algorithms Inf. Comput. Miklos Santha
1987	—	`conf`	Relativized Arthur-Merlin versus Merlin-Arthur Games. FSTTCS Miklos Santha
1986	J	`jnl`	Generating Quasi-random Sequences from Semi-random Sources. J. Comput. Syst. Sci. Miklos Santha, Umesh V. Vazirani
1984	A*	`conf`	Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) FOCS Miklos Santha, Umesh V. Vazirani