|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10 occurrences of 10 keywords
|
|
|
|
|
Results
Found 49 publication records. Showing 49 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
Counting classes and the fine structure between NC1 and L.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran |
Space complexity of perfect matching in bounded genus bipartite graphs. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Rameshwar Pratap |
Computing Bits of Algebraic Numbers. |
TAMC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari |
Improved Bounds for Bipartite Matching on Surfaces. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Gautam Prakriya |
Planarity Testing Revisited. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Gautam Prakriya |
Planarity Testing Revisited |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Rameshwar Pratap |
Computing Bits of Algebraic Numbers |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Gautam Prakriya |
Planarity Testing Revisited. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Nagarajan Krishnamurthy |
Some Tractable Win-Lose Games. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer |
Verifying Proofs in Constant Depth. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan |
Planarity, Determinants, Permanents, and (Unique) Matchings. |
TOCT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari |
Perfect Matching in Bipartite Planar Graphs is in UL. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
Counting Classes and the Fine Structure between NC1 and L. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
Graph Isomorphism for K{3, 3}-free and K5-free graphs is in Log-space. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Nagarajan Krishnamurthy |
Some Tractable Win-Lose Games |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Sambuddha Roy |
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. |
Theory Comput. Syst. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
Counting Classes and the Fine Structure between NC1 and L. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bireswar Das, Samir Datta, Prajakta Nimbhorkar |
Log-space Algorithms for Paths and Matchings in k-trees. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf |
Planar Graph Isomorphism is in Log-space. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Bireswar Das, Samir Datta, Prajakta Nimbhorkar |
Log-space Algorithms for Paths and Matchings in k-trees |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy |
Planar and Grid Graph Reachability Problems. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Logspace, Algorithms, Planar graphs, Reachability, Complexity theory, Circuit complexity, Grid graphs |
| 1 | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
Planar Graph Isomorphism is in Log-Space. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Sambuddha Roy |
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
A Log-space Algorithm for Canonization of Planar Graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar |
3-connected Planar Graph Isomorphism is in Log-space |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Sambuddha Roy |
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar |
3-connected Planar Graph Isomorphism is in Log-space. |
FSTTCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan |
Planarity, Determinants, Permanents, and (Unique) Matchings. |
CSR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanmoy Chakraborty, Samir Datta |
One-input-face MPCVP is Hard for L, but in LogDCFL. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy |
Grid Graph Reachability Problems. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanmoy Chakraborty, Samir Datta |
One-Input-Face MPCVP Is Hard for L, But in LogDCFL. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
L, LogDCFL, monotone planar circuits |
| 1 | Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy |
Grid Graph Reachability Problems |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Samir Datta, Sambuddha Roy |
The Directed Planar Reachability Problem |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Rohit Naik, Subir K. Biswas, Samir Datta |
Distributed Sleep-Scheduling Protocols for Energy Conservation in Wireless Networks. |
HICSS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Ivan Seskar, Mustafa Demirhan, Siun-Chuon Mau, Dipankar Raychaudhuri |
Ad-Hoc Extensions to the 802.15.3 MAC Protocol. |
WOWMOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Samir Datta, Sambuddha Roy |
Topology Inside NC¹. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Samir Datta, Sambuddha Roy |
The Directed Planar Reachability Problem. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Samir Datta, Sambuddha Roy |
Topology inside NC1 |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner |
Characterizing Small Depth and Small Space Classes by Operators of Higher Type. |
Chicago J. Theor. Comput. Sci. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Samir Datta |
On TC0, AC0, and Arithmetic Circuits. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh |
Bounded Depth Arithmetic Circuits: Counting and Closure |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh |
Bounded Depth Arithmetic Circuits: Counting and Closure. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner |
Characterizing Small Depth and Small Space Classes by Operators of Higher Types |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Samir Datta |
On TC0, AC0, and Arithmetic Circuits |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Samir Datta |
On TC0, AC0, and Arithmetic Circuits. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
TC/sup 0/, AC/sup 0/, function classes, constant-depth polynomial-size arithmetic circuits, unbounded fanin addition, multiplication gates, constant-depth arithmetic circuits, computational complexity, normal forms, arithmetic circuits, closure properties |
Displaying result #1 - #49 of 49 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")