×

zbMATH — the first resource for mathematics

Santha, Miklos

Compute Distance To:
Author ID: santha.miklos Recent zbMATH articles by "Santha, Miklos"
Published as: Santha, M.; Santha, Miklos; Sántha, Miklós
Documents Indexed: 88 Publications since 1982, including 1 Book
all top 5

Co-Authors

7 single-authored
21 Ivanyos, Gábor
21 Magniez, Frédéric
9 Lee, Troy
8 Friedl, Katalin
7 Nayak, Ashwin
6 Qiao, Youming
5 Jain, Rahul
5 Sundaram, Aarthi
5 Zhang, Shengyu
4 Dürr, Christoph
4 Klauck, Hartmut
4 Kulkarni, Raghav
4 Sen, Pranab
4 Szegedy, Mario
3 Arad, Itai
3 Bazgan, Cristina
3 Belovs, Aleksandrs
3 Crépeau, Claude
3 Karpinski, Marek
3 Kiwi, Marcos A.
3 Kundu, Srijita
3 Sanselme, Luc
3 Sanyal, Swagato
3 Tuza, Zsolt
3 Verhoeven, Yves F.
2 Ambainis, Andris
2 Balodis, Kaspars
2 de Rougemont, Michel
2 de Wolf, Ronald Michiel
2 Decker, Thomas
2 Fernandez de la Vega, Wenceslas
2 Kerenidis, Iordanis
2 Mosca, Michele
2 Noilhan, Fabrice
2 Richter, Peter C.
2 Roland, Jérémie
2 Smotrovs, Juris
2 Tan, Sovanna
2 van Dam, Wim
2 Vazirani, Umesh V.
2 Vihrovs, Jevgēnijs
2 Wilson, Christopher W.
2 Xiao, David
1 Aggarwal, Divesh
1 Anshu, Anurag
1 Badouel, Eric
1 Balcázar, José Luis
1 Bampis, Evripidis
1 Boucheron, Stéphane Vincent
1 Bouland, Adam
1 Brassard, Gilles
1 Buhrman, Harry
1 Couveignes, Jean-Marc
1 Diaz-Frias, Juan Francisco
1 Dicky, Anne
1 Elhaddad, Mohamed
1 Frieze, Alan Michael
1 Gabarró, Joaquim
1 Gavinsky, Dmitry
1 Grier, Daniel
1 Heiligman, Mark
1 Hémon, Sébastien
1 Høyer, Peter
1 Joux, Antoine
1 Kannan, Sampath K.
1 Kothari, Robin
1 Kuperberg, Gregory John
1 LêThanh, Huong
1 Magniez, Frédéic
1 Manoussakis, Yannis G.
1 Mukhopadhyay, Priyanka
1 Petit, Antoine
1 Prakash, Anupam
1 Racicot-Desloges, David
1 Sattath, Or
1 Saxena, Nitin
1 Sherman, Jonah
1 Shparlinski, Igor E.
1 Tardos, Gábor
1 Thanh, Huong Lê
1 Weil, Pascal
1 Wocjan, Pawel
1 Yang, Siyi
1 Zeitoun, Marc
1 Zhang, Yanjun

Publications by Year

Citations contained in zbMATH Open

