The following pages link to Samir Datta (Q385512):
Displaying 46 items.
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- Space complexity of perfect matching in bounded genus bipartite graphs (Q439936) (← links)
- Planar and grid graph reachability problems (Q733742) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397) (← links)
- Dynamic complexity of expansion (Q2117075) (← links)
- Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
- Characterizing small depth and small space classes by operators of higher types (Q2709238) (← links)
- Computing Bits of Algebraic Numbers (Q2898030) (← links)
- Improved bounds for bipartite matching on surfaces (Q2904767) (← links)
- Graph isomorphism for \(K_{3,3}\)-free and \(K_5\)-free graphs is in Log-space (Q2920122) (← links)
- Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs (Q2922591) (← links)
- Bounded Treewidth and Space-Efficient Linear Algebra (Q2948475) (← links)
- Some Tractable Win-Lose Games (Q3010417) (← links)
- Planarity Testing Revisited (Q3010433) (← links)
- Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. (Q3113721) (← links)
- Log-space algorithms for paths and matchings in \(k\)-trees (Q3113750) (← links)
- 3-connected Planar Graph Isomorphism is in Log-space (Q3165955) (← links)
- Reachability is in DynFO (Q3449473) (← links)
- (Q4584898) (← links)
- Graph properties in node-query setting: effect of breaking symmetry (Q4608576) (← links)
- Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs (Q4608587) (← links)
- Reachability Is in DynFO (Q4625654) (← links)
- (Q4910722) (← links)
- (Q4938621) (← links)
- (Q5002805) (← links)
- Randomized and Symmetric Catalytic Computation (Q5042242) (← links)
- (Q5090955) (← links)
- Planar Maximum Matching: Towards a Parallel Algorithm (Q5091011) (← links)
- A Strategy for Dynamic Programs: Start over and Muddle through (Q5111430) (← links)
- Dynamic Complexity of Directed Reachability and Other Problems (Q5167755) (← links)
- Counting Euler Tours in Undirected Bounded Treewidth Graphs (Q5275372) (← links)
- (Q5376663) (← links)
- One-Input-Face MPCVP Is Hard for L, But in LogDCFL (Q5385973) (← links)
- Space Complexity of Optimization Problems in Planar Graphs (Q5410651) (← links)
- Collapsing Exact Arithmetic Hierarchies (Q5746264) (← links)
- Planarity, Determinants, Permanents, and (Unique) Matchings (Q5892182) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897773) (← links)
- Planarity, Determinants, Permanents, and (Unique) Matchings (Q5900038) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
- Depth-First Search in Directed Planar Graphs, Revisited (Q6168415) (← links)
- Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles (Q6168451) (← links)
- (Q6187029) (← links)
- USSR is in P/poly (Q6545112) (← links)
- Dynamic meta-theorems for distance and matching (Q6560919) (← links)
- Dynamic planar embedding is in DynFO (Q6647668) (← links)
