Choosing, Agreeing, and Eliminating in Communication Complexity Amos BeimelSebastian Ben DanielEnav Weinreb OriginalPaper 29 October 2013 Pages: 1 - 42
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification Sergei ArtemenkoRonen Shaltiel OriginalPaper 26 January 2013 Pages: 43 - 83
ReachFewL = ReachUL Brady GarvinDerrick StoleeN. V. Vinodchandran OriginalPaper 06 November 2012 Pages: 85 - 98
Tradeoff lower lounds for stack machines Matei DavidPeriklis A. Papakonstantinou OriginalPaper 08 January 2013 Pages: 99 - 146