Samir Datta Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2012
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran: Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci. 78(3): 765-779 (2012)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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. 417: 36-49 (2012)
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari: Improved Bounds for Bipartite Matching on Surfaces. STACS 2012: 254-265
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Rameshwar Pratap: Computing Bits of Algebraic Numbers. TAMC 2012: 189-201
i22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer: Verifying Proofs in Constant Depth. Electronic Colloquium on Computational Complexity (ECCC) 19: 79 (2012)
2011
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer: Verifying Proofs in Constant Depth. MFCS 2011: 84-95
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS 2011: 579-590
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Nagarajan Krishnamurthy: Some Tractable Win-Lose Games. TAMC 2011: 365-376
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Gautam Prakriya: Planarity Testing Revisited. TAMC 2011: 540-551
i21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Gautam Prakriya: Planarity Testing Revisited. CoRR abs/1101.2637 (2011)
i20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Rameshwar Pratap: Computing Bits of Algebraic Numbers. CoRR abs/1112.4295 (2011)
i19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Gautam Prakriya: Planarity Testing Revisited. Electronic Colloquium on Computational Complexity (ECCC) 18: 9 (2011)
2010
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Theory Comput. Syst. 47(3): 737-757 (2010)
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan: Planarity, Determinants, Permanents, and (Unique) Matchings. TOCT 1(3) (2010)
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer: Counting Classes and the Fine Structure between NC1 and L. MFCS 2010: 306-317
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bireswar Das, Samir Datta, Prajakta Nimbhorkar: Log-space Algorithms for Paths and Matchings in k-trees. STACS 2010: 215-226
i18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. CoRR abs/1004.5080 (2010)
i17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Nagarajan Krishnamurthy: Some Tractable Win-Lose Games. CoRR abs/1010.5951 (2010)
i16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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) 17: 50 (2010)
i15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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) 17: 79 (2010)
i14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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) 17: 101 (2010)
i13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Raghav Kulkarni, Raghunath Tewari: Perfect Matching in Bipartite Planar Graphs is in UL. Electronic Colloquium on Computational Complexity (ECCC) 17: 201 (2010)
2009
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy: Planar and Grid Graph Reachability Problems. Theory Comput. Syst. 45(4): 675-723 (2009)
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner: Planar Graph Isomorphism is in Log-Space. IEEE Conference on Computational Complexity 2009: 203-214
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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: 145-156
i12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bireswar Das, Samir Datta, Prajakta Nimbhorkar: Log-space Algorithms for Paths and Matchings in k-trees. CoRR abs/0912.4602 (2009)
i11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf: Planar Graph Isomorphism is in Log-space. Electronic Colloquium on Computational Complexity (ECCC) 16: 52 (2009)
2008
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar: 3-connected Planar Graph Isomorphism is in Log-space. FSTTCS 2008: 155-162
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS 2008: 229-240
i10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. CoRR abs/0802.2850 (2008)
i9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar: 3-connected Planar Graph Isomorphism is in Log-space. CoRR abs/0806.1041 (2008)
i8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner: A Log-space Algorithm for Canonization of Planar Graphs. CoRR abs/0809.2319 (2008)
2007
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan: Planarity, Determinants, Permanents, and (Unique) Matchings. CSR 2007: 115-126
2006
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy: Grid Graph Reachability Problems. IEEE Conference on Computational Complexity 2006: 299-313
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tanmoy Chakraborty, Samir Datta: One-Input-Face MPCVP Is Hard for L, But in LogDCFL. FSTTCS 2006: 57-68
i7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tanmoy Chakraborty, Samir Datta: One-input-face MPCVP is Hard for L, but in LogDCFL. Electronic Colloquium on Computational Complexity (ECCC) 13(130) (2006)
2005
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eric Allender, Samir Datta, Sambuddha Roy: Topology Inside NC¹. IEEE Conference on Computational Complexity 2005: 298-307
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eric Allender, Samir Datta, Sambuddha Roy: The Directed Planar Reachability Problem. FSTTCS 2005: 238-249
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rohit Naik, Subir K. Biswas, Samir Datta: Distributed Sleep-Scheduling Protocols for Energy Conservation in Wireless Networks. HICSS 2005
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Samir Datta, Ivan Seskar, Mustafa Demirhan, Siun-Chuon Mau, Dipankar Raychaudhuri: Ad-Hoc Extensions to the 802.15.3 MAC Protocol. WOWMOM 2005: 293-298
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eric Allender, Samir Datta, Sambuddha Roy: The Directed Planar Reachability Problem. Electronic Colloquium on Computational Complexity (ECCC)(148) (2005)
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy: Grid Graph Reachability Problems. Electronic Colloquium on Computational Complexity (ECCC)(149) (2005)
2004
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eric Allender, Samir Datta, Sambuddha Roy: Topology inside NC1. Electronic Colloquium on Computational Complexity (ECCC)(108) (2004)
2000
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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 (2000)
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits. J. Comput. Syst. Sci. 60(2): 395-421 (2000)
1999
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh: Bounded Depth Arithmetic Circuits: Counting and Closure. ICALP 1999: 149-158
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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) 6(12) (1999)
1998
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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) 5(57) (1998)
1997
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits. IEEE Conference on Computational Complexity 1997: 134-148
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits. Electronic Colloquium on Computational Complexity (ECCC) 4(16) (1997)

