MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Miklos Santha" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

30 documents found, showing 1 through 10. Next 10 →

ATOM

On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae
by Miklos Santha — 1991 — In 6th Annual Conference on Structure in Complexity Theory
…On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae Miklos Santha CNRS…
Cited by 5 (0 self) – Add To MetaCart

Quantum walk based search algorithms
by Miklos Santha — 2008 — In Proceedings of the 5th Conference on Theory and Applications of Models of Computation
…Quantum walk based search algorithms ⋆ Miklos Santha 1,2 1 CNRS–LRI, Université Paris–Sud, 91405…
Cited by 1 (1 self) – Add To MetaCart

Semantical Counting Circuits
by Fabrice Noilhan, Miklos Santha — 1998
…Semantical Counting Circuits ? Fabrice Noilhan 1 and Miklos Santha 2 1 Universit'e Paris…
Cited by 1 (0 self) – Add To MetaCart

On the Reversibility of Oblivious Transfer
by Claude Crépeau, Miklos Santha
…On the Reversibility of Oblivious Transfer Claude Cr'epeau y Mikl'os S'antha z Laboratoire de…
Cited by 30 (8 self) – Add To MetaCart

Verifying The Determinant In Parallel
by Miklos Santha, Sovanna Tan — 1998 — Computational Complexity
…VERIFYING THE DETERMINANT IN PARALLEL Miklos Santha and Sovanna Tan Abstract. In this paper we…
Cited by 4 (1 self) – Add To MetaCart

Efficient Reduction among Oblivious Transfer Protocols based on New Self-Intersecting Codes
by Claude Crépeau, Miklós Sántha
… Cr'epeau Mikl'os S'antha y Laboratoire de Recherche en Informatique Universit'e Paris…
Cited by 6 (5 self) – Add To MetaCart

Quantum and classical query complexities of local search are polynomially related
by Miklos Santha, Mario Szegedy — 2004 — In Proc. of 36th STOC
…Quantum and Classical Query Complexities of Local Search are Polynomially Related Miklos Santha…
Cited by 12 (2 self) – Add To MetaCart

A Decision Procedure For Unitary Linear Quantum Cellular Automata
by Christoph Dürr, Miklos Santha — 1999 — Proceedings of the 37th IEEE Symposium on Foundations of Computer Science
… automata Christoph Durr y Miklos Santha z Abstract Linear quantum cellular automata were introduced…
Cited by 7 (1 self) – Add To MetaCart

Self-testing of universal and fault-tolerant sets of quantum gates
by Wim Dam, Frédéric Magniez, Michele Mosca, Miklos Santha — 2000 — Proc. 32nd ACM STOC
… † Michele Mosca ‡ Miklos Santha § Abstract We consider the design of self-testers for quantum gates. A self…
Cited by 4 (3 self) – Add To MetaCart

Quantum testers for hidden group properties
by Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen — 2003 — In Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science
… Santha 2 , and Pranab Sen 2 1 CAI, Hungarian Academy of Sciences, H-1111 Budapest, Hungary, 2 CNRS…
Cited by 4 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB