| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gábor Ivanyos, Luc Sanselme, Miklos Santha |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha |
On the Hitting Times of Quantum Versus Random Walks. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2012 |
DBLP BibTeX RDF |
|
| 1 | Troy Lee, Frédéric Magniez, Miklos Santha |
A learning graph based quantum query algorithm for finding constant-size subgraphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun |
The complexity of approximate Nash equilibrium in congestion games with negative delays |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha |
Search via Quantum Walk. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao |
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Hartmut Klauck, Miklos Santha |
Optimal direct sum results for deterministic and randomized decision tree complexity. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao |
Improved bounds for the randomized decision tree complexity of recursive majority. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rahul Jain, Hartmut Klauck, Miklos Santha |
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Miklos Santha |
Quantization of Random Walks: Search Algorithms and Hitting Time. |
CSR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang |
On the Power of a Unique Quantum Witness. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Miklos Santha, Mario Szegedy |
Quantum and Classical Query Complexities of Local Search Are Polynomially Related. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Local search, Quantum computing, Query complexity |
| 1 | Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen |
Quantum Testers for Hidden Group Properties. |
Fundam. Inform. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven |
On the Black-Box Complexity of Sperner's Lemma. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Sperner’s lemma, Probabilistic and quantum lower bound, Deterministic algorithm, Query complexity |
| 1 | Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha |
On the hitting times of quantum versus random walks. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha |
Quantum walk based search algorithms |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Miklos Santha |
Quantum Walk Based Search Algorithms. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Ivanyos, Luc Sanselme, Miklos Santha |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Hémon, Michel de Rougemont, Miklos Santha |
Approximate Nash Equilibria for Multi-player Games. |
SAGT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Miklos Santha, Mario Szegedy |
Quantum Algorithms for the Triangle Problem. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Ivanyos, Luc Sanselme, Miklos Santha |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha |
Search via quantum walk. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
amplitude amplification, phase gap, recursive amplitude amplification, reflection operator, spectral gap, search, Markov chain, phase estimation, hitting time, quantum walk |
| 1 | Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven |
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Miklos Santha, Mario Szegedy |
Quantum algorithms for the triangle problem. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven |
On the Black-Box Complexity of Sperner's Lemma. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Friedl, Gábor Ivanyos, Miklos Santha |
Efficient testing of groups. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
group multiplication testing, quantum computation, edit distance, probabilistic computation |
| 1 | Miklos Santha, Mario Szegedy |
Quantum and classical query complexities of local search are polynomially related. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
PLO, neighborhood structure, decision trees, quantum computation, query model, local optimization |
| 1 | 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. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrice Noilhan, Miklos Santha |
Semantical Counting Circuits. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcos A. Kiwi, Frédéric Magniez, Miklos Santha |
Approximate testing with error relative to input size. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen |
Quantum Testers for Hidden Group Properties. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen |
Hidden translation and orbit coset in quantum computing. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Miklos Santha, Zsolt Tuza |
Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Dürr, Miklos Santha |
A Decision Procedure for Unitary Linear Quantum Cellular Automata. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcos A. Kiwi, Frédéric Magniez, Miklos Santha |
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Gábor Ivanyos, Frédéric Magniez, Miklos Santha |
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. |
SPAA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf |
Quantum Algorithms for Element Distinctness. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha |
Self-testing of universal and fault-tolerant sets of quantum gates. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrice Noilhan, Miklos Santha |
Semantical Counting Circuits. |
CIAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Miklos Santha, Zsolt Tuza |
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Dürr, Huong Lê Thanh, Miklos Santha |
A decision procedure for well-formed linear quantum cellular automata |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha |
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Marcos A. Kiwi, Frédéric Magniez, Miklos Santha |
Approximate Testing with Relative Error. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha |
Average-Case Analysis of the Merging Algorithm of Hwang and Lin. |
Algorithmica |
1998 |
DBLP DOI BibTeX RDF |
Merging, Average-case analysis |
| 1 | Miklos Santha, Sovanna Tan |
Verifying the Determinant in Parallel. |
Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Miklos Santha, Zsolt Tuza |
Efficient Approximation Algorithms for the Subset-Sums Equality Problem. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Miklos Santha, Zsolt Tuza |
On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract). |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Dürr, Huong Lê Thanh, Miklos Santha |
A decision procedure for well-formed linear quantum cellular automata. |
Random Struct. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Dürr, Miklos Santha |
A decision procedure for unitary linear quantum cellular automata |
CoRR |
1996 |
DBLP BibTeX RDF |
|
| 1 | Gilles Brassard, Claude Crépeau, Miklos Santha |
Oblivious transfers and intersecting codes. |
IEEE Transactions on Information Theory |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Dürr, Huong Lê Thanh, Miklos Santha |
A Decision Procedure for Well-Formed Linear Quantum Cellular Automata. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
Classification of topics algorithms, computational complexity, automata and formal languages |
| 1 | Christoph Dürr, Miklos Santha |
A Decision Procedure for Unitary Linear Quantum Cellular Automata. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
linear quantum, unitary, complexity, cellular automata, cellular automata, quantum computing, decision procedure |
| 1 | Miklos Santha |
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. |
Random Struct. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha |
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. |
J. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha, Sovanna Tan |
Verifying the Determinant in Parallel. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Marc Couveignes, Juan Francisco Díaz-Frías, Michel de Rougemont, Miklos Santha |
On the Interactive Complexity of Graph Reliability. |
FSTTCS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha, Umesh V. Vazirani |
Parallel searching of multidimensional cubes. |
Discrete Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha |
Two Probabilistic Results on Merging. |
SIAM J. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha, Christopher B. Wilson |
Limiting Negations in Constant Depth Circuits. |
SIAM J. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha |
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. |
PARLE |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | José L. Balcázar, Joaquim Gabarró, Miklos Santha |
Deciding Bisimilarity is P-Complete. |
Formal Asp. Comput. |
1992 |
DBLP BibTeX RDF |
|
| 1 | Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, Miklos Santha |
Parallel Complexity in the Design and Analysis on Conurrent Systems. |
PARLE |
1991 |
DBLP DOI BibTeX RDF |
partially commutative monoids, PRAM algorithms, Petri nets, CCS, boolean circuits, P-completeness |
| 1 | Miklos Santha, Christopher B. Wilson |
Polynomial Size Constant Depth Circuits with a Limited Number of Negations. |
STACS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Claude Crépeau, Miklos Santha |
On the Reversibility of Oblivious Transfer. |
EUROCRYPT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha |
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. |
Structure in Complexity Theory Conference |
1991 |
DBLP BibTeX RDF |
|
| 1 | Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha |
Two Probabilistic Results on Merging. |
SIGAL International Symposium on Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha |
Relativized Arthur-Merlin versus Merlin-Arthur Games |
Inf. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha |
On Using Deterministic Functions to Reduce Randomness in Probabilistic Algorithms |
Inf. Comput. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha |
Relativized Arthur-Merlin versus Merlin-Arthur Games. |
FSTTCS |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha, Umesh V. Vazirani |
Generating Quasi-random Sequences from Semi-random Sources. |
J. Comput. Syst. Sci. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklos Santha, Umesh V. Vazirani |
Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) |
FOCS |
1984 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")