| No. |
Title |
Author |
Year |
| 1 |
Adversarially Robust Coloring for Graph Streams |
Chakrabarti, Amit et al. |
2022 |
| 2 |
Counting Simplices in Hypergraph Streams |
Chakrabarti, Amit et al. |
2022 |
| 3 |
Front Matter, Table of Contents, Preface, Conference Organization |
Chakrabarti, Amit et al. |
2022 |
| 4 |
LIPIcs, Volume 245, APPROX/RANDOM 2022, Complete Volume |
Chakrabarti, Amit et al. |
2022 |
| 5 |
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models |
Bera, Suman K. et al. |
2020 |
| 6 |
Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches |
Chakrabarti, Amit et al. |
2020 |
| 7 |
Streaming Verification of Graph Computations via Graph Structure |
Chakrabarti, Amit et al. |
2019 |
| 8 |
Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams |
Bera, Suman K. et al. |
2017 |
| 9 |
A Depth-Five Lower Bound for Iterated Matrix Multiplication |
Bera, Suman K. et al. |
2015 |
| 10 |
On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model |
Bishnu, Arijit et al. |
2015 |
| 11 |
Verifiable Stream Computation and Arthur–Merlin Communication |
Chakrabarti, Amit et al. |
2015 |
| 12 |
Certifying Equality With Limited Interaction |
Brody, Joshua et al. |
2014 |
| 13 |
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound |
Brody, Joshua et al. |
2008 |