67 Publications have been cited 405 times in 295 Documents Cited by Year
Quantum algorithms for the triangle problem. Zbl 1166.68032
Magniez, Frédéric; Santha, Miklos; Szegedy, Mario
40
2007
Generating quasi-random sequences from semi-random sources. Zbl 0612.94004
Santha, Miklos; Vazirani, Umesh V.
35
1986
Search via quantum walk. Zbl 1223.05289
Magniez, Frédéric; Nayak, Ashwin; Roland, Jérémie; Santha, Miklos
31
2011
Quantum walk based search algorithms. Zbl 1139.68338
Santha, Miklos
31
2008
Quantum algorithms for element distinctness. Zbl 1081.68029
Buhrman, Harry; Dürr, Christoph; Heiligman, Mark; Høyer, Peter; Magniez, Frédéric; Santha, Miklos; de Wolf, Ronald
19
2005
Deciding bisimilarity is P-complete. Zbl 0758.68033
Balcázar, José; Gabarró, Joaquim; Sántha, Miklós
18
1992
On the hitting times of quantum versus random walks. Zbl 1236.68072
Magniez, Frédéric; Nayak, Ashwin; Richter, Peter C.; Santha, Miklos
16
2012
Search via quantum walk. Zbl 1232.68053
Magniez, Frederic; Nayak, Ashwin; Roland, Jeremie; Santha, Miklos
16
2007
Oblivious transfers and intersecting codes. Zbl 0873.94015
Brassard, Gilles; Crépeau, Claude; Sántha, Miklós
15
1996
Separations in query complexity based on pointer functions. Zbl 1373.68249
Ambainis, Andris; Balodis, Kaspars; Belovs, Aleksandrs; Lee, Troy; Santha, Miklos; Smotrovs, Juris
11
2016
Quantum algorithms for the triangle problem. Zbl 1297.68078
Magniez, Frédéric; Santha, Miklos; Szegedy, Mario
9
2005
Hidden translation and orbit coset in quantum computing. Zbl 1192.81066
Friedl, Katalin; Ivanyos, Gábor; Magniez, Frédéric; Santha, Miklos; Sen, Pranab
9
2003
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. Zbl 1101.68582
Ivanyos, Gábor; Magniez, Frédéric; Santha, Miklos
9
2003
On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs. Zbl 0919.05039
Bazgan, Cristina; Santha, Miklos; Tuza, Zsolt
9
1999
Improved quantum query algorithms for triangle detection and associativity testing. Zbl 1359.68091
Lee, Troy; Magniez, Frédéric; Santha, Miklos
8
2017
Relativized Arthur-Merlin versus Merlin-Arthur games. Zbl 0667.03031
Santha, Miklos
8
1989
Generalized Wong sequences and their applications to Edmonds’ problems. Zbl 1320.68222
Ivanyos, Gábor; Karpinski, Marek; Qiao, Youming; Santha, Miklos
7
2015
On using deterministic functions to reduce randomness in probabilistic algorithms. Zbl 0629.68047
Santha, Miklos
7
1987
On the black-box complexity of Sperner’s lemma. Zbl 1123.68049
Friedl, Katalin; Ivanyos, Gábor; Santha, Miklos; Verhoeven, Yves F.
6
2005
Limiting negations in constant depth circuits. Zbl 0770.68057
Santha, Miklos; Wilson, Christopher
6
1993
Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes. Zbl 1183.68306
Friedl, Katalin; Ivanyos, Gábor; Santha, Miklos; Verhoeven, Yves F.
5
2006
Exact and approximate testing/correcting of algebraic functions: A survey. Zbl 1054.68032
Kiwi, Marcos; Magniez, Frédéric; Santha, Miklos
5
2002
Separations in query complexity based on pointer functions. Zbl 1426.68109
Ambainis, Andris; Balodis, Kaspars; Belovs, Aleksandrs; Lee, Troy; Santha, Miklos; Smotrovs, Juris
4
2017
Optimal direct sum results for deterministic and randomized decision tree complexity. Zbl 1234.68119
Jain, Rahul; Klauck, Hartmut; Santha, Miklos
4
2010
Approximate Nash equilibria for multi-player games. Zbl 1136.91325
Hémon, Sébastien; de Rougemont, Michel; Santha, Miklos
4
2008
Quantum and classical query complexities of local search are polynomially related. Zbl 1192.68266
Santha, Miklos; Szegedy, Mario
4
2004
Verifying the determinant in parallel. Zbl 0912.68053
Santha, Miklos; Tan, Sovanna
4
1998
Polynomial size constant depth circuits with a limited number of negations. Zbl 0764.94025
Santha, Miklos; Wilson, Christopher
4
1991
Hidden translation and translating coset in quantum computing. Zbl 1359.68088
Friedl, Katalin; Ivanyos, Gábor; Magniez, Frédéric; Santha, Miklos; Sen, Pranab
3
2014
Learning graph based quantum query algorithms for finding constant-size subgraphs. Zbl 1286.68155
Lee, Troy; Magniez, Frédéric; Santha, Miklos
3
2012
A decision procedure for unitary linear quantum cellular automata. Zbl 0997.81021
Dürr, Christoph; Santha, Miklos
3
2002
A new public-key cryptosystem via Mersenne numbers. Zbl 1454.94038
Aggarwal, Divesh; Joux, Antoine; Prakash, Anupam; Santha, Miklos
2
2018
Polynomial interpolation and identity testing from high powers over finite fields. Zbl 1390.11128
Ivanyos, Gábor; Karpinski, Marek; Santha, Miklos; Saxena, Nitin; Shparlinski, Igor E.
2
2018
On the polynomial parity argument complexity of the combinatorial Nullstellensatz. Zbl 1440.68101
Belovs, Aleksandrs; Ivanyos, Gábor; Qiao, Youming; Santha, Miklos; Yang, Siyi
2
2017
Linear time algorithm for quantum 2SAT. Zbl 1388.68064
Arad, Itai; Santha, Miklos; Sundaram, Aarthi; Zhang, Shengyu
2
2016
Improved bounds for the randomized decision tree complexity of recursive majority. Zbl 1338.05250
Magniez, Frédéric; Nayak, Ashwin; Santha, Miklos; Sherman, Jonah; Tardos, Gábor; Xiao, David
2
2016
Separating decision tree complexity from subcube partition complexity. Zbl 1375.68061
Kothari, Robin; Racicot-Desloges, David; Santha, Miklos
2
2015
Generalized Wong sequences and their applications to Edmonds’ problems. Zbl 1359.68328
Ivanyos, Gábor; Karpinski, Marek; Qiao, Youming; Santha, Miklos
2
2014
On the complexity of trial and error for constraint satisfaction problems. Zbl 1382.68113
Ivanyos, Gábor; Kulkarni, Raghav; Qiao, Youming; Santha, Miklos; Sundaram, Aarthi
2
2014
Hidden symmetry subgroup problems. Zbl 1286.68151
Decker, Thomas; Ivanyos, Gábor; Santha, Miklos; Wocjan, Pawel
2
2013
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups. Zbl 1236.68071
Ivanyos, Gábor; Sanselme, Luc; Santha, Miklos
2
2012
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups. Zbl 1136.68626
Ivanyos, Gábor; Sanselme, Luc; Santha, Miklos
2
2008
Efficient testing of groups. Zbl 1192.68858
Friedl, Katalin; Ivanyos, Gábor; Santha, Miklos
2
2005
A decision procedure for well-formed linear quantum cellular automata. Zbl 1379.68121
Dürr, Christoph; Thanh, Huong Lê; Santha, Miklos
2
1996
Two probabilistic results on merging. Zbl 0770.68067
Fernandez de la Vega, Wenceslas; Kannan, Sampath; Santha, Miklos
2
1993
On the reversibility of oblivious transfer. Zbl 0791.68045
Crépeau, Claude; Sántha, Miklós
2
1991
Consecutive-2 systems on trees. Zbl 1134.90392
Santha, Miklos; Zhang, Yanjun
2
1987
Linear-time algorithm for quantum 2SAT. Zbl 1395.68132
Arad, Itai; Santha, Miklos; Sundaram, Aarthi; Zhang, Shengyu
1
2018
Solving systems of diagonal polynomial equations over finite fields. Zbl 1356.68281
Ivanyos, Gábor; Santha, Miklos
1
2017
On solving systems of diagonal polynomial equations over finite fields. Zbl 1356.68280
Ivanyos, Gábor; Santha, Miklos
1
2015
Improved quantum query algorithms for triangle finding and associativity testing. Zbl 1422.68078
Lee, Troy; Magniez, Frédéric; Santha, Miklos
1
2013
Query complexity of matroids. Zbl 1382.68094
Kulkarni, Raghav; Santha, Miklos
1
2013
New bounds on the classical and quantum communication complexity of some graph properties. Zbl 1354.68086
Ivanyos, Gábor; Klauck, Hartmut; Lee, Troy; Santha, Miklos; de Wolf, Ronald
1
2012
Improved bounds for the randomized decision tree complexity of recursive majority. Zbl 1332.68085
Magniez, Frédéric; Nayak, Ashwin; Santha, Miklos; Xiao, David
1
2011
On the hitting times of quantum versus random walks. Zbl 1422.68080
Magniez, Frédéric; Nayak, Ashwin; Richter, Peter C.; Santha, Miklos
1
2009
On the black-box complexity of Sperner’s Lemma. Zbl 1187.68233
Friedl, Katalin; Ivanyos, Gábor; Santha, Miklos; Verhoeven, Yves F.
1
2009
Quantum and classical query complexities of local search are polynomially related. Zbl 1191.68310
Santha, Miklos; Szegedy, Mario
1
2009
An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups. Zbl 1186.20015
Ivanyos, Gábor; Sanselme, Luc; Santha, Miklos
1
2007
Quantum testers for hidden group properties. Zbl 1124.68362
Friedl, Katalin; Magniez, Frédéric; Santha, Miklos; Sen, Pranab
1
2003
Efficient approximation algorithms for the subset-sums equality problem. Zbl 1078.90037
Bazgan, Cristina; Santha, Miklos; Tuza, Zsolt
1
2002
Semantical counting circuits. Zbl 0961.68055
Noilhan, Fabrice; Santha, Miklos
1
2000
Average-case analysis of the merging algorithm of Hwang and Lin. Zbl 0914.68083
Fernandez de la Vega, W.; Frieze, A. M.; Santha, M.
1
1998
Efficient approximation algorithms for the SUBSET-SUMS EQUALITY problem. Zbl 0914.90223
Bazgan, Cristina; Santha, Miklos; Tuza, Zsolt
1
1998
A decision procedure for well-formed linear quantum cellular automata. Zbl 0888.68087
Dürr, Christoph; LêThanh, Huong; Santha, Miklos
1
1997
A parallel reduction of Hamiltonian cycle to Hamiltonian path in tournaments. Zbl 0836.68051
Bampis, E.; El Haddad, M.; Manoussakis, Y.; Santha, M.
1
1995
Efficient reduction among oblivious transfer protocols based on new self- intersecting codes. Zbl 0837.94017
Crépeau, Claude; Sántha, Miklós
1
1993
Relativized Arthur-Merlin versus Merlin-Arthur games. Zbl 0644.68053
Santha, Miklos
1
1987
A new public-key cryptosystem via Mersenne numbers. Zbl 1454.94038
Aggarwal, Divesh; Joux, Antoine; Prakash, Anupam; Santha, Miklos
2
2018
Polynomial interpolation and identity testing from high powers over finite fields. Zbl 1390.11128
Ivanyos, Gábor; Karpinski, Marek; Santha, Miklos; Saxena, Nitin; Shparlinski, Igor E.
2
2018
Linear-time algorithm for quantum 2SAT. Zbl 1395.68132
Arad, Itai; Santha, Miklos; Sundaram, Aarthi; Zhang, Shengyu
1
2018
Improved quantum query algorithms for triangle detection and associativity testing. Zbl 1359.68091
Lee, Troy; Magniez, Frédéric; Santha, Miklos
8
2017
Separations in query complexity based on pointer functions. Zbl 1426.68109
Ambainis, Andris; Balodis, Kaspars; Belovs, Aleksandrs; Lee, Troy; Santha, Miklos; Smotrovs, Juris
4
2017
On the polynomial parity argument complexity of the combinatorial Nullstellensatz. Zbl 1440.68101
Belovs, Aleksandrs; Ivanyos, Gábor; Qiao, Youming; Santha, Miklos; Yang, Siyi
2
2017
Solving systems of diagonal polynomial equations over finite fields. Zbl 1356.68281
Ivanyos, Gábor; Santha, Miklos
1
2017
Separations in query complexity based on pointer functions. Zbl 1373.68249
Ambainis, Andris; Balodis, Kaspars; Belovs, Aleksandrs; Lee, Troy; Santha, Miklos; Smotrovs, Juris
11
2016
Linear time algorithm for quantum 2SAT. Zbl 1388.68064
Arad, Itai; Santha, Miklos; Sundaram, Aarthi; Zhang, Shengyu
2
2016
Improved bounds for the randomized decision tree complexity of recursive majority. Zbl 1338.05250
Magniez, Frédéric; Nayak, Ashwin; Santha, Miklos; Sherman, Jonah; Tardos, Gábor; Xiao, David
2
2016
Generalized Wong sequences and their applications to Edmonds’ problems. Zbl 1320.68222
Ivanyos, Gábor; Karpinski, Marek; Qiao, Youming; Santha, Miklos
7
2015
Separating decision tree complexity from subcube partition complexity. Zbl 1375.68061
Kothari, Robin; Racicot-Desloges, David; Santha, Miklos
2
2015
On solving systems of diagonal polynomial equations over finite fields. Zbl 1356.68280
Ivanyos, Gábor; Santha, Miklos
1
2015
Hidden translation and translating coset in quantum computing. Zbl 1359.68088
Friedl, Katalin; Ivanyos, Gábor; Magniez, Frédéric; Santha, Miklos; Sen, Pranab
3
2014
Generalized Wong sequences and their applications to Edmonds’ problems. Zbl 1359.68328
Ivanyos, Gábor; Karpinski, Marek; Qiao, Youming; Santha, Miklos
2
2014
On the complexity of trial and error for constraint satisfaction problems. Zbl 1382.68113
Ivanyos, Gábor; Kulkarni, Raghav; Qiao, Youming; Santha, Miklos; Sundaram, Aarthi
2
2014
Hidden symmetry subgroup problems. Zbl 1286.68151
Decker, Thomas; Ivanyos, Gábor; Santha, Miklos; Wocjan, Pawel
2
2013
Improved quantum query algorithms for triangle finding and associativity testing. Zbl 1422.68078
Lee, Troy; Magniez, Frédéric; Santha, Miklos
1
2013
Query complexity of matroids. Zbl 1382.68094
Kulkarni, Raghav; Santha, Miklos
1
2013
On the hitting times of quantum versus random walks. Zbl 1236.68072
Magniez, Frédéric; Nayak, Ashwin; Richter, Peter C.; Santha, Miklos
16
2012
Learning graph based quantum query algorithms for finding constant-size subgraphs. Zbl 1286.68155
Lee, Troy; Magniez, Frédéric; Santha, Miklos
3
2012
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups. Zbl 1236.68071
Ivanyos, Gábor; Sanselme, Luc; Santha, Miklos
2
2012
New bounds on the classical and quantum communication complexity of some graph properties. Zbl 1354.68086
Ivanyos, Gábor; Klauck, Hartmut; Lee, Troy; Santha, Miklos; de Wolf, Ronald
1
2012
Search via quantum walk. Zbl 1223.05289
Magniez, Frédéric; Nayak, Ashwin; Roland, Jérémie; Santha, Miklos
31
2011
Improved bounds for the randomized decision tree complexity of recursive majority. Zbl 1332.68085
Magniez, Frédéric; Nayak, Ashwin; Santha, Miklos; Xiao, David
1
2011
Optimal direct sum results for deterministic and randomized decision tree complexity. Zbl 1234.68119
Jain, Rahul; Klauck, Hartmut; Santha, Miklos
4
2010
On the hitting times of quantum versus random walks. Zbl 1422.68080
Magniez, Frédéric; Nayak, Ashwin; Richter, Peter C.; Santha, Miklos
1
2009
On the black-box complexity of Sperner’s Lemma. Zbl 1187.68233
Friedl, Katalin; Ivanyos, Gábor; Santha, Miklos; Verhoeven, Yves F.
1
2009
Quantum and classical query complexities of local search are polynomially related. Zbl 1191.68310
Santha, Miklos; Szegedy, Mario
1
2009
Quantum walk based search algorithms. Zbl 1139.68338
Santha, Miklos
31
2008
Approximate Nash equilibria for multi-player games. Zbl 1136.91325
Hémon, Sébastien; de Rougemont, Michel; Santha, Miklos
4
2008
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups. Zbl 1136.68626
Ivanyos, Gábor; Sanselme, Luc; Santha, Miklos
2
2008
Quantum algorithms for the triangle problem. Zbl 1166.68032
Magniez, Frédéric; Santha, Miklos; Szegedy, Mario
40
2007
Search via quantum walk. Zbl 1232.68053
Magniez, Frederic; Nayak, Ashwin; Roland, Jeremie; Santha, Miklos
16
2007
An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups. Zbl 1186.20015
Ivanyos, Gábor; Sanselme, Luc; Santha, Miklos
1
2007
Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes. Zbl 1183.68306
Friedl, Katalin; Ivanyos, Gábor; Santha, Miklos; Verhoeven, Yves F.
5
2006
Quantum algorithms for element distinctness. Zbl 1081.68029
Buhrman, Harry; Dürr, Christoph; Heiligman, Mark; Høyer, Peter; Magniez, Frédéric; Santha, Miklos; de Wolf, Ronald
19
2005
Quantum algorithms for the triangle problem. Zbl 1297.68078
Magniez, Frédéric; Santha, Miklos; Szegedy, Mario
9
2005
On the black-box complexity of Sperner’s lemma. Zbl 1123.68049
Friedl, Katalin; Ivanyos, Gábor; Santha, Miklos; Verhoeven, Yves F.
6
2005
Efficient testing of groups. Zbl 1192.68858
Friedl, Katalin; Ivanyos, Gábor; Santha, Miklos
2
2005
Quantum and classical query complexities of local search are polynomially related. Zbl 1192.68266
Santha, Miklos; Szegedy, Mario
4
2004
Hidden translation and orbit coset in quantum computing. Zbl 1192.81066
Friedl, Katalin; Ivanyos, Gábor; Magniez, Frédéric; Santha, Miklos; Sen, Pranab
9
2003
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. Zbl 1101.68582
Ivanyos, Gábor; Magniez, Frédéric; Santha, Miklos
9
2003
Quantum testers for hidden group properties. Zbl 1124.68362
Friedl, Katalin; Magniez, Frédéric; Santha, Miklos; Sen, Pranab
1
2003
Exact and approximate testing/correcting of algebraic functions: A survey. Zbl 1054.68032
Kiwi, Marcos; Magniez, Frédéric; Santha, Miklos
5
2002
A decision procedure for unitary linear quantum cellular automata. Zbl 0997.81021
Dürr, Christoph; Santha, Miklos
3
2002
Efficient approximation algorithms for the subset-sums equality problem. Zbl 1078.90037
Bazgan, Cristina; Santha, Miklos; Tuza, Zsolt
1
2002
Semantical counting circuits. Zbl 0961.68055
Noilhan, Fabrice; Santha, Miklos
1
2000
On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs. Zbl 0919.05039
Bazgan, Cristina; Santha, Miklos; Tuza, Zsolt
9
1999
Verifying the determinant in parallel. Zbl 0912.68053
Santha, Miklos; Tan, Sovanna
4
1998
Average-case analysis of the merging algorithm of Hwang and Lin. Zbl 0914.68083
Fernandez de la Vega, W.; Frieze, A. M.; Santha, M.
1
1998
Efficient approximation algorithms for the SUBSET-SUMS EQUALITY problem. Zbl 0914.90223
Bazgan, Cristina; Santha, Miklos; Tuza, Zsolt
1
1998
A decision procedure for well-formed linear quantum cellular automata. Zbl 0888.68087
Dürr, Christoph; LêThanh, Huong; Santha, Miklos
1
1997
Oblivious transfers and intersecting codes. Zbl 0873.94015
Brassard, Gilles; Crépeau, Claude; Sántha, Miklós
15
1996
A decision procedure for well-formed linear quantum cellular automata. Zbl 1379.68121
Dürr, Christoph; Thanh, Huong Lê; Santha, Miklos
2
1996
A parallel reduction of Hamiltonian cycle to Hamiltonian path in tournaments. Zbl 0836.68051
Bampis, E.; El Haddad, M.; Manoussakis, Y.; Santha, M.
1
1995
Limiting negations in constant depth circuits. Zbl 0770.68057
Santha, Miklos; Wilson, Christopher
6
1993
Two probabilistic results on merging. Zbl 0770.68067
Fernandez de la Vega, Wenceslas; Kannan, Sampath; Santha, Miklos
2
1993
Efficient reduction among oblivious transfer protocols based on new self- intersecting codes. Zbl 0837.94017
Crépeau, Claude; Sántha, Miklós
1
1993
Deciding bisimilarity is P-complete. Zbl 0758.68033
Balcázar, José; Gabarró, Joaquim; Sántha, Miklós
18
1992
Polynomial size constant depth circuits with a limited number of negations. Zbl 0764.94025
Santha, Miklos; Wilson, Christopher
4
1991
On the reversibility of oblivious transfer. Zbl 0791.68045
Crépeau, Claude; Sántha, Miklós
2
1991
Relativized Arthur-Merlin versus Merlin-Arthur games. Zbl 0667.03031
Santha, Miklos
8
1989
On using deterministic functions to reduce randomness in probabilistic algorithms. Zbl 0629.68047
Santha, Miklos
7
1987
Consecutive-2 systems on trees. Zbl 1134.90392
Santha, Miklos; Zhang, Yanjun
2
1987
Relativized Arthur-Merlin versus Merlin-Arthur games. Zbl 0644.68053
Santha, Miklos
1
1987
Generating quasi-random sequences from semi-random sources. Zbl 0612.94004
Santha, Miklos; Vazirani, Umesh V.
35
1986
all top 5

