Miklós Sántha
- Artificial Intelligence top 1%
- Computational Theory and Mathematics top 0.5%
- Atomic and Molecular Physics, and Optics top 10%
- Information Systems top 10%
- Computer Networks and Communications top 10%
- Co-authors
- Frédéric MagniezUmesh VaziraniMárió SzegedyAshwin NayakJérémie RolandGábor IvanyosTroy LeeDivesh Aggarwal
- Topics
- Quantum Computing Algorithms and Architecture (37 papers)Complexity and Algorithms in Graphs (25 papers)Machine Learning and Algorithms (16 papers)
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceAtomic and Molecular Physics, and Optics
- Journals
- Physical Review LettersSHILAP Revista de lepidopterologíaIEEE Transactions on Information Theory
In The Last Decade
Miklós Sántha
64 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 63
- Artificial Intelligence 1.0k
- Computational Theory and Mathematics 665
- Atomic and Molecular Physics, and Optics 237
- Information Systems 103
- Computer Networks and Communications 92
Countries citing papers authored by Miklós Sántha
This map shows the geographic impact of Miklós Sántha's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Miklós Sántha with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Miklós Sántha more than expected).
Fields of papers citing papers by Miklós Sántha
This network shows the impact of papers produced by Miklós Sántha. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Miklós Sántha. The network helps show where Miklós Sántha may publish in the future.
Co-authorship network of co-authors of Miklós Sántha
This figure shows the co-authorship network connecting the top 25 collaborators of Miklós Sántha. A scholar is included among the top collaborators of Miklós Sántha based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Miklós Sántha. Miklós Sántha is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 5 | |
| 2 | 6 | |
| 3 | 0 | |
| 4 | 1 | |
| 5 | 3 | |
| 6 | 1 | |
| 7 | 42 | |
| 8 | 8 | |
| 9 | 5 | |
| 10 | Query complexity of matroids. | 2 |
| 11 | 12 | |
| 12 | On the hitting times of quantum versus random walks | 42 |
| 13 | 41 | |
| 14 | 20 | |
| 15 | An $O(n^{1.3})$ Quantum Algorithm for the Triangle Problem | 9 |
| 16 | 3 | |
| 17 | 6 | |
| 18 | 25 | |
| 19 | 143 | |
| 20 | Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) | 4 |
About Miklós Sántha
Miklós Sántha is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics, having authored 68 papers that have together received 1.2k indexed citations. Recurring topics across this work include Quantum Computing Algorithms and Architecture (37 papers), Complexity and Algorithms in Graphs (25 papers) and Machine Learning and Algorithms (16 papers). The work is most often cited by research in Computational Theory and Mathematics (665 citations), Artificial Intelligence (1.0k citations) and Atomic and Molecular Physics, and Optics (237 citations). Miklós Sántha has collaborated with scholars based in France, Singapore and Hungary. Frequent co-authors include Frédéric Magniez, Umesh Vazirani, Márió Szegedy, Ashwin Nayak, Jérémie Roland, Gábor Ivanyos, Troy Lee, Divesh Aggarwal, Marco Tomamichel and Gavin K. Brennen. Their work appears in journals such as Physical Review Letters, SHILAP Revista de lepidopterología and IEEE Transactions on Information Theory.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.