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 Reachability in O(log n) Genus Graphs is in Unambiguous Logspace Gupta, Chetan et al. 2019
4 Unambiguous Catalytic Computation Gupta, Chetan et al. 2019
5 Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs Arora, Rahul et al. 2016
6 Trading Determinism for Time in Space Bounded Computations Kallampally, Vivek Anand T et al. 2016
7 New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs Chakraborty, Diptarka et al. 2014
8 Improved Bounds for Bipartite Matching on Surfaces Datta, Samir et al. 2012
9 Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs Datta, Samir et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 9

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