Scott Diehl Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2011
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Scott Diehl, Dieter van Melkebeek, Ryan Williams: An improved time-space lower bound for tautologies. J. Comb. Optim. 22(3): 325-338 (2011)
2009
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Scott Diehl, Dieter van Melkebeek, Ryan Williams: An Improved Time-Space Lower Bound for Tautologies. COCOON 2009: 429-438
2007
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Scott Diehl: Lower Bounds for Swapping Arthur and Merlin. APPROX-RANDOM 2007: 449-463
2006
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Scott Diehl, Dieter van Melkebeek: Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. SIAM J. Comput. 36(3): 563-594 (2006)
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Scott Diehl, Dieter van Melkebeek: Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. Complexity of Boolean Functions 2006
2005
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Scott Diehl, Dieter van Melkebeek: Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. ICALP 2005: 982-993

Coauthor Index

1Dieter van Melkebeek
[j2] [c4] [j1] [c2] [c1]
2Ryan Williams (R. Ryan Williams)
[j2] [c4]
Last update Fri May 24 23:11:19 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page