Cited by 555 Authors

10 Santha, Miklos
9 Ivanyos, Gábor
8 Joye, Alain
8 Le Gall, François
7 Ambainis, Andris
7 Magniez, Frédéric
6 Qiao, Youming
6 Santos, Raqueline Azevedo Medeiros
5 Shaltiel, Ronen
4 D’Ariano, Giacomo Mauro
4 Göös, Mika
4 Perinotti, Paolo
4 Pitassi, Toniann
4 Portugal, Renato
4 Shparlinski, Igor E.
4 Thierauf, Thomas
3 Arvind, Vikraman
3 Brassard, Gilles
3 Chen, Xi
3 Childs, Andrew M.
3 Crépeau, Claude
3 Debbasch, Fabrice
3 Deng, Xiao-Tie
3 Di Molfetta, Giuseppe
3 Dörn, Sebastian
3 Høyer, Peter
3 Li, Dan
3 Linial, Nathan
3 Mateus, Paulo C.
3 Miszczak, Jaroslaw Adam
3 Nahimovs, Nikolajs
3 Paunković, Nikola
3 Qiu, Daowen
3 Segawa, Etsuo
3 Shi, Weimin
3 Souto, André
3 Srba, Jiří
3 Subrahmanyam, K. Venkata
3 Sun, Xiaoming
3 Suzuki, Akito
3 Tani, Seiichiro
3 Tosini, Alessandro
3 Tuza, Zsolt
3 Wigderson, Avi
3 Wong, Thomas G.
3 Yang, Yuguang
3 Zhou, Yihua
3 Zuckerman, David
2 Allender, Eric W.
2 Arunachalam, Srinivasan
2 Babai, László
2 Bausch, Johannes
2 Beigi, Salman
2 Belovs, Aleksandrs
2 Beneš, Nikola
2 Bisio, Alessandro
2 Briegel, Hans J.
2 Briët, Jop
2 Cai, Guangya
2 Cohen, Gérard Denis
2 de Wolf, Ronald Michiel
2 Deligkas, Argyrios
2 Dunjko, Vedran
2 Etesami, Omid
2 Everitt, Matthew
2 Fearnley, John
2 Fortnow, Lance J.
2 Fuda, Toru
2 Funakawa, Daiju
2 Gabizon, Ariel
2 Gohari, Amin Aminzadeh
2 Göller, Stefan
2 Hamza, Eman
2 Hoang, Thanh Minh
2 Hwang, Frank Kwangming
2 Ishai, Yuval
2 Iwama, Kazuo
2 Jančar, Petr
2 Jeffery, Stacey
2 Kaplan, Marc A.
2 Karlin, Anna R.
2 Karpinski, Marek
2 Köbler, Johannes
2 Křetínský, Jan
2 Kurur, Piyush P.
2 Kushilevitz, Eyal
2 Laplante, Sophie
2 Larsen, Kim Guldstrand
2 Lohrey, Markus
2 Love, Peter J.
2 Lovett, Neil B.
2 Mahmoody, Mohammad
2 Mérai, László
2 Merkli, Marco
2 Mesnager, Sihem
2 Montanaro, Ashley
2 Mosco, Nicola
2 Nakajima, Shogo
2 Nayak, Ashwin
2 Nisan, Noam
...and 455 more Authors
all top 5

