Concepedia

Dieter van Melkebeek

DV

Statistics

Publications

19

Citations

780

H-Index

13

Active since

1999

Affiliations

University of Wisconsin–Madison(Current)

University of Chicago

Centrum Wiskunde & Informatica

University of Amsterdam

Rutgers, The State University of New Jersey

Dieter van Melkebeek is an author at University of Wisconsin–Madison specializing in engineering, computational complexity, and computer science.

Top concepts

EngineeringComputational ComplexityComputer ScienceFormal MethodsProbabilityAutomated ReasoningFormal VerificationDiscrete MathematicsMathematical ProgrammingEntropy

Publications per year

1999–2015

19

Publications

19

Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses

Holger Dell, Dieter van Melkebeek · 2010 · 166 citations

Mathematical Programming, Computational Complexity Theory, Engineering +22

Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses

Holger Dell, Dieter van Melkebeek · Journal of the ACM · 2014 · 157 citations

Mathematical Programming, Computational Complexity Theory, Engineering +21

Power from Random Strings

Eric Allender, Harry Buhrman, Michal Koucký et al. · SIAM Journal on Computing · 2006 · 93 citations

Energy Harvesting, Engineering, Pseudo-random Sequence +14

Time-space lower bounds for satisfiability

Lance Fortnow, Richard Lipton, Dieter van Melkebeek et al. · Journal of the ACM · 2005 · 72 citations

Mathematical Programming, Constant C, Engineering +15

Computational depth: Concept and applications

Luís Antunes, Lance Fortnow, Dieter van Melkebeek et al. · Theoretical Computer Science · 2005 · 60 citations

Geometric Modeling, Machine Vision, Engineering +9

1–5 of 19