Dieter van Melkebeek

1.1k total citations
47 papers, 451 citations indexed

About

Dieter van Melkebeek is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Dieter van Melkebeek has authored 47 papers receiving a total of 451 indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computational Theory and Mathematics, 33 papers in Artificial Intelligence and 6 papers in Computer Networks and Communications. Recurrent topics in Dieter van Melkebeek's work include Complexity and Algorithms in Graphs (32 papers), Computability, Logic, AI Algorithms (14 papers) and Cryptography and Data Security (12 papers). Dieter van Melkebeek is often cited by papers focused on Complexity and Algorithms in Graphs (32 papers), Computability, Logic, AI Algorithms (14 papers) and Cryptography and Data Security (12 papers). Dieter van Melkebeek collaborates with scholars based in United States, Netherlands and Canada. Dieter van Melkebeek's co-authors include Holger Dell, Harry Buhrman, Lance Fortnow, Eric Allender, Michal Koucký, Richard Lipton, Anastasios Viglas, Thomas Watson, N. V. Vinodchandran and Ran Raz and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Dieter van Melkebeek

43 papers receiving 416 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Dieter van Melkebeek United States	11	417	245	68	28	19	47	451
Rahul Santhanam United Kingdom	12	473 1.1×	336 1.4×	95 1.4×	39 1.4×	12 0.6×	72	563
Prahladh Harsha United States	11	337 0.8×	284 1.2×	79 1.2×	36 1.3×	14 0.7×	40	412
Miki Hermann France	7	185 0.4×	126 0.5×	63 0.9×	10 0.4×	15 0.8×	24	251
Stathis Zachos Greece	8	299 0.7×	241 1.0×	32 0.5×	44 1.6×	15 0.8×	17	369
Gerd Wechsung Germany	10	308 0.7×	164 0.7×	72 1.1×	32 1.1×	6 0.3×	34	368
Arnab Bhattacharyya United States	9	160 0.4×	130 0.5×	56 0.8×	15 0.5×	25 1.3×	34	220
Kevin J. Compton United States	13	259 0.6×	215 0.9×	46 0.7×	17 0.6×	50 2.6×	33	393
Holger Dell Germany	7	206 0.5×	62 0.3×	64 0.9×	19 0.7×	31 1.6×	20	241
Andreas Goerdt Germany	11	309 0.7×	186 0.8×	174 2.6×	7 0.3×	28 1.5×	23	388
Kevin Matulef United States	6	146 0.4×	122 0.5×	48 0.7×	15 0.5×	13 0.7×	11	196

Countries citing papers authored by Dieter van Melkebeek

Since Specialization

Citations

This map shows the geographic impact of Dieter van Melkebeek'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 Dieter van Melkebeek with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dieter van Melkebeek more than expected).

Fields of papers citing papers by Dieter van Melkebeek

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dieter van Melkebeek. 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 Dieter van Melkebeek. The network helps show where Dieter van Melkebeek may publish in the future.

Co-authorship network of co-authors of Dieter van Melkebeek

This figure shows the co-authorship network connecting the top 25 collaborators of Dieter van Melkebeek. A scholar is included among the top collaborators of Dieter van Melkebeek 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 Dieter van Melkebeek. Dieter van Melkebeek is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Melkebeek, Dieter van & Thomas Watson. (2012). . Theory of Computing. 8(1). 1–51. 11 indexed citations

Dell, Holger, Valentine Kabanets, Dieter van Melkebeek, & Osamu Watanabe. (2012). Is Valiant-Vazirani's Isolation Probability Improvable?. 44. 10–20. 3 indexed citations

Aaronson, Scott & Dieter van Melkebeek. (2011). . Theory of Computing. 7(1). 177–184. 7 indexed citations

Anderson, Matthew, et al.. (2011). Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. Electronic colloquium on computational complexity. 99. 273–282.

Aaronson, Scott & Dieter van Melkebeek. (2010). A note on circuit lower bounds from derandomization.. Electronic colloquium on computational complexity. 17. 105. 4 indexed citations

Melkebeek, Dieter van & Holger Dell. (2010). Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses.. Electronic colloquium on computational complexity. 17. 38. 1 indexed citations

Dell, Holger & Dieter van Melkebeek. (2010). Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. 251–260. 62 indexed citations

Aaronson, Scott, et al.. (2010). A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games.. Electronic colloquium on computational complexity. 17. 174. 3 indexed citations

Melkebeek, Dieter van & Thomas Watson. (2010). Time-Space Efficient Simulations of Quantum Computations.. Electronic colloquium on computational complexity. 17. 147. 3 indexed citations

10.

Antunes, Luís, Lance Fortnow, Dieter van Melkebeek, & N. V. Vinodchandran. (2005). Computational depth: Concept and applications. Theoretical Computer Science. 354(3). 391–404. 25 indexed citations

11.

Melkebeek, Dieter van & Ran Raz. (2005). A time lower bound for satisfiability. Theoretical Computer Science. 348(2-3). 311–320. 12 indexed citations

12.

Buhrman, Harry, et al.. (2004). Language compression and pseudorandom generators. 15–28. 6 indexed citations

13.

Melkebeek, Dieter van, et al.. (2002). The Quantum Black-Box Complexity of Majority. Algorithmica. 34(4). 480–501. 10 indexed citations

14.

Melkebeek, Dieter van. (2002). Reducing P to a sparse set using a constant number of queries collapses P to L. 28. 88–96.

15.

Buhrman, Harry & Dieter van Melkebeek. (2002). Hard sets are hard to find. 1046. 170–181. 1 indexed citations

16.

Melkebeek, Dieter van. (2001). The Computational Complexity Column Time-Space Lower Bounds for Satisfiability.. Bulletin of the European Association for Theoretical Computer Science. 73(5). 57–77. 1 indexed citations

17.

Melkebeek, Dieter van. (2000). Randomness and Completeness in Computational Complexity. Lecture notes in computer science. 9 indexed citations

18.

Buhrman, Harry, Lance Fortnow, Dieter van Melkebeek, & Leen Torenvliet. (2000). Separating Complexity Classes Using Autoreducibility. SIAM Journal on Computing. 29(5). 1497–1520. 12 indexed citations

19.

Buhrman, Harry & Dieter van Melkebeek. (1999). Hard Sets Are Hard to Find. Journal of Computer and System Sciences. 59(2). 327–345. 3 indexed citations

20.

Melkebeek, Dieter van. (1998). Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets. Journal of Computer and System Sciences. 57(2). 213–232. 2 indexed citations

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.

Explore authors with similar magnitude of impact