Dieter v. Melkebeek
Affiliations: | University of Wisconsin, Madison, Madison, WI |
Area:
Computer ScienceGoogle:
"Dieter Melkebeek"Children
Sign in to add trainee| Scott Diehl | grad student | 2008 | UW Madison |
| Jeffrey J. Kinne | grad student | 2010 | UW Madison |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Melkebeek Dv, Prakriya G. (2019) Derandomizing Isolation in Space-Bounded Settings Siam Journal On Computing. 48: 979-1021 |
| Melkebeek Dv, Prakriya G. (2017) Derandomizing isolation in space-bounded settings Electronic Colloquium On Computational Complexity. 24: 32 |
| Dell H, Melkebeek DV. (2014) Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses Journal of the Acm. 61: 23 |
| Dell H, Kabanets V, Melkebeek Dv, et al. (2013) Is Valiant–Vazirani’s isolation probability improvable? Computational Complexity. 22: 345-383 |
| Melkebeek Dv, Watson T. (2012) Time-Space Efficient Simulations of Quantum Computations Theory of Computing. 8: 1-51 |
| Anderson M, Melkebeek Dv, Schweikardt N, et al. (2012) Locality from Circuit Lower Bounds Siam Journal On Computing. 41: 1481-1523 |
| Dell H, Kabanets V, Melkebeek DV, et al. (2012) Is valiant-Vazirani's isolation probability improvable? Proceedings of the Annual Ieee Conference On Computational Complexity. 10-20 |
| Aydinliog̃lu B, Melkebeek DV. (2012) Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games Proceedings of the Annual Ieee Conference On Computational Complexity. 269-279 |
| Kinne J, Melkebeek Dv, Shaltiel R. (2012) Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds Computational Complexity. 21: 3-61 |
| Aaronson S, Melkebeek Dv. (2011) On Circuit Lower Bounds from Derandomization Theory of Computing. 7: 177-184 |