The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dieter van Melkebeek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dieter van Melkebeek, Mitsunori Ogihara
    Sparse Hard Sets for P. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:191-208 [Conf]
  2. Luis Antunes, Lance Fortnow, Dieter van Melkebeek
    Computational Depth. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:266-273 [Conf]
  3. Harry Buhrman, Troy Lee, Dieter van Melkebeek
    Language Compression and Pseudorandom Generators. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:15-28 [Conf]
  4. Harry Buhrman, Dieter van Melkebeek
    Hard Sets are Hard to Find. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:170-181 [Conf]
  5. Lance Fortnow, Dieter van Melkebeek
    Time-Space Tradeoffs for Nondeterministic Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:2-13 [Conf]
  6. Dieter van Melkebeek
    Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:88-96 [Conf]
  7. Dieter van Melkebeek, Konstantin Pervyshev
    A Generic Time Hierarchy for Semantic Models with One Bit of Advice. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:129-144 [Conf]
  8. Rahul Santhanam, Dieter van Melkebeek
    Holographic Proofs and Derandomization. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:269-283 [Conf]
  9. Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger
    Power from Random Strings. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:669-678 [Conf]
  10. Scott Diehl, Dieter van Melkebeek
    Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:982-993 [Conf]
  11. Dieter van Melkebeek, Ran Raz
    A Time Lower Bound for Satisfiability. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:971-982 [Conf]
  12. Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek
    Optimal Proof Systems and Sparse Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:407-418 [Conf]
  13. Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss
    A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:161-171 [Conf]
  14. Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek
    Time-Space Tradeoff in Derandomizing Probabilistic Logspace. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:571-583 [Conf]
  15. Adam Klivans, Dieter van Melkebeek
    Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:659-667 [Conf]
  16. Thomas P. Hayes, Samuel Kutin, Dieter van Melkebeek
    The Quantum Black-Box Complexity of Majority. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:4, pp:480-501 [Journal]
  17. Harry Buhrman, Troy Lee, Dieter van Melkebeek
    Language compression and pseudorandom generators. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:3, pp:228-255 [Journal]
  18. Dieter van Melkebeek
    The Computational Complexity Column Time-Space Lower Bounds for Satisfiability. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2001, v:73, n:, pp:57-77 [Journal]
  19. Lance Fortnow, Dieter van Melkebeek
    Time-Space Tradeoffs for Nondeterministic Computation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:28, pp:- [Journal]
  20. Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek
    Power from Random Strings [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:028, pp:- [Journal]
  21. Troy Lee, Dieter van Melkebeek, Harry Buhrman
    Language Compression and Pseudorandom Generators [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:002, pp:- [Journal]
  22. Dieter van Melkebeek, Konstantin Pervyshev
    A Generic Time Hierarchy for Semantic Models With One Bit of Advice [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:111, pp:- [Journal]
  23. 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 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:58, pp:- [Journal]
  24. Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas
    Time-space lower bounds for satisfiability. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:6, pp:835-865 [Journal]
  25. Harry Buhrman, Dieter van Melkebeek
    Hard Sets Are Hard to Find. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:2, pp:327-345 [Journal]
  26. Dieter van Melkebeek
    Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:2, pp:213-232 [Journal]
  27. Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek
    Time-Space Tradeoff in Derandomizing Probabilistic Logspace. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:1, pp:189-208 [Journal]
  28. Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger
    Power from Random Strings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:6, pp:1467-1493 [Journal]
  29. Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet
    Separating Complexity Classes Using Autoreducibility. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1497-1520 [Journal]
  30. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:576-601 [Journal]
  31. Adam Klivans, Dieter van Melkebeek
    Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1501-1526 [Journal]
  32. Dieter van Melkebeek, Rahul Santhanam
    Holographic Proofs and Derandmization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:59-90 [Journal]
  33. Scott Diehl, Dieter van Melkebeek
    Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:563-594 [Journal]
  34. Luis Antunes, Lance Fortnow, Dieter van Melkebeek, N. V. Vinodchandran
    Computational depth: Concept and applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:354, n:3, pp:391-404 [Journal]
  35. Dieter van Melkebeek
    The zero-one law holds for BPP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:244, n:1-2, pp:283-288 [Journal]
  36. Dieter van Melkebeek, Ran Raz
    A time lower bound for satisfiability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:311-320 [Journal]
  37. Dieter van Melkebeek, Konstantin Pervyshev
    A Generic Time Hierarchy with One Bit of Advice. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2007, v:16, n:2, pp:139-179 [Journal]

  38. Pseudorandom Generators and Typically-Correct Derandomization. [Citation Graph (, )][DBLP]


  39. An Improved Time-Space Lower Bound for Tautologies. [Citation Graph (, )][DBLP]


  40. A Generic Time Hierarchy for Semantic Models With One Bit of Advice. [Citation Graph (, )][DBLP]


  41. 06111 Abstracts Collection -- Complexity of Boolean Functions. [Citation Graph (, )][DBLP]


  42. Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. [Citation Graph (, )][DBLP]


  43. 06111 Executive Summary -- Complexity of Boolean Functions. [Citation Graph (, )][DBLP]


  44. Space Hierarchy Results for Randomized Models. [Citation Graph (, )][DBLP]


  45. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. [Citation Graph (, )][DBLP]


  46. A Quantum Time-Space Lower Bound for the Counting Hierarchy. [Citation Graph (, )][DBLP]


  47. Space Hierarchy Results for Randomized and Other Semantic Models. [Citation Graph (, )][DBLP]


  48. A Survey of Lower Bounds for Satisfiability and Related Problems. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002