default search action
Bireswar Das
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Bireswar Das, Anant Kumar, Shivdutt Sharma
, Dhara Thakkar:
Linear Space Data Structures for Finite Groups with Constant Query-Time. Algorithmica 86(6): 1979-2025 (2024) - [c22]Bireswar Das, Jinia Ghosh, Anant Kumar:
The Isomorphism Problem of Power Graphs and a Question of Cameron. FSTTCS 2024: 20:1-20:23 - [c21]Bireswar Das
The Minimal Faithful Permutation Degree of Groups without Abelian Normal Subgroups. STOC 2024: 118-129 - [i16]Deepu Benson, Bireswar Das, Dipan Dey, Jinia Ghosh:
On Oriented Diameter of Power Graphs. CoRR abs/2409.02457 (2024) - 2023
- [i15]Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar:
Linear Space Data Structures for Finite Groups with Constant Query-time. CoRR abs/2303.01957 (2023) - [i14]Bireswar Das, Dhara Thakkar:
Algorithms for the Minimum Generating Set Problem. CoRR abs/2305.08405 (2023) - [i13]Bireswar Das, Jinia Ghosh, Anant Kumar:
The Isomorphism Problem of Power Graphs and a Question of Cameron. CoRR abs/2305.18936 (2023) - 2022
- [c20]Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar:
Linear Space Data Structures for Finite Groups with Constant Query-Time. STACS 2022: 25:1-25:17 - 2021
- [j14]Bireswar Das, Shivdutt Sharma
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes. Theory Comput. Syst. 65(3): 497-514 (2021) - [c19]Bireswar Das, Shivdutt Sharma
Compact Data Structures for Dedekind Groups and Finite Rings. WALCOM 2021: 90-102 - 2020
- [j13]Bireswar Das, Shivdutt Sharma
Space efficient representations of finite groups. J. Comput. Syst. Sci. 114: 137-146 (2020) - [j12]Bireswar Das, Murali Krishna Enduri
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three. Theor. Comput. Sci. 819: 9-23 (2020) - [i12]Bireswar Das, Shivdutt Sharma, P. R. Vaidyanathan:
Space Efficient Representations of Finite Groups. CoRR abs/2002.11391 (2020)
2010 – 2019
- 2019
- [j11]Bireswar Das, Murali Krishna Enduri
On structural parameterizations of firefighting. Theor. Comput. Sci. 782: 79-90 (2019) - [c18]Bireswar Das, Shivdutt Sharma
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes. CSR 2019: 80-92 - [c17]Bireswar Das, Shivdutt Sharma
Succinct Representations of Finite Groups. FCT 2019: 229-242 - 2018
- [j10]Bireswar Das, Anirban Dasgupta
On NC algorithms for problems on bounded rank-width graphs. Inf. Process. Lett. 139: 64-67 (2018) - [c16]Bireswar Das, Murali Krishna Enduri
On Structural Parameterizations of Firefighting. CALDAM 2018: 221-234 - [c15]Bireswar Das, Murali Krishna Enduri
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. WALCOM 2018: 252-264 - 2017
- [j9]Bireswar Das, Patrick Scharpfenecker, Jacobo Torán:
CNF and DNF succinct graph encodings. Inf. Comput. 253: 436-447 (2017) - [j8]Eric Allender
Zero knowledge and circuit minimization. Inf. Comput. 256: 2-8 (2017) - [c14]Bireswar Das, Murali Krishna Enduri
On Structural Parameterizations of Graph Motif and Chromatic Number. CALDAM 2017: 118-129 - [i11]Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. CoRR abs/1711.08885 (2017) - [i10]Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy:
On Structural Parameterizations of Firefighting. CoRR abs/1711.10227 (2017) - 2016
- [c13]Bireswar Das, Murali Krishna Enduri
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three. COCOON 2016: 55-66 - 2015
- [j7]Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Algorithmica 71(1): 120-138 (2015) - [c12]Bireswar Das, Murali Krishna Enduri
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. WALCOM 2015: 329-334 - [i9]Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3. CoRR abs/1506.01695 (2015) - [i8]Bireswar Das, Patrick Scharpfenecker, Jacobo Torán:
Succinct Encodings of Graph Isomorphism. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c11]Bireswar Das, Patrick Scharpfenecker, Jacobo Torán:
Succinct Encodings of Graph Isomorphism. LATA 2014: 285-296 - [c10]Eric Allender
Zero Knowledge and Circuit Minimization. MFCS (2) 2014: 25-32 - [i7]Eric Allender, Bireswar Das:
Zero Knowledge and Circuit Minimization. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j6]Bireswar Das, Samir Datta
Log-Space Algorithms for Paths and Matchings in k-Trees. Theory Comput. Syst. 53(4): 669-689 (2013) - 2012
- [j5]Vikraman Arvind, Bireswar Das, Johannes Köbler, Sebastian Kuhnert
The isomorphism problem for k-trees is complete for logspace. Inf. Comput. 217: 1-11 (2012) - [j4]Bireswar Das, Jacobo Torán, Fabian Wagner:
Restricted space algorithms for isomorphism on bounded treewidth graphs. Inf. Comput. 217: 71-83 (2012) - 2011
- [i6]Bireswar Das, Manjish Pal, Vijay Visavaliya:
The Entropy Influence Conjecture Revisited. CoRR abs/1110.4301 (2011) - [i5]Bireswar Das, Manjish Pal, Vijay Visavaliya:
The Entropy Influence Conjecture Revisited. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j3]Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay:
Isomorphism and canonization of tournaments and hypertournaments. J. Comput. Syst. Sci. 76(7): 509-523 (2010) - [c9]Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. FSTTCS 2010: 327-337 - [c8]Bireswar Das, Samir Datta
Log-space Algorithms for Paths and Matchings in k-trees. STACS 2010: 215-226 - [c7]Bireswar Das, Jacobo Torán, Fabian Wagner:
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. STACS 2010: 227-238 - [i4]Bireswar Das, Jacobo Torán, Fabian Wagner:
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. CoRR abs/1001.0383 (2010)
2000 – 2009
- 2009
- [i3]Bireswar Das, Samir Datta, Prajakta Nimbhorkar:
Log-space Algorithms for Paths and Matchings in k-trees. CoRR abs/0912.4602 (2009) - [i2]Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Electron. Colloquium Comput. Complex. TR09 (2009) - [i1]Bireswar Das, Jacobo Torán, Fabian Wagner:
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j2]Vikraman Arvind, Bireswar Das:
SZK Proofs for Black-Box Group Problems. Theory Comput. Syst. 43(2): 100-117 (2008) - [c6]Vikraman Arvind, Bireswar Das, Johannes Köbler:
A Logspace Algorithm for Partial 2-Tree Canonization. CSR 2008: 40-51 - 2007
- [c5]Vikraman Arvind, Bireswar Das, Johannes Köbler:
The Space Complexity of k -Tree Isomorphism. ISAAC 2007: 822-833 - 2006
- [c4]Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay:
The Complexity of Black-Box Ring Problems. COCOON 2006: 126-135 - [c3]Vikraman Arvind, Bireswar Das:
SZK Proofs for Black-Box Group Problems. CSR 2006: 6-17 - [c2]Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay:
On Isomorphism and Canonization of Tournaments and Hypertournaments. ISAAC 2006: 449-459 - 2004
- [c1]Rani Siromoney, Bireswar Das:
Plasmids to Solve #3SAT. Aspects of Molecular Computing 2004: 361-366 - 2003
- [j1]Rani Siromoney, Bireswar Das:
DNA algorithm for breaking a propositional logic based cryptosystem. Bull. EATCS 79: 170-177 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 01:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: