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


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