Volume 3, Number 1, August 2011

• 
  John M. Hitchcock, Aduri Pavan, N. Variyam Vinodchandran: Kolmogorov Complexity in Randomness Extraction. 1
• 
  Raghav Kulkarni: On the Power of Isolation in Planar Graphs. 2
• 
  Clifford Smyth: Approximate Query Complexity. 3

Volume 3, Number 2, January 2012

• 
  Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam: Pebbles and Branching Programs for Tree Evaluation. 4
• 
  Anna Gál, Andrew Mills: Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length. 5
• 
  Paul Beame, Trinh Huynh: The Value of Multiple Read/Write Streams for Approximating Frequency Moments. 6

last updated on Wed May 22 06:16:49 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page