Miklós Sántha - Concepedia

Author

Miklós Sántha

Centre National de la Recherche Scientifique

Also Known As

Lee, Troy, M. Santha, MIKLOS SANTHA, Miklos Santha, Miklós Sántha, Santha, M, Santha, M., Santha, Miklos

178

Publications

3.5K

Citations

H-Index

Concepts

All Affiliations

Centre National de la Recherche Scientifique Université Paris-Sud Laboratoire de Recherche en Informatique National University of Singapore Université Paris Cité

About

Miklós Sántha is an author at Centre National de la Recherche Scientifique specializing in engineering, computational complexity, and computer science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	19	34	1.9K
2	Business	2	2	95
3	Natural Sciences	2	2	31
4	Computer Engineering	2	2	126
5	Arts	1	1	26

Miklós Sántha

Publications

2.7K

Citations

H-Index

Page 1

	Year	Citations
Quantum Algorithms for the Triangle Problem Frédéric Magniez, Miklós Sántha, Márió Szegedy SIAM Journal on Computing EngineeringComputational ComplexityQuantum EngineeringQuantum ComputingTriangle Problem	2007	319
Search via Quantum Walk Frédéric Magniez, Ashwin Nayak, Jérémie Roland, SIAM Journal on Computing	2011	288
Generating quasi-random sequences from semi-random sources Miklós Sántha, Umesh Vazirani Journal of Computer and System Sciences EngineeringEntropyPseudo-random SequenceProbability TheoryComputer Science	1986	257
Quantum Attacks on Bitcoin, and How to Protect Against Them Divesh Aggarwal, Gavin K. Brennen, Troy Lee, Ledger	2018	198
Hidden translation and orbit coset in quantum computing Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Quantum ScienceOrbit CosetEngineeringQuantum ComputingHidden Translation	2003	143
Search via quantum walk Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Quantum ScienceEngineeringQuantum ComputingQuantum Optimization AlgorithmQuantum Algorithm	2007	128
Generating Quasi-Random Sequences From Slightly-Random Sources Miklós Sántha, Umesh Vazirani Hardware SecurityEngineeringRandom Bit SequencesEntropyPseudo-random Sequence	2005	98
Oblivious transfers and intersecting codes Gilles Brassard, Claude Crépeau, Miklós Sántha IEEE Transactions on Information Theory Oblivious TransfersCryptographic PrimitiveEngineeringInformation Security-Ot/sub 2/	1996	97
Deciding bisimilarity is <i>P</i> -complete José L. Balcázar, Joaquim Gabarró, Miklós Sántha Formal Aspects of Computing Computational Complexity TheoryEngineeringReachability ProblemVerificationObservation Congruence	1992	93
Quantum algorithms for element distinctness Harry Buhrman, Christoph Dürr, Mark Heiligman, Quantum Amplitude AmplificationQuantum ScienceComputational Complexity TheoryEngineeringQuantum Computing	2002	92

Page 1