No. Title Author Year
1 An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability Jain, Rahul et al. 2019
2 Reachability in High Treewidth Graphs Jain, Rahul et al. 2019
3 Unambiguous Catalytic Computation Gupta, Chetan et al. 2019
4 A Composition Theorem for Randomized Query Complexity Anshu, Anurag et al. 2018
5 Separating Quantum Communication and Approximate Rank Anshu, Anurag et al. 2017
6 Partition Bound Is Quadratically Tight for Product Distributions Harsha, Prahladh et al. 2016
7 Unidirectional Input/Output Streaming Complexity of Reversal and Sorting François, Nathanaël et al. 2014
8 A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound Harsha, Prahladh et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 8


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