No. |
Title |
Author |
Year |
1 |
Improved Bounds on Fourier Entropy and Min-Entropy |
Arunachalam, Srinivasan et al. |
2020 |
2 |
Approximate Online Pattern Matching in Sublinear Time |
Chakraborty, Diptarka et al. |
2019 |
3 |
Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication |
Das, Debarati et al. |
2018 |
4 |
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity |
Chakraborty, Diptarka et al. |
2018 |
5 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121) |
Gál, Anna et al. |
2017 |
6 |
Expander Construction in VNC1 |
Buss, Sam et al. |
2017 |
7 |
Lower Bounds for Elimination via Weak Regularity |
Chattopadhyay, Arkadev et al. |
2017 |
8 |
Catalytic Space: Non-determinism and Hierarchy |
Buhrman, Harry et al. |
2016 |
9 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121) |
Gal, Anna et al. |
2014 |
10 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121) |
Grohe, Martin et al. |
2011 |
11 |
High Entropy Random Selection Protocols |
Vereshchagin, Nikolai K. et al. |
2008 |
12 |
Incremental branching programs |
Gál, Anna et al. |
2006 |