1. Choosing, Agreeing, and Eliminating in Communication Complexity

   • Amos Beimel
   • Sebastian Ben Daniel
   • Enav Weinreb

   OriginalPaper 29 October 2013 Pages: 1 - 42

2. Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification

   • Sergei Artemenko
   • Ronen Shaltiel

   OriginalPaper 26 January 2013 Pages: 43 - 83

3. ReachFewL = ReachUL

   • Brady Garvin
   • Derrick Stolee
   • N. V. Vinodchandran

   OriginalPaper 06 November 2012 Pages: 85 - 98

4. Tradeoff lower lounds for stack machines

   • Matei David
   • Periklis A. Papakonstantinou

   OriginalPaper 08 January 2013 Pages: 99 - 146