The following pages link to Bireswar Das (Q385511):
Displayed 34 items.
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- CNF and DNF succinct graph encodings (Q515682) (← links)
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
- SZK proofs for black-box group problems (Q929290) (← links)
- Isomorphism and canonization of tournaments and hypertournaments (Q988566) (← links)
- On the parallel parameterized complexity of the graph isomorphism problem (Q1641130) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- Space efficient representations of finite groups (Q2194866) (← links)
- Compact data structures for Dedekind groups and finite rings (Q2232236) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- Succinct representations of finite groups (Q2291422) (← links)
- Zero knowledge and circuit minimization (Q2407082) (← links)
- COLORED HYPERGRAPH ISOMORPHISM is fixed parameter tractable (Q2908862) (← links)
- Zero Knowledge and Circuit Minimization (Q2922592) (← links)
- On Structural Parameterizations of Graph Motif and Chromatic Number (Q2971640) (← links)
- (Q3113750) (← links)
- Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs (Q3113751) (← links)
- (Q3395962) (← links)
- SZK Proofs for Black-Box Group Problems (Q3434677) (← links)
- A Logspace Algorithm for Partial 2-Tree Canonization (Q3503623) (← links)
- The Complexity of Black-Box Ring Problems (Q3591294) (← links)
- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs (Q5176596) (← links)
- The Space Complexity of k-Tree Isomorphism (Q5387816) (← links)
- Succinct Encodings of Graph Isomorphism (Q5404919) (← links)
- On Isomorphism and Canonization of Tournaments and Hypertournaments (Q5459140) (← links)
- Aspects of Molecular Computing (Q5901848) (← links)
- Nearly linear time isomorphism algorithms for some nonabelian group classes (Q5918355) (← links)
- Nearly linear time isomorphism algorithms for some nonabelian group classes (Q5919682) (← links)
- On structural parameterizations of firefighting (Q5920210) (← links)
- The Entropy Influence Conjecture Revisited (Q6228473) (← links)
- Linear Space Data Structures for Finite Groups with Constant Query-time (Q6428297) (← links)
- Algorithms for the Minimum Generating Set Problem (Q6436585) (← links)
- The Isomorphism Problem of Power Graphs and a Question of Cameron (Q6438477) (← links)