2009 |
60 | EE | 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 |
59 | EE | Gábor Ivanyos,
Luc Sanselme,
Miklos Santha:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups.
LATIN 2008: 759-771 |
58 | EE | Sébastien Hémon,
Michel de Rougemont,
Miklos Santha:
Approximate Nash Equilibria for Multi-player Games.
SAGT 2008: 267-278 |
57 | EE | Miklos Santha:
Quantum Walk Based Search Algorithms.
TAMC 2008: 31-46 |
56 | EE | Miklos Santha:
Quantum walk based search algorithms
CoRR abs/0808.0059: (2008) |
2007 |
55 | EE | Gábor Ivanyos,
Luc Sanselme,
Miklos Santha:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups.
STACS 2007: 586-597 |
54 | EE | Frédéric Magniez,
Ashwin Nayak,
Jeremie Roland,
Miklos Santha:
Search via quantum walk.
STOC 2007: 575-584 |
53 | EE | Frédéric Magniez,
Miklos Santha,
Mario Szegedy:
Quantum Algorithms for the Triangle Problem.
SIAM J. Comput. 37(2): 413-424 (2007) |
52 | EE | 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) |
2006 |
51 | EE | 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 |
2005 |
50 | EE | Katalin Friedl,
Gábor Ivanyos,
Miklos Santha,
Yves F. Verhoeven:
On the Black-Box Complexity of Sperner's Lemma.
FCT 2005: 245-257 |
49 | EE | Frédéric Magniez,
Miklos Santha,
Mario Szegedy:
Quantum algorithms for the triangle problem.
SODA 2005: 1109-1117 |
48 | EE | Katalin Friedl,
Gábor Ivanyos,
Miklos Santha:
Efficient testing of groups.
STOC 2005: 157-166 |
47 | EE | 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) |
2004 |
46 | EE | Miklos Santha,
Mario Szegedy:
Quantum and classical query complexities of local search are polynomially related.
STOC 2004: 494-501 |
2003 |
45 | EE | Katalin Friedl,
Frédéric Magniez,
Miklos Santha,
Pranab Sen:
Quantum Testers for Hidden Group Properties.
MFCS 2003: 419-428 |
44 | EE | 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 |
43 | EE | 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) |
42 | EE | 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) |
41 | EE | Fabrice Noilhan,
Miklos Santha:
Semantical Counting Circuits.
Theory Comput. Syst. 36(3): 217-229 (2003) |
2002 |
40 | EE | Cristina Bazgan,
Miklos Santha,
Zsolt Tuza:
Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem.
J. Comput. Syst. Sci. 64(2): 160-170 (2002) |
39 | EE | Christoph Dürr,
Miklos Santha:
A Decision Procedure for Unitary Linear Quantum Cellular Automata.
SIAM J. Comput. 31(4): 1076-1089 (2002) |
2001 |
38 | EE | Harry Buhrman,
Christoph Dürr,
Mark Heiligman,
Peter Høyer,
Frédéric Magniez,
Miklos Santha,
Ronald de Wolf:
Quantum Algorithms for Element Distinctness.
IEEE Conference on Computational Complexity 2001: 131-137 |
37 | EE | 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 |
36 | EE | 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) 8(14): (2001) |
2000 |
35 | EE | Fabrice Noilhan,
Miklos Santha:
Semantical Counting Circuits.
CIAC 2000: 87-101 |
34 | EE | 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 |
33 | EE | 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 |
1999 |
32 | EE | Marcos A. Kiwi,
Frédéric Magniez,
Miklos Santha:
Approximate Testing with Relative Error.
STOC 1999: 51-60 |
31 | EE | Christoph Dürr,
Huong LeThanh,
Miklos Santha:
A decision procedure for well-formed linear quantum cellular automata
CoRR cs.DS/9906024: (1999) |
30 | EE | 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) |
29 | | 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) |
1998 |
28 | EE | Cristina Bazgan,
Miklos Santha,
Zsolt Tuza:
Efficient Approximation Algorithms for the Subset-Sums Equality Problem.
ICALP 1998: 387-396 |
27 | | 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 |
26 | EE | 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) |
25 | | Miklos Santha,
Sovanna Tan:
Verifying the Determinant in Parallel.
Computational Complexity 7(2): 128-151 (1998) |
1997 |
24 | | Christoph Dürr,
Huong LeThanh,
Miklos Santha:
A decision procedure for well-formed linear quantum cellular automata.
Random Struct. Algorithms 11(4): 381-394 (1997) |
1996 |
23 | | Christoph Dürr,
Miklos Santha:
A Decision Procedure for Unitary Linear Quantum Cellular Automata.
FOCS 1996: 38-45 |
22 | | Christoph Dürr,
Huong Lê Thanh,
Miklos Santha:
A Decision Procedure for Well-Formed Linear Quantum Cellular Automata.
STACS 1996: 281-292 |
21 | EE | Christoph Dürr,
Miklos Santha:
A decision procedure for unitary linear quantum cellular automata
CoRR quant-ph/9604007: (1996) |
20 | | Gilles Brassard,
Claude Crépeau,
Miklos Santha:
Oblivious transfers and intersecting codes.
IEEE Transactions on Information Theory 42(6): 1769-1780 (1996) |
1995 |
19 | | 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) |
18 | | Miklos Santha:
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae.
Random Struct. Algorithms 6(1): 75-88 (1995) |
1994 |
17 | | Jean Marc Couveignes,
Juan Francisco Diaz-Frias,
Michel de Rougemont,
Miklos Santha:
On the Interactive Complexity of Graph Reliability.
FSTTCS 1994: 12-23 |
16 | | Miklos Santha,
Sovanna Tan:
Verifying the Determinant in Parallel.
ISAAC 1994: 65-73 |
1993 |
15 | | Evripidis Bampis,
Mohamed El Haddad,
Yannis Manoussakis,
Miklos Santha:
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.
PARLE 1993: 553-560 |
14 | EE | Miklos Santha,
Umesh V. Vazirani:
Parallel searching of multidimensional cubes.
Discrete Mathematics 114(1-3): 425-433 (1993) |
13 | | Wenceslas Fernandez de la Vega,
Sampath Kannan,
Miklos Santha:
Two Probabilistic Results on Merging.
SIAM J. Comput. 22(2): 261-271 (1993) |
12 | | Miklos Santha,
Christopher B. Wilson:
Limiting Negations in Constant Depth Circuits.
SIAM J. Comput. 22(2): 294-302 (1993) |
1992 |
11 | | José L. Balcázar,
Joaquim Gabarró,
Miklos Santha:
Deciding Bisimilarity is P-Complete.
Formal Asp. Comput. 4(6A): 638-648 (1992) |
1991 |
10 | EE | Claude Crépeau,
Miklos Santha:
On the Reversibility of Oblivious Transfer.
EUROCRYPT 1991: 106-113 |
9 | | 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 |
8 | | Miklos Santha,
Christopher B. Wilson:
Polynomial Size Constant Depth Circuits with a Limited Number of Negations.
STACS 1991: 228-237 |
7 | | Miklos Santha:
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae.
Structure in Complexity Theory Conference 1991: 180-187 |
1990 |
6 | | Wenceslas Fernandez de la Vega,
Sampath Kannan,
Miklos Santha:
Two Probabilistic Results on Merging.
SIGAL International Symposium on Algorithms 1990: 118-127 |
1989 |
5 | | Miklos Santha:
Relativized Arthur-Merlin versus Merlin-Arthur Games
Inf. Comput. 80(1): 44-49 (1989) |
1987 |
4 | | Miklos Santha:
Relativized Arthur-Merlin versus Merlin-Arthur Games.
FSTTCS 1987: 435-442 |
3 | | Miklos Santha:
On Using Deterministic Functions to Reduce Randomness in Probabilistic Algorithms
Inf. Comput. 74(3): 241-249 (1987) |
1986 |
2 | | Miklos Santha,
Umesh V. Vazirani:
Generating Quasi-random Sequences from Semi-random Sources.
J. Comput. Syst. Sci. 33(1): 75-87 (1986) |
1984 |
1 | | Miklos Santha,
Umesh V. Vazirani:
Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract)
FOCS 1984: 434-440 |