The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Miklos Santha: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marcos A. Kiwi, Frédéric Magniez, Miklos Santha
    Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey. [Citation Graph (0, 0)][DBLP]
    Theoretical Aspects of Computer Science, 2000, pp:30-83 [Conf]
  2. Fabrice Noilhan, Miklos Santha
    Semantical Counting Circuits. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:87-101 [Conf]
  3. Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
    Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:380-391 [Conf]
  4. Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
    Quantum Algorithms for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:131-137 [Conf]
  5. Miklos Santha
    On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:180-187 [Conf]
  6. Claude Crépeau, Miklos Santha
    On the Reversibility of Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:106-113 [Conf]
  7. Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
    On the Black-Box Complexity of Sperner's Lemma. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:245-257 [Conf]
  8. Christoph Dürr, Miklos Santha
    A Decision Procedure for Unitary Linear Quantum Cellular Automata. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:38-45 [Conf]
  9. Miklos Santha, Umesh V. Vazirani
    Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:434-440 [Conf]
  10. Jean Marc Couveignes, Juan Francisco Diaz-Frias, Michel de Rougemont, Miklos Santha
    On the Interactive Complexity of Graph Reliability. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:12-23 [Conf]
  11. Miklos Santha
    Relativized Arthur-Merlin versus Merlin-Arthur Games. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1987, pp:435-442 [Conf]
  12. Cristina Bazgan, Miklos Santha, Zsolt Tuza
    Efficient Approximation Algorithms for the Subset-Sums Equality Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:387-396 [Conf]
  13. Miklos Santha, Sovanna Tan
    Verifying the Determinant in Parallel. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:65-73 [Conf]
  14. Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen
    Quantum Testers for Hidden Group Properties. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:419-428 [Conf]
  15. Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, Miklos Santha
    Parallel Complexity in the Design and Analysis on Conurrent Systems. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1991, pp:288-303 [Conf]
  16. Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha
    A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. [Citation Graph (0, 0)][DBLP]
    PARLE, 1993, pp:553-560 [Conf]
  17. Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
    Two Probabilistic Results on Merging. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:118-127 [Conf]
  18. Frédéric Magniez, Miklos Santha, Mario Szegedy
    Quantum algorithms for the triangle problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1109-1117 [Conf]
  19. Gábor Ivanyos, Frédéric Magniez, Miklos Santha
    Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:263-270 [Conf]
  20. Cristina Bazgan, Miklos Santha, Zsolt Tuza
    On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:276-286 [Conf]
  21. Christoph Dürr, Huong Lê Thanh, Miklos Santha
    A Decision Procedure for Well-Formed Linear Quantum Cellular Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:281-292 [Conf]
  22. Miklos Santha, Christopher B. Wilson
    Polynomial Size Constant Depth Circuits with a Limited Number of Negations. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:228-237 [Conf]
  23. Gábor Ivanyos, Luc Sanselme, Miklos Santha
    An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:586-597 [Conf]
  24. Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
    Self-testing of universal and fault-tolerant sets of quantum gates. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:688-696 [Conf]
  25. Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen
    Hidden translation and orbit coset in quantum computing. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:1-9 [Conf]
  26. Katalin Friedl, Gábor Ivanyos, Miklos Santha
    Efficient testing of groups. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:157-166 [Conf]
  27. Marcos A. Kiwi, Frédéric Magniez, Miklos Santha
    Approximate Testing with Relative Error. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:51-60 [Conf]
  28. Miklos Santha, Mario Szegedy
    Quantum and classical query complexities of local search are polynomially related. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:494-501 [Conf]
  29. Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha
    Average-Case Analysis of the Merging Algorithm of Hwang and Lin. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:4, pp:483-489 [Journal]
  30. Miklos Santha, Sovanna Tan
    Verifying the Determinant in Parallel. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:2, pp:128-151 [Journal]
  31. Christoph Dürr, Huong LeThanh, Miklos Santha
    A decision procedure for well-formed linear quantum cellular automata [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  32. Christoph Dürr, Miklos Santha
    A decision procedure for unitary linear quantum cellular automata [Citation Graph (0, 0)][DBLP]
    CoRR, 1996, v:0, n:, pp:- [Journal]
  33. Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
    Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  34. Marcos A. Kiwi, Frédéric Magniez, Miklos Santha
    Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:14, pp:- [Journal]
  35. José L. Balcázar, Joaquim Gabarró, Miklos Santha
    Deciding Bisimilarity is P-Complete. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1992, v:4, n:6A, pp:638-648 [Journal]
  36. Miklos Santha
    On Using Deterministic Functions to Reduce Randomness in Probabilistic Algorithms [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:74, n:3, pp:241-249 [Journal]
  37. Miklos Santha
    Relativized Arthur-Merlin versus Merlin-Arthur Games [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:80, n:1, pp:44-49 [Journal]
  38. Gábor Ivanyos, Frédéric Magniez, Miklos Santha
    Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:5, pp:723-740 [Journal]
  39. Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha
    A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:3, pp:432-440 [Journal]
  40. Cristina Bazgan, Miklos Santha, Zsolt Tuza
    On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:31, n:1, pp:249-268 [Journal]
  41. Cristina Bazgan, Miklos Santha, Zsolt Tuza
    Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:2, pp:160-170 [Journal]
  42. Marcos A. Kiwi, Frédéric Magniez, Miklos Santha
    Approximate testing with error relative to input size. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:2, pp:371-392 [Journal]
  43. Miklos Santha, Umesh V. Vazirani
    Generating Quasi-random Sequences from Semi-random Sources. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:33, n:1, pp:75-87 [Journal]
  44. Fabrice Noilhan, Miklos Santha
    Semantical Counting Circuits. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:3, pp:217-229 [Journal]
  45. Christoph Dürr, Huong LeThanh, Miklos Santha
    A decision procedure for well-formed linear quantum cellular automata. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:4, pp:381-394 [Journal]
  46. Miklos Santha
    On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:1, pp:75-88 [Journal]
  47. Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
    Quantum Algorithms for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:6, pp:1324-1330 [Journal]
  48. Christoph Dürr, Miklos Santha
    A Decision Procedure for Unitary Linear Quantum Cellular Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1076-1089 [Journal]
  49. Miklos Santha, Christopher B. Wilson
    Limiting Negations in Constant Depth Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:294-302 [Journal]
  50. Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
    Two Probabilistic Results on Merging. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:261-271 [Journal]
  51. Frédéric Magniez, Miklos Santha, Mario Szegedy
    Quantum Algorithms for the Triangle Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:413-424 [Journal]
  52. Gilles Brassard, Claude Crépeau, Miklos Santha
    Oblivious transfers and intersecting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1769-1780 [Journal]
  53. Frédéric Magniez, Ashwin Nayak, Jeremie Roland, Miklos Santha
    Search via quantum walk. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:575-584 [Conf]
  54. Miklos Santha, Umesh V. Vazirani
    Parallel searching of multidimensional cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:425-433 [Journal]
  55. Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
    Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:611-629 [Journal]

  56. Quantization of Random Walks: Search Algorithms and Hitting Time. [Citation Graph (, )][DBLP]


  57. An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. [Citation Graph (, )][DBLP]


  58. On the hitting times of quantum versus random walks. [Citation Graph (, )][DBLP]


  59. Quantum Walk Based Search Algorithms. [Citation Graph (, )][DBLP]


  60. Approximate Nash Equilibria for Multi-player Games. [Citation Graph (, )][DBLP]


  61. On the Power of a Unique Quantum Witness. [Citation Graph (, )][DBLP]


  62. Quantum and Classical Query Complexities of Local Search Are Polynomially Related. [Citation Graph (, )][DBLP]


  63. Quantum walk based search algorithms [Citation Graph (, )][DBLP]


  64. Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002