Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Dieter van Melkebeek" ( http://dblp.L3S.de/Authors/Dieter_van_Melkebeek )

URL (Homepage):  http://www.cs.wisc.edu/~dieter/  Author page on DBLP  Author page in RDF  Community of Dieter van Melkebeek in ASPL-2

Publication years (Num. hits)
1996-2000 (16) 2001-2005 (17) 2006-2008 (16) 2009-2011 (18) 2012 (1)
Publication types (Num. hits)
article(41) book(1) inproceedings(25) proceedings(1)
Venues (Conferences, Journals, ...)
Electronic Colloquium on Compu...(16) IEEE Conference on Computation...(8) SIAM J. Comput.(7) Complexity of Boolean Function...(5) Computational Complexity(5) STACS(4) ICALP(3) Theor. Comput. Sci.(3) J. Comput. Syst. Sci.(2) STOC(2) Advances in Algorithms, Langua...(1) Algorithmica(1) APPROX-RANDOM(1) Bulletin of the EATCS(1) COCOON(1) Dagstuhl Reports(1) More (+10 of total 22)
Authors
Dieter van Melkebeek(68) Harry Buhrman(14) Lance Fortnow(7) Jeff Kinne(6) Scott Diehl(5) Konstantin Pervyshev(4) Matthew Anderson(4) Michal Koucký(4) Rüdiger Reischuk(4) Scott Aaronson(4) Adam Klivans(3) D. Sivakumar(3) Detlef Ronneburger(3) Eric Allender(3) Kenneth W. Regan(3) Martin Strauss(3) More (+10 of total 46)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 13 occurrences of 12 keywords
Results
Found 68 publication records. Showing 68 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds. Search on Bibsonomy Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Scott Diehl, Dieter van Melkebeek, Ryan Williams An improved time-space lower bound for tautologies. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin Locality from Circuit Lower Bounds. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Scott Aaronson, Dieter van Melkebeek On Circuit Lower Bounds from Derandomization. Search on Bibsonomy Theory of Computing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dieter van Melkebeek Special Issue "Conference on Computational Complexity 2010" Guest Editor's Foreword. Search on Bibsonomy Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates. Search on Bibsonomy ICALP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dieter van Melkebeek, Thomas Watson Time-Space Efficient Simulations of Quantum Computations. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Scott Aaronson, Dieter van Melkebeek A note on circuit lower bounds from derandomization. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Dieter van Melkebeek, Holger Dell Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Jeff Kinne, Dieter van Melkebeek Space Hierarchy Results for Randomized and other Semantic Models. Search on Bibsonomy Computational Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Holger Dell, Dieter van Melkebeek Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF arithmetic progression free sets, hereditary graph properties, vertex deletion problems, satisfiability, kernelization, vertex cover, parameterized complexity, probabilistically checkable proofs, feedback vertex set, sparsification
1Scott 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). Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  BibTeX  RDF
1Scott Diehl, Dieter van Melkebeek, Ryan Williams An Improved Time-Space Lower Bound for Tautologies. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel Pseudorandom Generators and Typically-Correct Derandomization. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dieter van Melkebeek, Thomas Watson A Quantum Time-Space Lower Bound for the Counting Hierarchy. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Jeff Kinne, Dieter van Melkebeek Space Hierarchy Results for Randomized Models. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jeff Kinne, Dieter van Melkebeek Space Hierarchy Results for Randomized and Other Semantic Models. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Dieter van Melkebeek A Survey of Lower Bounds for Satisfiability and Related Problems. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Dieter van Melkebeek, Konstantin Pervyshev A Generic Time Hierarchy with One Bit of Advice. Search on Bibsonomy Computational Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Subject classification. 68Q15, 68Q10
1Luis Antunes 0002, Lance Fortnow, Dieter van Melkebeek, N. V. Vinodchandran Computational depth: Concept and applications. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Dieter van Melkebeek A Survey of Lower Bounds for Satisfiability and Related Problems. Search on Bibsonomy Foundations and Trends in Theoretical Computer Science The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek Time-Space Tradeoff in Derandomizing Probabilistic Logspace. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger Power from Random Strings. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Scott Diehl, Dieter van Melkebeek Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek (eds.) Complexity of Boolean Functions, 12.03. - 17.03.2006 Search on Bibsonomy Complexity of Boolean Functions The full citation details ... 2006 DBLP  BibTeX  RDF
1Dieter van Melkebeek, Konstantin Pervyshev A Generic Time Hierarchy for Semantic Models With One Bit of Advice. Search on Bibsonomy Complexity of Boolean Functions The full citation details ... 2006 DBLP  BibTeX  RDF
1Scott Diehl, Dieter van Melkebeek Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. Search on Bibsonomy Complexity of Boolean Functions The full citation details ... 2006 DBLP  BibTeX  RDF
1Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek 06111 Abstracts Collection -- Complexity of Boolean Functions. Search on Bibsonomy Complexity of Boolean Functions The full citation details ... 2006 DBLP  BibTeX  RDF
1Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk 06111 Executive Summary -- Complexity of Boolean Functions. Search on Bibsonomy Complexity of Boolean Functions The full citation details ... 2006 DBLP  BibTeX  RDF
1Dieter van Melkebeek, Konstantin Pervyshev A Generic Time Hierarchy for Semantic Models with One Bit of Advice. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Dieter van Melkebeek, Konstantin Pervyshev A Generic Time Hierarchy for Semantic Models With One Bit of Advice Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Dieter van Melkebeek, Ran Raz A time lower bound for satisfiability. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas Time-space lower bounds for satisfiability. Search on Bibsonomy J. ACM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Complexity of satisfiability, time-space lower bounds
1Harry Buhrman, Troy Lee, Dieter van Melkebeek Language compression and pseudorandom generators. Search on Bibsonomy Computational Complexity The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Subject classification, 68P30
1Dieter van Melkebeek, Rahul Santhanam Holographic Proofs and Derandmization. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Scott Diehl, Dieter van Melkebeek Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Troy Lee, Dieter van Melkebeek, Harry Buhrman Language Compression and Pseudorandom Generators Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Dieter van Melkebeek, Ran Raz A Time Lower Bound for Satisfiability. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek Time-Space Tradeoff in Derandomizing Probabilistic Logspace. Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Troy Lee, Dieter van Melkebeek Language Compression and Pseudorandom Generators. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Rahul Santhanam, Dieter van Melkebeek Holographic Proofs and Derandomization. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek Power from Random Strings Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Thomas P. Hayes, Samuel Kutin, Dieter van Melkebeek The Quantum Black-Box Complexity of Majority. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Adam Klivans, Dieter van Melkebeek Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger Power from Random Strings. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Dieter van Melkebeek The Computational Complexity Column Time-Space Lower Bounds for Satisfiability. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2001 DBLP  BibTeX  RDF
1Luis Antunes 0002, Lance Fortnow, Dieter van Melkebeek Computational Depth. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Lance Fortnow, Dieter van Melkebeek Time-Space Tradeoffs for Nondeterministic Computation Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2000 DBLP  BibTeX  RDF
1Dieter van Melkebeek The zero-one law holds for BPP. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry 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. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet Separating Complexity Classes Using Autoreducibility. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Dieter van Melkebeek Randomness and Completeness in Computational Complexity Search on Bibsonomy 2000   DOI  RDF
1Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek Optimal Proof Systems and Sparse Sets. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Lance Fortnow, Dieter van Melkebeek Time-Space Tradeoffs for Nondeterministic Computation. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Satisfiability, Time-space tradeoffs
1Harry Buhrman, Dieter van Melkebeek Hard Sets Are Hard to Find. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Adam Klivans, Dieter van Melkebeek Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. Search on Bibsonomy STOC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Adam Klivans, Dieter van Melkebeek Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1998 DBLP  BibTeX  RDF
1Harry 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 Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1998 DBLP  BibTeX  RDF
1Dieter van Melkebeek Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). Search on Bibsonomy STACS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Dieter van Melkebeek Hard Sets are Hard to Find. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Dieter van Melkebeek, Mitsunori Ogihara Sparse Hard Sets for P. Search on Bibsonomy Advances in Algorithms, Languages, and Complexity The full citation details ... 1997 DBLP  BibTeX  RDF
1Dieter van Melkebeek Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF computational complexity theory, sparse hard set problem for P
Displaying result #1 - #68 of 68 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.