Planarity, Exclusivity, and Unambiguity
暂无分享,去创建一个
Eric Allender | Samir Datta | Anish Mukherjee | Archit Chauhan | E. Allender | A. Mukherjee | Samir Datta | Archit Chauhan
[1] Raghav Kulkarni,et al. Space Complexity of Optimization Problems in Planar Graphs , 2014, TAMC.
[2] Ryan Williams,et al. Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made , 2015, STOC.
[3] Thomas Thierauf,et al. The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace , 2008, STACS.
[4] Ken-ichi Kawarabayashi,et al. Embedding and canonizing graphs of bounded genus in logspace , 2014, STOC.
[5] Raghav Kulkarni,et al. Planar Maximum Matching: Towards a Parallel Algorithm , 2018, ISAAC.
[6] Amir Abboud,et al. Towards Hardness of Approximation for Polynomial Time Problems , 2017, ITCS.
[7] Meena Mahajan,et al. Longest Paths in Planar DAGs in Unambiguous Log-Space , 2010, Chic. J. Theor. Comput. Sci..
[8] Jan Kyncl,et al. Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case , 2010, TOCT.
[9] Ivan Hal Sudborough,et al. On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.
[10] M.M. Halldorsson,et al. Directed vs. undirected monotone contact networks for threshold functions , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[11] Kousha Etessami,et al. Counting quantifiers, successor relations, and logarithmic space , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.
[12] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[13] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.
[14] Vijay V. Vazirani,et al. Planar Graph Perfect Matching Is in NC , 2017, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[15] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[16] T. Mathies. A fast parallel algorithm to determine edit distance , 1988 .
[17] Andreas Jakoby,et al. Logspace Versions of the Theorems of Bodlaender and Courcelle , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[18] Michael E. Saks,et al. Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[19] Raghunath Tewari,et al. Green's theorem and isolation in planar graphs , 2012, Inf. Comput..
[20] Eric Allender,et al. Planar and Grid Graph Reachability Problems , 2009, Theory of Computing Systems.
[21] Walter L. Ruzzo,et al. Parallel RAMs with owned global memory and deterministic context-free language recognition , 2000, JACM.
[22] Meena Mahajan,et al. The complexity of planarity testing , 2000, Inf. Comput..
[23] Erik D. Demaine,et al. Equivalence of local treewidth and linear local treewidth and its algorithmic applications , 2004, SODA '04.
[24] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[25] Dieter van Melkebeek,et al. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses , 1999, STOC '99.
[26] Donald B. Johnson,et al. Parallel algorithms for minimum cuts and maximum flows in planar networks , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[27] H. Venkateswaran. Properties that Characterize LOGCFL , 1991, J. Comput. Syst. Sci..
[28] Mi Lu,et al. Parallel Algorithms for the Longest Common Subsequence Problem , 1994, IEEE Trans. Parallel Distributed Syst..
[29] Jeffrey Scott Vitter,et al. An efficient parallel algorithm for shortest paths in planar layered digraphs , 2005, Algorithmica.
[30] Alon Itai,et al. Maximum Flow in Planar Networks , 1979, SIAM J. Comput..
[31] Eric Allender,et al. Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds , 1999, J. Comput. Syst. Sci..
[32] Heribert Vollmer,et al. Introduction to Circuit Complexity: A Uniform Approach , 2010 .
[33] Klaus-Jörn Lange,et al. Unambiguity of circuits , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.
[34] Omer Reingold,et al. Undirected connectivity in log-space , 2008, JACM.
[35] Eric Allender,et al. RUSPACE(log n) $\subseteq$ DSPACE(log2n/log log n) , 1998, Theory of Computing Systems.
[36] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..
[37] Uzi Vishkin,et al. Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..
[38] Mikhail J. Atallah,et al. Efficient Parallel Algorithms for String Editing and Related Problems , 1990, SIAM J. Comput..
[39] Piotr Indyk,et al. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) , 2014, STOC.
[40] Erik D. Demaine,et al. Approximation Schemes for Planar Graph Problems , 2008, Encyclopedia of Algorithms.
[41] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[42] Torben Hagerup,et al. Planar Depth-First Search in O(log n) Parallel Time , 1990, SIAM J. Comput..
[43] Nutan Limaye,et al. Planar Graph Isomorphism is in Log-Space , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[44] Raghunath Tewari,et al. Directed Planar Reachability is in Unambiguous Log-Space , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[45] Eric Allender,et al. Making nondeterminism unambiguous , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[46] David Eppstein. Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.