default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDieter van Melkebeek
Person information
- affiliation: University of Wisconsin-Madison, Madison, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j36]Ivan Hu, Dieter van Melkebeek, Andrew Morgan:
Polynomial Identity Testing via Evaluation of Rational Functions. Theory Comput. 20: 1-70 (2024)- [j35]Ivan Hu, Dieter van Melkebeek, Andrew Morgan:
Lower Bound Techniques in the Comparison-Query Model and Applications to Inversion Minimization. Theory Comput. 20: 1-62 (2024) - 2023
- [c29]Dieter van Melkebeek, Nicollas M. Sdroievski:
Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin Protocols. CCC 2023: 17:1-17:36 - [c28]Dieter van Melkebeek, Nicollas M. Sdroievski:
Leakage Resilience, Targeted Pseudorandom Generators, and Mild Derandomization of Arthur-Merlin Protocols. FSTTCS 2023: 29:1-29:22 - [c27]Ivan Hu, Dieter van Melkebeek, Andrew Morgan:
Query Complexity of Inversion Minimization on Trees. SODA 2023: 2836-2866 - [i33]Nicollas M. Sdroievski, Dieter van Melkebeek:
Instance-Wise Hardness versus Randomness Tradeoffs for Arthur-Merlin Protocols. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c26]Dieter van Melkebeek, Andrew Morgan:
Polynomial Identity Testing via Evaluation of Rational Functions. ITCS 2022: 119:1-119:24 - [i32]Dieter van Melkebeek, Andrew Morgan:
Polynomial Identity Testing via Evaluation of Rational Functions. CoRR abs/2211.01062 (2022) - [i31]Ivan Hu, Dieter van Melkebeek, Andrew Morgan:
Query Complexity of Inversion Minimization on Trees. CoRR abs/2211.12441 (2022) - [i30]Ivan Hu, Andrew Morgan, Dieter van Melkebeek:
Query Complexity of Inversion Minimization on Trees. Electron. Colloquium Comput. Complex. TR22 (2022) - [i29]Dieter van Melkebeek, Andrew Morgan:
Polynomial Identity Testing via Evaluation of Rational Functions. Electron. Colloquium Comput. Complex. TR22 (2022)
2010 – 2019
- 2019
- [j34]Dieter van Melkebeek, Gautam Prakriya:
Derandomizing Isolation in Space-Bounded Settings. SIAM J. Comput. 48(3): 979-1021 (2019) - 2018
- [j33]Eric Allender
, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, Andrew Morgan:
Minimum Circuit Size, Graph Isomorphism, and Related Problems. SIAM J. Comput. 47(4): 1339-1372 (2018) - [c25]Eric Allender, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, Andrew Morgan:
Minimum Circuit Size, Graph Isomorphism, and Related Problems. ITCS 2018: 20:1-20:20 - 2017
- [j32]Baris Aydinlioglu, Dieter van Melkebeek:
Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games. Comput. Complex. 26(1): 79-118 (2017) - [c24]Dieter van Melkebeek, Gautam Prakriya:
Derandomizing Isolation in Space-Bounded Settings. CCC 2017: 5:1-5:32 - [i28]Eric Allender, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, Andrew Morgan:
Minimum Circuit Size, Graph Isomorphism, and Related Problems. CoRR abs/1710.09806 (2017) - [i27]Eric Allender, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, Andrew Morgan:
Minimum Circuit Size, Graph Isomorphism, and Related Problems. Electron. Colloquium Comput. Complex. TR17 (2017) - [i26]Dieter van Melkebeek, Gautam Prakriya:
Derandomizing Isolation in Space-Bounded Settings. Electron. Colloquium Comput. Complex. TR17 (2017) - 2015
- [j31]Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich:
Deterministic polynomial identity tests for multilinear bounded-read formulae. Comput. Complex. 24(4): 695-776 (2015) - 2014
- [j30]Holger Dell, Dieter van Melkebeek:
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses. J. ACM 61(4): 23:1-23:27 (2014) - 2013
- [j29]Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe:
Is Valiant-Vazirani's isolation probability improvable? Comput. Complex. 22(2): 345-383 (2013) - 2012
- [j28]Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel:
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds. Comput. Complex. 21(1): 3-61 (2012) - [j27]Kousha Etessami, Dieter van Melkebeek, Seth Pettie, John Watrous, Salil P. Vadhan:
Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011). SIAM J. Comput. 41(5): 1233-1234 (2012) - [j26]Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin:
Locality from Circuit Lower Bounds. SIAM J. Comput. 41(6): 1481-1523 (2012) - [j25]George Karakostas, Jeff Kinne, Dieter van Melkebeek:
On derandomization and average-case complexity of monotone functions. Theor. Comput. Sci. 434: 35-44 (2012) - [j24]Dieter van Melkebeek, Thomas Watson:
Time-Space Efficient Simulations of Quantum Computations. Theory Comput. 8(1): 1-51 (2012) - [c23]Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe:
Is Valiant-Vazirani's Isolation Probability Improvable? CCC 2012: 10-20 - [c22]Baris Aydinlioglu, Dieter van Melkebeek:
Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games. CCC 2012: 269-279 - [i25]Baris Aydinlioglu, Dieter van Melkebeek:
Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin Games. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j23]Dieter van Melkebeek:
Special Issue "Conference on Computational Complexity 2010" Guest Editor's Foreword. Comput. Complex. 20(2): 173-175 (2011) - [j22]Scott Diehl, Dieter van Melkebeek, Ryan Williams:
An improved time-space lower bound for tautologies. J. Comb. Optim. 22(3): 325-338 (2011) - [j21]Scott Aaronson, Dieter van Melkebeek:
On Circuit Lower Bounds from Derandomization. Theory Comput. 7(1): 177-184 (2011) - [c21]Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich:
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. CCC 2011: 273-282 - [c20]Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin:
Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates. ICALP (2) 2011: 368-379 - [i24]Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). Dagstuhl Reports 1(3): 42-66 (2011) - [i23]Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin:
Locality from Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j20]Jeff Kinne, Dieter van Melkebeek:
Space Hierarchy Results for Randomized and other Semantic Models. Comput. Complex. 19(3): 423-475 (2010) - [c19]Holger Dell, Dieter van Melkebeek:
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. STOC 2010: 251-260 - [i22]Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek:
A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games. Electron. Colloquium Comput. Complex. TR10 (2010) - [i21]Scott Aaronson, Dieter van Melkebeek:
A note on circuit lower bounds from derandomization. Electron. Colloquium Comput. Complex. TR10 (2010) - [i20]Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich:
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. Electron. Colloquium Comput. Complex. TR10 (2010) - [i19]Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel:
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR10 (2010) - [i18]Dieter van Melkebeek, Holger Dell:
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. Electron. Colloquium Comput. Complex. TR10 (2010) - [i17]Dieter van Melkebeek, Thomas Watson:
Time-Space Efficient Simulations of Quantum Computations. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j19]Scott Aaronson, Sudipto Guha, Jon M. Kleinberg, Frank McSherry, Dieter van Melkebeek, Amit Sahai:
Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006). SIAM J. Comput. 39(1): vii (2009) - [c18]Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel:
Pseudorandom Generators and Typically-Correct Derandomization. APPROX-RANDOM 2009: 574-587 - [c17]Scott Diehl, Dieter van Melkebeek, Ryan Williams:
An Improved Time-Space Lower Bound for Tautologies. COCOON 2009: 429-438 - [i16]Holger Dell, Dieter van Melkebeek:
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. Parameterized complexity and approximation algorithms 2009 - 2008
- [c16]Jeff Kinne, Dieter van Melkebeek:
Space Hierarchy Results for Randomized Models. STACS 2008: 433-444 - [e2]Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek:
Computational Complexity of Discrete Problems, 14.09. - 19.09.2008. Dagstuhl Seminar Proceedings 08381, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i15]Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek:
08381 Abstracts Collection - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems 2008 - [i14]Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek:
08381 Executive Summary - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems 2008 - [i13]Dieter van Melkebeek, Thomas Watson:
A Quantum Time-Space Lower Bound for the Counting Hierarchy. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j18]Dieter van Melkebeek, Konstantin Pervyshev:
A Generic Time Hierarchy with One Bit of Advice. Comput. Complex. 16(2): 139-179 (2007) - [i12]Jeff Kinne, Dieter van Melkebeek:
Space Hierarchy Results for Randomized and Other Semantic Models. Electron. Colloquium Comput. Complex. TR07 (2007) - [i11]Dieter van Melkebeek:
A Survey of Lower Bounds for Satisfiability and Related Problems. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j17]Dieter van Melkebeek:
A Survey of Lower Bounds for Satisfiability and Related Problems. Found. Trends Theor. Comput. Sci. 2(3): 197-303 (2006) - [j16]Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek:
Time-Space Tradeoff in Derandomizing Probabilistic Logspace. Theory Comput. Syst. 39(1): 189-208 (2006) - [j15]Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger:
Power from Random Strings. SIAM J. Comput. 35(6): 1467-1493 (2006) - [j14]Scott Diehl, Dieter van Melkebeek:
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. SIAM J. Comput. 36(3): 563-594 (2006) - [j13]Luis Antunes, Lance Fortnow, Dieter van Melkebeek, N. V. Vinodchandran:
Computational depth: Concept and applications. Theor. Comput. Sci. 354(3): 391-404 (2006) - [c15]Dieter van Melkebeek, Konstantin Pervyshev:
A Generic Time Hierarchy for Semantic Models with One Bit of Advice. CCC 2006: 129-144 - [e1]Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek:
Complexity of Boolean Functions, 12.03. - 17.03.2006. Dagstuhl Seminar Proceedings 06111, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i10]Scott Diehl, Dieter van Melkebeek:
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. Complexity of Boolean Functions 2006 - [i9]Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk:
06111 Executive Summary -- Complexity of Boolean Functions. Complexity of Boolean Functions 2006 - [i8]Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek:
06111 Abstracts Collection -- Complexity of Boolean Functions. Complexity of Boolean Functions 2006 - [i7]Dieter van Melkebeek, Konstantin Pervyshev:
A Generic Time Hierarchy for Semantic Models With One Bit of Advice. Complexity of Boolean Functions 2006 - 2005
- [j12]Harry Buhrman, Troy Lee, Dieter van Melkebeek:
Language compression and pseudorandom generators. Comput. Complex. 14(3): 228-255 (2005) - [j11]Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas:
Time-space lower bounds for satisfiability. J. ACM 52(6): 835-865 (2005) - [j10]Dieter van Melkebeek, Rahul Santhanam:
Holographic Proofs and Derandmization. SIAM J. Comput. 35(1): 59-90 (2005) - [j9]Dieter van Melkebeek, Ran Raz:
A time lower bound for satisfiability. Theor. Comput. Sci. 348(2-3): 311-320 (2005) - [c14]Scott Diehl, Dieter van Melkebeek:
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. ICALP 2005: 982-993 - [i6]Dieter van Melkebeek, Konstantin Pervyshev:
A Generic Time Hierarchy for Semantic Models With One Bit of Advice. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c13]Harry Buhrman, Troy Lee, Dieter van Melkebeek:
Language Compression and Pseudorandom Generators. CCC 2004: 15-28 - [c12]Dieter van Melkebeek, Ran Raz:
A Time Lower Bound for Satisfiability. ICALP 2004: 971-982 - [c11]Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek:
Time-Space Tradeoff in Derandomizing Probabilistic Logspace. STACS 2004: 571-583 - [i5]Troy Lee, Dieter van Melkebeek, Harry Buhrman:
Language Compression and Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c10]Rahul Santhanam, Dieter van Melkebeek:
Holographic Proofs and Derandomization. CCC 2003: 269-283 - 2002
- [j8]Thomas P. Hayes, Samuel Kutin, Dieter van Melkebeek:
The Quantum Black-Box Complexity of Majority. Algorithmica 34(4): 480-501 (2002) - [j7]Adam R. Klivans, Dieter van Melkebeek:
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. SIAM J. Comput. 31(5): 1501-1526 (2002) - [c9]Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger:
Power from Random Strings. FOCS 2002: 669-678 - [i4]Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek:
Power from Random Strings. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j6]Dieter van Melkebeek:
The Computational Complexity Column Time-Space Lower Bounds for Satisfiability. Bull. EATCS 73: 57-77 (2001) - [c8]Luis Antunes, Lance Fortnow, Dieter van Melkebeek:
Computational Depth. CCC 2001: 266-273 - 2000
- [b1]Dieter van Melkebeek:
Randomness and Completeness in Computational Complexity. Lecture Notes in Computer Science 1950, Springer 2000, ISBN 3-540-41492-4 - [j5]Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet:
Separating Complexity Classes Using Autoreducibility. SIAM J. Comput. 29(5): 1497-1520 (2000) - [j4]Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss:
A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem. SIAM J. Comput. 30(2): 576-601 (2000) - [j3]Dieter van Melkebeek:
The zero-one law holds for BPP. Theor. Comput. Sci. 244(1-2): 283-288 (2000) - [c7]Lance Fortnow, Dieter van Melkebeek:
Time-Space Tradeoffs for Nondeterministic Computation. CCC 2000: 2-13 - [c6]Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek:
Optimal Proof Systems and Sparse Sets. STACS 2000: 407-418 - [i3]Lance Fortnow, Dieter van Melkebeek:
Time-Space Tradeoffs for Nondeterministic Computation. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j2]Harry Buhrman, Dieter van Melkebeek:
Hard Sets Are Hard to Find. J. Comput. Syst. Sci. 59(2): 327-345 (1999) - [c5]Adam R. Klivans, Dieter van Melkebeek:
Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. STOC 1999: 659-667 - 1998
- [j1]Dieter van Melkebeek:
Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets. J. Comput. Syst. Sci. 57(2): 213-232 (1998) - [c4]Harry Buhrman, Dieter van Melkebeek:
Hard Sets are Hard to Find. CCC 1998: 170-181 - [c3]Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss:
A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). STACS 1998: 161-171 - [i2]Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, Martin Strauss, D. Sivakumar:
A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem. Electron. Colloquium Comput. Complex. TR98 (1998) - [i1]Adam R. Klivans, Dieter van Melkebeek:
Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [c2]Dieter van Melkebeek, Mitsunori Ogihara:
Sparse Hard Sets for P. Advances in Algorithms, Languages, and Complexity 1997: 191-208 - 1996
- [c1]Dieter van Melkebeek:
Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L. CCC 1996: 88-96
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
