| No. |
Title |
Author |
Year |
| 1 |
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits |
Hrubes, Pavel et al. |
2019 |
| 2 |
Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers |
Natarajan Ramamoorthy, Sivaramakrishnan et al. |
2018 |
| 3 |
A Direct-Sum Theorem for Read-Once Branching Programs |
Rao, Anup et al. |
2016 |
| 4 |
Circuits with Medium Fan-In |
Hrubes, Pavel et al. |
2015 |
| 5 |
Frontmatter, Table of Contents, Preface, Program Commitees, External Reviewers, List of Authors |
Garg, Naveen et al. |
2015 |
| 6 |
How to Compress Asymmetric Communication |
Natarajan Ramamoorthy, Sivaramakrishnan et al. |
2015 |
| 7 |
LIPIcs, Volume 40, APPROX/RANDOM'15, Complete Volume |
Garg, Naveen et al. |
2015 |
| 8 |
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness |
Rao, Anup et al. |
2015 |
