default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiklos Santha
Person information
SPARQL queries 
🛈 Please note that only 70% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i49]Jonathan Allcock, João F. Doriguello, Gábor Ivanyos, Miklos Santha:
Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits. CoRR abs/2405.06357 (2024)- [i48]Divesh Aggarwal, Antoine Joux, Miklos Santha, Karol Wegrzycki:
Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime. CoRR abs/2407.05435 (2024) - [i47]Itai Arad, Miklos Santha:
Quasi-quantum states and the quasi-quantum PCP theorem. CoRR abs/2410.13549 (2024) - 2023
- [j50]Siyi Yang, Naixu Guo
, Miklos Santha, Patrick Rebentrost:
Quantum Alphatron: quantum advantage for learning with kernels and noise. Quantum 7: 1174 (2023) - [j49]Dmytro Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal:
Optimal Composition Theorem for Randomized Query Complexity. Theory Comput. 19: 1-35 (2023) - [i46]Jonathan Allcock, Jinge Bao, João F. Doriguello, Alessandro Luongo, Miklos Santha:
Constant-depth circuits for Uniformly Controlled Gates and Boolean functions with application to quantum memory circuits. CoRR abs/2308.08539 (2023) - [i45]Jonathan Allcock, Jinge Bao, Aleksandrs Belovs, Troy Lee, Miklos Santha:
On the quantum time complexity of divide and conquer. CoRR abs/2311.16401 (2023) - 2022
- [j48]Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka:
Quantum generalizations of the polynomial hierarchy with applications to QMA(2). Comput. Complex. 31(2): 13 (2022) - [c62]Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha:
Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming. ESA 2022: 6:1-6:18 - [c61]João F. Doriguello, Alessandro Luongo, Jinge Bao, Patrick Rebentrost, Miklos Santha:
Quantum Algorithm for Stochastic Optimal Stopping Problems with Applications in Finance. TQC 2022: 2:1-2:24 - 2021
- [j47]Serge Massar, Miklos Santha:
Total functions in QMA. Quantum Inf. Process. 20(1): 35 (2021) - [j46]Serge Massar, Miklos Santha:
Characterising the intersection of QMA and coQMA. Quantum Inf. Process. 20(12): 396 (2021) - [c60]Troy Lee, Tongyang Li, Miklos Santha, Shengyu Zhang:
On the Cut Dimension of a Graph. CCC 2021: 15:1-15:35 - [c59]Troy Lee, Miklos Santha, Shengyu Zhang:
Quantum algorithms for graph problems with cut queries. SODA 2021: 939-958 - [i44]Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha:
Classical and quantum dynamic programming for Subset-Sum and variants. CoRR abs/2111.07059 (2021) - 2020
- [j45]Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. 64(1): 101-119 (2020) - [i43]Troy Lee, Miklos Santha, Shengyu Zhang:
Quantum algorithms for graph problems with cut queries. CoRR abs/2007.08285 (2020) - [i42]Troy Lee, Tongyang Li, Miklos Santha, Shengyu Zhang:
On the cut dimension of a graph. CoRR abs/2011.05085 (2020)
2010 – 2019
- 2019
- [j44]Yassine Hamoudi, Patrick Rebentrost, Ansis Rosmanis, Miklos Santha:
Quantum and classical algorithms for approximate submodular function minimization. Quantum Inf. Comput. 19(15&16): 1325-1349 (2019) - [c58]Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. ICALP 2019: 64:1-64:13 - [c57]Troy Lee, Maharshi Ray, Miklos Santha:
Strategies for Quantum Races. ITCS 2019: 51:1-51:21 - [i41]Yassine Hamoudi, Patrick Rebentrost, Ansis Rosmanis, Miklos Santha:
Quantum and Classical Algorithms for Approximate Submodular Function Minimization. CoRR abs/1907.05378 (2019) - [i40]Gábor Ivanyos, Antoine Joux, Miklos Santha:
Discrete logarithm and Diffie-Hellman problems in identity black-box groups. CoRR abs/1911.01662 (2019) - 2018
- [j43]Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski:
Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields. Algorithmica 80(2): 560-575 (2018) - [j42]Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram:
On the complexity of trial and error for constraint satisfaction problems. J. Comput. Syst. Sci. 92: 48-64 (2018) - [j41]Divesh Aggarwal, Gavin K. Brennen, Troy Lee, Miklos Santha, Marco Tomamichel:
Quantum Attacks on Bitcoin, and How to Protect Against Them. Ledger 3 (2018) - [j40]Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
Linear-Time Algorithm for Quantum 2SAT. Theory Comput. 14(1): 1-27 (2018) - [c56]Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha:
A New Public-Key Cryptosystem via Mersenne Numbers. CRYPTO (3) 2018: 459-482 - [c55]Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CSR 2018: 207-219 - [c54]Gábor Ivanyos, Anupam Prakash, Miklos Santha:
On Learning Linear Functions from Subset and Its Applications in Quantum Computing. ESA 2018: 66:1-66:14 - [c53]Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka:
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). MFCS 2018: 58:1-58:16 - [i39]Dmitry Gavinsky, Troy Lee, Miklos Santha:
On the randomised query complexity of composition. CoRR abs/1801.02226 (2018) - [i38]Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka:
Quantum generalizations of the polynomial hierarchy with applications to QMA(2). CoRR abs/1805.11139 (2018) - [i37]Gábor Ivanyos, Anupam Prakash, Miklos Santha:
On learning linear functions from subset and its applications in quantum computing. CoRR abs/1806.09660 (2018) - [i36]Troy Lee, Maharshi Ray, Miklos Santha:
Strategies for quantum races. CoRR abs/1809.03671 (2018) - [i35]Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal:
A composition theorem for randomized query complexity via max conflict complexity. CoRR abs/1811.10752 (2018) - 2017
- [j39]Troy Lee, Frédéric Magniez, Miklos Santha:
Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing. Algorithmica 77(2): 459-486 (2017) - [j38]Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs:
Separations in Query Complexity Based on Pointer Functions. J. ACM 64(5): 32:1-32:24 (2017) - [j37]Gábor Ivanyos, Miklos Santha:
Solving systems of diagonal polynomial equations over finite fields. Theor. Comput. Sci. 657: 73-85 (2017) - [c52]Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang:
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. CCC 2017: 30:1-30:24 - [c51]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. FSTTCS 2017: 10:1-10:13 - [i34]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. CoRR abs/1706.00335 (2017) - [i33]Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CoRR abs/1708.00822 (2017) - [i32]Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang:
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. CoRR abs/1710.08602 (2017) - [i31]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i30]Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i29]Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha:
A New Public-Key Cryptosystem via Mersenne Numbers. IACR Cryptol. ePrint Arch. 2017: 481 (2017) - 2016
- [j36]Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao:
Improved bounds for the randomized decision tree Complexity of recursive majority. Random Struct. Algorithms 48(3): 612-638 (2016) - [c50]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in Communication Complexity Using Cheat Sheets and Information Complexity. FOCS 2016: 555-564 - [c49]Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
Linear Time Algorithm for Quantum 2SAT. ICALP 2016: 15:1-15:14 - [c48]Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. MFCS 2016: 12:1-12:14 - [c47]Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs:
Separations in query complexity based on pointer functions. STOC 2016: 800-813 - [i28]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. CoRR abs/1605.01142 (2016) - [i27]Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
On the complexity of probabilistic trials for hidden satisfiability problems. CoRR abs/1606.03585 (2016) - [i26]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j35]Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha:
Generalized Wong sequences and their applications to Edmonds' problems. J. Comput. Syst. Sci. 81(7): 1373-1386 (2015) - [c46]Robin Kothari, David Racicot-Desloges, Miklos Santha:
Separating Decision Tree Complexity from Subcube Partition Complexity. APPROX-RANDOM 2015: 915-930 - [c45]Gábor Ivanyos, Miklos Santha:
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields. FAW 2015: 125-137 - [c44]Miklos Santha:
Quantum and Randomized Query Complexities (Extended Abstract). TAMC 2015: 18-19 - [i25]Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski:
Polynomial Interpolation and Identity Testing from High Powers over Finite Fields. CoRR abs/1502.06631 (2015) - [i24]Gábor Ivanyos, Miklos Santha:
On solving systems of diagonal polynomial equations over finite fields. CoRR abs/1503.09016 (2015) - [i23]Robin Kothari, David Racicot-Desloges, Miklos Santha:
Separating decision tree complexity from subcube partition complexity. CoRR abs/1504.01339 (2015) - [i22]Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs:
Separations in Query Complexity Based on Pointer Functions. CoRR abs/1506.04719 (2015) - [i21]Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
Linear time algorithm for quantum 2SAT. CoRR abs/1508.06340 (2015) - [i20]Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs:
Separations in Query Complexity Based on Pointer Functions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j34]Thomas Decker, Peter Høyer, Gábor Ivanyos, Miklos Santha:
Polynomial time quantum algorithms for certain bivariate hidden polynomial problems. Quantum Inf. Comput. 14(9-10): 790-806 (2014) - [j33]Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen:
Hidden Translation and Translating Coset in Quantum Computing. SIAM J. Comput. 43(1): 1-24 (2014) - [c43]Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram:
On the Complexity of Trial and Error for Constraint Satisfaction Problems. ICALP (1) 2014: 663-675 - [c42]Thomas Decker, Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha:
An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. MFCS (2) 2014: 226-238 - [c41]Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha:
Generalized Wong sequences and their applications to Edmonds' problems. STACS 2014: 397-408 - [i19]Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram:
On the Complexity of Trial and Error for Constraint Satisfaction Problems. CoRR abs/1406.5336 (2014) - [i18]Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram:
On the complexity of trial and error for constraint satisfaction problems. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j32]Thomas Decker, Gábor Ivanyos, Miklos Santha, Pawel Wocjan:
Hidden Symmetry Subgroup Problems. SIAM J. Comput. 42(5): 1987-2007 (2013) - [c40]Raghav Kulkarni, Miklos Santha:
Query Complexity of Matroids. CIAC 2013: 300-311 - [c39]Troy Lee, Frédéric Magniez, Miklos Santha:
Improved quantum query algorithms for triangle finding and associativity testing. SODA 2013: 1486-1502 - [i17]Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha:
Generalized Wong sequences and their applications to Edmonds' problems. CoRR abs/1307.6429 (2013) - [i16]Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao:
Improved bounds for the randomized decision tree complexity of recursive majority. CoRR abs/1309.7565 (2013) - [i15]Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha:
Generalized Wong sequences and their applications to Edmonds' problems. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j31]Gábor Ivanyos, Luc Sanselme, Miklos Santha:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. Algorithmica 62(1-2): 480-498 (2012) - [j30]Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha:
On the Hitting Times of Quantum Versus Random Walks. Algorithmica 63(1-2): 91-116 (2012) - [j29]Troy Lee, Frédéric Magniez, Miklos Santha:
Learning graph based quantum query algorithms for finding constant-size subgraphs. Chic. J. Theor. Comput. Sci. 2012 (2012) - [j28]Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang:
On the Power of a Unique Quantum Witness. Theory Comput. 8(1): 375-400 (2012) - [c38]Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf:
New bounds on the classical and quantum communication complexity of some graph properties. FSTTCS 2012: 148-159 - [i14]Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf:
New bounds on the classical and quantum communication complexity of some graph properties. CoRR abs/1204.4596 (2012) - [i13]Raghav Kulkarni, Miklos Santha:
Query complexity of matroids. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j27]Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha:
Search via Quantum Walk. SIAM J. Comput. 40(1): 142-164 (2011) - [c37]Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao:
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. ICALP (1) 2011: 317-329 - [c36]Frédéric Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun:
The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays. WINE 2011: 266-277 - [i12]Frédéric Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun:
The complexity of approximate Nash equilibrium in congestion games with negative delays. CoRR abs/1102.1161 (2011) - [i11]Troy Lee, Frédéric Magniez, Miklos Santha:
A learning graph based quantum query algorithm for finding constant-size subgraphs. CoRR abs/1109.5135 (2011) - 2010
- [j26]Rahul Jain, Hartmut Klauck, Miklos Santha:
Optimal direct sum results for deterministic and randomized decision tree complexity. Inf. Process. Lett. 110(20): 893-897 (2010) - [c35]Miklos Santha:
Quantization of Random Walks: Search Algorithms and Hitting Time. CSR 2010: 343 - [c34]Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang:
On the Power of a Unique Quantum Witness. ICS 2010: 470-481 - [i10]Rahul Jain, Hartmut Klauck, Miklos Santha:
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity. CoRR abs/1004.0105 (2010) - [i9]Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao:
Improved bounds for the randomized decision tree complexity of recursive majority. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j25]Miklos Santha, Mario Szegedy:
Quantum and Classical Query Complexities of Local Search Are Polynomially Related. Algorithmica 55(3): 557-575 (2009) - [j24]Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen:
Quantum Testers for Hidden Group Properties. Fundam. Informaticae 91(2): 325-340 (2009) - [j23]Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven:
On the Black-Box Complexity of Sperner's Lemma. Theory Comput. Syst. 45(3): 629-646 (2009) - [c33]Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha:
On the hitting times of quantum versus random walks. SODA 2009: 86-95 - 2008
- [c32]Gábor Ivanyos, Luc Sanselme, Miklos Santha:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. LATIN 2008: 759-771 - [c31]Sébastien Hémon, Michel de Rougemont, Miklos Santha:
Approximate Nash Equilibria for Multi-player Games. SAGT 2008: 267-278 - [c30]Miklos Santha:
Quantum Walk Based Search Algorithms. TAMC 2008: 31-46 - [i8]Miklos Santha:
Quantum walk based search algorithms. CoRR abs/0808.0059 (2008) - [i7]Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha:
On the hitting times of quantum versus random walks. CoRR abs/0808.0084 (2008) - 2007
- [j22]Frédéric Magniez, Miklos Santha, Mario Szegedy:
Quantum Algorithms for the Triangle Problem. SIAM J. Comput. 37(2): 413-424 (2007) - [j21]Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha:
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. SIAM J. Comput. 37(2): 611-629 (2007) - [c29]Gábor Ivanyos, Luc Sanselme, Miklos Santha:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups. STACS 2007: 586-597 - [c28]Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha:
Search via quantum walk. STOC 2007: 575-584 - 2006
- [c27]Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven:
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. CIAC 2006: 380-391 - [i6]Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha:
Search via Quantum Walk. CoRR abs/quant-ph/0608026 (2006) - 2005
- [j20]Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf:
Quantum Algorithms for Element Distinctness. SIAM J. Comput. 34(6): 1324-1330 (2005) - [c26]Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven:
On the Black-Box Complexity of Sperner's Lemma. FCT 2005: 245-257 - [c25]Frédéric Magniez, Miklos Santha, Mario Szegedy:
Quantum algorithms for the triangle problem. SODA 2005: 1109-1117 - [c24]Katalin Friedl, Gábor Ivanyos, Miklos Santha:
Efficient testing of groups. STOC 2005: 157-166 - 2004
- [c23]Miklos Santha, Mario Szegedy:
Quantum and classical query complexities of local search are polynomially related. STOC 2004: 494-501 - 2003
- [j19]Gábor Ivanyos, Frédéric Magniez, Miklos Santha:
Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem. Int. J. Found. Comput. Sci. 14(5): 723-740 (2003) - [j18]Marcos A. Kiwi, Frédéric Magniez, Miklos Santha:
Approximate testing with error relative to input size. J. Comput. Syst. Sci. 66(2): 371-392 (2003) - [j17]Fabrice Noilhan, Miklos Santha:
Semantical Counting Circuits. Theory Comput. Syst. 36(3): 217-229 (2003) - [c22]Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen:
Quantum Testers for Hidden Group Properties. MFCS 2003: 419-428 - [c21]Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen:
Hidden translation and orbit coset in quantum computing. STOC 2003: 1-9 - 2002
- [j16]Cristina Bazgan, Miklos Santha, Zsolt Tuza:
Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem. J. Comput. Syst. Sci. 64(2): 160-170 (2002) - [j15]Christoph Dürr, Miklos Santha:
A Decision Procedure for Unitary Linear Quantum Cellular Automata. SIAM J. Comput. 31(4): 1076-1089 (2002) - 2001
- [c20]Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf:
Quantum Algorithms for Element Distinctness. CCC 2001: 131-137 - [c19]Gábor Ivanyos, Frédéric Magniez, Miklos Santha:
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. SPAA 2001: 263-270 - [i5]Marcos A. Kiwi, Frédéric Magniez, Miklos Santha:
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c18]Marcos A. Kiwi, Frédéric Magniez, Miklos Santha:
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey. Theoretical Aspects of Computer Science 2000: 30-83 - [c17]Fabrice Noilhan, Miklos Santha:
Semantical Counting Circuits. CIAC 2000: 87-101 - [c16]Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha:
Self-testing of universal and fault-tolerant sets of quantum gates. STOC 2000: 688-696
1990 – 1999
- 1999
- [j14]Cristina Bazgan, Miklos Santha, Zsolt Tuza:
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs. J. Algorithms 31(1): 249-268 (1999) - [c15]Marcos A. Kiwi, Frédéric Magniez, Miklos Santha:
Approximate Testing with Relative Error. STOC 1999: 51-60 - [i4]Christoph Dürr, Huong Lê Thanh, Miklos Santha:
A decision procedure for well-formed linear quantum cellular automata. CoRR cs.DS/9906024 (1999) - [i3]Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha:
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. CoRR quant-ph/9904108 (1999) - 1998
- [j13]Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha:
Average-Case Analysis of the Merging Algorithm of Hwang and Lin. Algorithmica 22(4): 483-489 (1998) - [j12]Miklos Santha, Sovanna Tan:
Verifying the Determinant in Parallel. Comput. Complex. 7(2): 128-151 (1998) - [c14]Cristina Bazgan, Miklos Santha, Zsolt Tuza:
Efficient Approximation Algorithms for the Subset-Sums Equality Problem. ICALP 1998: 387-396 - [c13]Cristina Bazgan, Miklos Santha, Zsolt Tuza:
On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract). STACS 1998: 276-286 - 1997
- [j11]Christoph Dürr, Huong Lê Thanh, Miklos Santha:
A decision procedure for well-formed linear quantum cellular automata. Random Struct. Algorithms 11(4): 381-394 (1997) - 1996
- [j10]Gilles Brassard, Claude Crépeau, Miklos Santha:
Oblivious transfers and intersecting codes. IEEE Trans. Inf. Theory 42(6): 1769-1780 (1996) - [c12]Christoph Dürr, Miklos Santha:
A Decision Procedure for Unitary Linear Quantum Cellular Automata. FOCS 1996: 38-45 - [c11]Christoph Dürr, Huong Lê Thanh, Miklos Santha:
A Decision Procedure for Well-Formed Linear Quantum Cellular Automata. STACS 1996: 281-292 - [i2]Christoph Dürr, Miklos Santha:
A decision procedure for unitary linear quantum cellular automata. CoRR quant-ph/9604007 (1996) - [i1]Gilles Brassard, Claude Crépeau, Miklos Santha:
Oblivious Transfers and Intersecting Codes. IACR Cryptol. ePrint Arch. 1996: 10 (1996) - 1995
- [j9]Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha:
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. J. Algorithms 19(3): 432-440 (1995) - [j8]Miklos Santha:
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. Random Struct. Algorithms 6(1): 75-88 (1995) - 1994
- [c10]Jean Marc Couveignes, Juan Francisco Díaz-Frías, Michel de Rougemont, Miklos Santha:
On the Interactive Complexity of Graph Reliability. FSTTCS 1994: 12-23 - [c9]Miklos Santha, Sovanna Tan:
Verifying the Determinant in Parallel. ISAAC 1994: 65-73 - 1993
- [j7]Miklos Santha, Umesh V. Vazirani:
Parallel searching of multidimensional cubes. Discret. Math. 114(1-3): 425-433 (1993) - [j6]Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha:
Two Probabilistic Results on Merging. SIAM J. Comput. 22(2): 261-271 (1993) - [j5]Miklos Santha, Christopher B. Wilson:
Limiting Negations in Constant Depth Circuits. SIAM J. Comput. 22(2): 294-302 (1993) - [c8]Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha:
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. PARLE 1993: 553-560 - 1992
- [j4]José L. Balcázar, Joaquim Gabarró, Miklos Santha:
Deciding Bisimilarity is P-Complete. Formal Aspects Comput. 4(6A): 638-648 (1992) - 1991
- [c7]Miklos Santha:
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. SCT 1991: 180-187 - [c6]Claude Crépeau, Miklos Santha:
On the Reversibility of Oblivious Transfer. EUROCRYPT 1991: 106-113 - [c5]Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, Miklos Santha:
Parallel Complexity in the Design and Analysis on Conurrent Systems. PARLE (1) 1991: 288-303 - [c4]Miklos Santha, Christopher B. Wilson:
Polynomial Size Constant Depth Circuits with a Limited Number of Negations. STACS 1991: 228-237 - 1990
- [c3]Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha:
Two Probabilistic Results on Merging. SIGAL International Symposium on Algorithms 1990: 118-127
1980 – 1989
- 1989
- [j3]Miklos Santha:
Relativized Arthur-Merlin versus Merlin-Arthur Games. Inf. Comput. 80(1): 44-49 (1989) - 1987
- [j2]Miklos Santha:
On Using Deterministic Functions to Reduce Randomness in Probabilistic Algorithms. Inf. Comput. 74(3): 241-249 (1987) - [c2]Miklos Santha:
Relativized Arthur-Merlin versus Merlin-Arthur Games. FSTTCS 1987: 435-442 - 1986
- [j1]Miklos Santha, Umesh V. Vazirani:
Generating Quasi-random Sequences from Semi-random Sources. J. Comput. Syst. Sci. 33(1): 75-87 (1986) - 1984
- [c1]Miklos Santha, Umesh V. Vazirani:
Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract). FOCS 1984: 434-440
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 20:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
