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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI