4 papers
Maximum Matching and Related Problems in Catalytic Logspace
Srijan Chakraborty, Samir Datta, Aryan Kusre +2
Understanding the power of space-bounded computation with access to catalytic space has been an important theme in complexity theory over the recent years. One of the key algorithm…
Derandomizing Isolation In Catalytic Logspace
V. Arvind, Srijan Chakraborty, Samir Datta
A language is said to be in catalytic logspace if we can test membership using a deterministic logspace machine that has an additional read/write tape filled with arbitrary data wh…
Fast exact algorithms via the Matrix Tree Theorem
V. Arvind, Srijan Chakraborty, Samir Datta +1
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each othe…
A parallel algorithm for the odd two-face shortest k-disjoint path problem
Srijan Chakraborty, Samir Datta
The shortest Disjoint Path problem (SDPP) requires us to find pairwise vertex disjoint paths between k designated pairs of terminal vertices such that the sum of the path lengths i…