| No. |
Title |
Author |
Year |
| 1 |
Set Membership with Two Classical and Quantum Bit Probes |
Dhamapurkar, Shyam S. et al. |
2022 |
| 2 |
Property B: Two-Coloring Non-Uniform Hypergraphs |
Radhakrishnan, Jaikumar et al. |
2021 |
| 3 |
Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes |
Dey, Palash et al. |
2020 |
| 4 |
Distance-Preserving Subgraphs of Interval Graphs |
Gajjar, Kshitij et al. |
2017 |
| 5 |
Set Membership with Non-Adaptive Bit Probes |
Garg, Mohit et al. |
2017 |
| 6 |
Partition Bound Is Quadratically Tight for Product Distributions |
Harsha, Prahladh et al. |
2016 |
| 7 |
The Zero-Error Randomized Query Complexity of the Pointer Function |
Radhakrishnan, Jaikumar et al. |
2016 |
| 8 |
Tight Bounds for Communication-Assisted Agreement Distillation |
Guruswami, Venkatesan et al. |
2016 |
| 9 |
LIPIcs, Volume 18, FSTTCS'12, Complete Volume |
D'Souza, Deepak et al. |
2013 |
| 10 |
Frontmatter, Table of Contents, Preface, Conference Organization |
D'Souza, Deepak et al. |
2012 |