Coauthor Index

1Manindra Agrawal
[j2] [j1] [i2] [c1] [i1]
2Eric Allender
[j3] [c8] [c6] [c5] [i6] [i5] [i4] [j2] [j1] [c2] [i3] [i2] [c1] [i1]
3Andris Ambainis
[c2] [i3]
4David A. Mix Barrington
[j3] [c8] [i5] [c2] [i3]
5Olaf Beyersdorff
[i22] [c19]
6Subir K. Biswas
[c4]
7Tanmoy Chakraborty
[j3] [c8] [c7] [i7] [i5]
8Bireswar Das
[c14] [i12]
9Mustafa Demirhan
[c3]
10Arjun Gopalan
[c21]
11Andreas Krebs
[i22]
12Nagarajan Krishnamurthy
[c17] [i17]
13Raghav Kulkarni
[j7] [c21] [c18] [j5] [j4] [i18] [i15] [i13] [c10] [i10] [c9]
14Huong LeThanh
[c2] [i3]
15Nutan Limaye
[j4] [c13] [i11] [c11] [i9] [i8] [c9]
16Meena Mahajan
[j6] [i22] [c19] [j4] [c15] [i14] [c9]
17Siun-Chuon Mau (Siun Mau)
[c3]
18Rohit Naik
[c4]
19Prajakta Nimbhorkar
[c14] [i16] [c13] [c12] [i12] [i11] [c11] [i9] [i8]
20Gautam Prakriya
[c16] [i21] [i19]
21Rameshwar Pratap
[c20] [i20]
22B. V. Raghavendra Rao
[j6] [c15] [i14]
23Dipankar Raychaudhuri
[c3]
24Sambuddha Roy
[j5] [j3] [c10] [i10] [c8] [c6] [c5] [i6] [i5] [i4]
25Gido Scharfenberger-Fabian
[i22] [c19]
26Ivan Seskar
[c3]
27Karteek Sreenivasaiah
[i22] [c19]
28Raghunath Tewari
[j7] [c21] [c18] [i18] [i15] [i13]
29Thomas Thierauf
[i16] [c13] [c12] [i11] [i8]
30Michael Thomas
[j6] [i22] [c19] [c15] [i14]
31N. V. Vinodchandran (N. Variyam Vinodchandran)
[j7] [c18] [i18] [i15]
32Heribert Vollmer
[j6] [i22] [c19] [c15] [i14] [j2] [i2]
33Fabian Wagner
[i16] [c13] [c12] [i11] [i8]
34Klaus W. Wagner
[j2] [i2]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Tue May 21 13:22:37 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page