Scott Diehl

Research Publications:

• S. Diehl, D. van Melkebeek, and R. Williams. A Generic Time-Space Lower Bound for Proof Complexity. Submitted, 2008.


• S. Diehl. Lower Bounds for Swapping Arthur and Merlin. Full version of extended abstract of same title appearing in Proceedings of the 11th International Workshop on Randomized Techniques in Computation, pages 449--463. Springer-Verlag, 2007.


• S. Diehl and D. van Melkebeek. Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. SIAM Journal on Computing, 36:563-594, 2006. This is a sigificantly improved and extended version of the paper below.


• S. Diehl and D. van Melkebeek. Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. In Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming, pages 982--993. Springer-Verlag, 2005.


• S. Diehl and K. Compton. An implementation of the polynomial-calculus as a SAT solver. Extended abstract at the Sixth International Conference on Theory and Applications of Satisfiability Testing, pages 273--280, 2003.


• S. Diehl, J. Budd, D. Ullman, J. Cayula. Geographic window sizes applied to remote sensing sea surface temperature front detection. Journal of Atmospheric and Oceanic Technology, 19(7):1105-1113, 2002.