dblp.uni-trier.dewww.uni-trier.de

Sambuddha Roy

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
18EEVinayaka Pandit, Natwar Modani, Sougata Mukherjea, Amit Anil Nanavati, Sambuddha Roy, Amit Agarwal: Extracting dense communities from telecom call graphs. COMSWARE 2008: 82-89
17EEVenkatesan T. Chakaravarthy, Sambuddha Roy: Arthur and Merlin as Oracles. MFCS 2008: 229-240
16EEVenkatesan T. Chakaravarthy, Sambuddha Roy: Finding Irrefutable Certificates for S2p via Arthur and Merlin. STACS 2008: 157-168
15EESamir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS 2008: 229-240
14EESamir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs CoRR abs/0802.2850: (2008)
2007
13EEMark Braverman, Raghav Kulkarni, Sambuddha Roy: Parity Problems in Planar Graphs. IEEE Conference on Computational Complexity 2007: 222-235
12EEVenkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania: Decision trees for entity identification: approximation algorithms and hardness results. PODS 2007: 53-62
11EEMark Braverman, Raghav Kulkarni, Sambuddha Roy: Parity Problems in Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(035): (2007)
2006
10EEEric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy: Grid Graph Reachability Problems. IEEE Conference on Computational Complexity 2006: 299-313
9EEVenkatesan T. Chakaravarthy, Sambuddha Roy: Oblivious Symmetric Alternation. STACS 2006: 230-241
2005
8EEEric Allender, Samir Datta, Sambuddha Roy: The Directed Planar Reachability Problem. FSTTCS 2005: 238-249
7EEEric Allender, Samir Datta, Sambuddha Roy: Topology Inside NC¹. IEEE Conference on Computational Complexity 2005: 298-307
6EEEric Allender, Samir Datta, Sambuddha Roy: The Directed Planar Reachability Problem Electronic Colloquium on Computational Complexity (ECCC)(148): (2005)
5EEEric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy: Grid Graph Reachability Problems Electronic Colloquium on Computational Complexity (ECCC)(149): (2005)
2004
4EEEric Allender, Samir Datta, Sambuddha Roy: Topology inside NC1 Electronic Colloquium on Computational Complexity (ECCC)(108): (2004)
2003
3EEEric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy: Derandomization and Distinguishing Complexity. IEEE Conference on Computational Complexity 2003: 209-220
2001
2EEEric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay: Time-Space Tradeoffs in the Counting Hierarchy. IEEE Conference on Computational Complexity 2001: 295-302
1EEEric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay: Time-Space Tradeoffs in the Counting Hierarchy Electronic Colloquium on Computational Complexity (ECCC) 8(41): (2001)

Coauthor Index

1Amit Agarwal [18]
2Eric Allender [1] [2] [3] [4] [5] [6] [7] [8] [10]
3Pranjal Awasthi [12]
4David A. Mix Barrington [5] [10]
5Mark Braverman [11] [13]
6Venkatesan T. Chakaravarthy [9] [12] [16] [17]
7Tanmoy Chakraborty [5] [10]
8Samir Datta [4] [5] [6] [7] [8] [10] [14] [15]
9Michal Koucký [1] [2] [3]
10Raghav Kulkarni [11] [13] [14] [15]
11Natwar Modani [18]
12Mukesh K. Mohania [12]
13Sougata Mukherjea [18]
14Amit Anil Nanavati [18]
15Vinayaka Pandit [12] [18]
16Detlef Ronneburger [1] [2] [3]
17V. Vinay [1] [2]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)