| No. |
Title |
Author |
Year |
| 1 |
Streaming k-Edit Approximate Pattern Matching via String Decomposition |
Bhattacharya, Sudatta et al. |
2023 |
| 2 |
Barrington Plays Cards: The Complexity of Card-Based Protocols |
Dvořák, Pavel et al. |
2021 |
| 3 |
Computing Edit Distance (Invited Talk) |
Koucký, Michal |
2021 |
| 4 |
Data Structures Lower Bounds and Popular Conjectures |
Dvořák, Pavel et al. |
2021 |
| 5 |
Sorting Short Integers |
Koucký, Michal et al. |
2021 |
| 6 |
Improved Bounds on Fourier Entropy and Min-Entropy |
Arunachalam, Srinivasan et al. |
2020 |
| 7 |
Approximate Online Pattern Matching in Sublinear Time |
Chakraborty, Diptarka et al. |
2019 |
| 8 |
Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication |
Das, Debarati et al. |
2018 |
| 9 |
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity |
Chakraborty, Diptarka et al. |
2018 |
| 10 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121) |
Gál, Anna et al. |
2017 |
| 11 |
Expander Construction in VNC1 |
Buss, Sam et al. |
2017 |
| 12 |
Lower Bounds for Elimination via Weak Regularity |
Chattopadhyay, Arkadev et al. |
2017 |
| 13 |
Catalytic Space: Non-determinism and Hierarchy |
Buhrman, Harry et al. |
2016 |
| 14 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121) |
Gal, Anna et al. |
2014 |
| 15 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121) |
Grohe, Martin et al. |
2011 |
| 16 |
High Entropy Random Selection Protocols |
Vereshchagin, Nikolai K. et al. |
2008 |
| 17 |
Incremental branching programs |
Gál, Anna et al. |
2006 |