Cited in 80 Serials

24 Journal of Computer and System Sciences
24 Theoretical Computer Science
22 Algorithmica
21 Quantum Information Processing
16 Information Processing Letters
9 SIAM Journal on Computing
9 Computational Complexity
7 Information and Computation
6 Combinatorica
5 Theory of Computing Systems
4 Communications in Mathematical Physics
4 International Journal of Theoretical Physics
4 Journal of Mathematical Physics
4 Random Structures & Algorithms
4 New Journal of Physics
4 Journal of Physics A: Mathematical and Theoretical
4 Quantum Studies: Mathematics and Foundations
3 Discrete Applied Mathematics
3 Discrete Mathematics
3 Journal of Statistical Physics
3 Physica A
3 Physics Letters. A
3 Journal of Cryptology
3 International Journal of Foundations of Computer Science
3 Annales Henri Poincaré
2 Acta Informatica
2 Letters in Mathematical Physics
2 Journal of Complexity
2 Designs, Codes and Cryptography
2 Distributed Computing
2 RAIRO. Informatique Théorique et Applications
2 Journal of Combinatorial Designs
2 Annals of Mathematics. Second Series
2 International Journal of Quantum Information
2 Journal of Mathematical Cryptology
1 Moscow University Mathematics Bulletin
1 Reviews of Modern Physics
1 Bulletin of the Polish Academy of Sciences. Technical Sciences
1 Advances in Mathematics
1 Journal of Algebra
1 Journal of Combinatorial Theory. Series B
1 Journal of Computational and Applied Mathematics
1 Mathematics of Operations Research
1 Naval Research Logistics
1 Synthese
1 Annals of Pure and Applied Logic
1 Statistical Science
1 International Journal of Approximate Reasoning
1 Computational Mathematics and Modeling
1 Machine Learning
1 Differential Geometry and its Applications
1 MSCS. Mathematical Structures in Computer Science
1 Communications in Statistics. Simulation and Computation
1 Linear Algebra and its Applications
1 Mathematical Programming. Series A. Series B
1 Applicable Algebra in Engineering, Communication and Computing
1 Annals of Mathematics and Artificial Intelligence
1 Mathematical Problems in Engineering
1 Journal of Combinatorial Optimization
1 Chicago Journal of Theoretical Computer Science
1 LMS Journal of Computation and Mathematics
1 Journal of High Energy Physics
1 Lobachevskii Journal of Mathematics
1 Journal of Modern Optics
1 Foundations of Computational Mathematics
1 Journal of Systems Science and Complexity
1 Natural Computing
1 Internet Mathematics
1 Foundations of Physics
1 International Journal of Number Theory
1 Mathematics and Financial Economics
1 Groups, Geometry, and Dynamics
1 Advances in Mathematics of Communications
1 Logical Methods in Computer Science
1 Communications in Theoretical Physics
1 Groups, Complexity, Cryptology
1 Control Theory and Technology
1 Pacific Journal of Mathematics for Industry
1 Proceedings of the Royal Society of London. A. Mathematical, Physical and Engineering Sciences
1 Philosophical Transactions of the Royal Society of London. A. Mathematical, Physical and Engineering Sciences

Citations by Year