Raghav Kulkarni

	2012
24		Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari: Improved Bounds for Bipartite Matching on Surfaces. STACS 2012: 254-265
23		Raghav Kulkarni, Miklos Santha: Query complexity of matroids. Electronic Colloquium on Computational Complexity (ECCC) 19: 63 (2012)
22		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)
	2011
21		Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS 2011: 579-590
20		Raghav Kulkarni: On the Power of Isolation in Planar Graphs. TOCT 3(1): 2 (2011)
19		Pooya Hatami, Raghav Kulkarni, Denis Pankratov: Variations on the Sensitivity Conjecture. Theory of Computing, Graduate Surveys 2: 1-27 (2011)
	2010
18		László Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik: Evasiveness and the Distribution of Prime Numbers. STACS 2010: 71-82
17		László Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik: Evasiveness and the Distribution of Prime Numbers CoRR abs/1001.4829: (2010)
16		Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs CoRR abs/1004.5080: (2010)
15		Pooya Hatami, Raghav Kulkarni, Denis Pankratov: Variations on the Sensitivity Conjecture CoRR abs/1011.0354: (2010)
14		Samir Datta, Raghav Kulkarni, Raghunath Tewari: Perfect Matching in Bipartite Planar Graphs is in UL. Electronic Colloquium on Computational Complexity (ECCC) 17: 201 (2010)
13		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)
12		Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan: Planarity, Determinants, Permanents, and (Unique) Matchings. TOCT 1(3): (2010)
11		Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Theory Comput. Syst. 47(3): 737-757 (2010)
	2009
10		Mark Braverman, Raghav Kulkarni, Sambuddha Roy: Space-Efficient Counting in Graphs on Surfaces. Computational Complexity 18(4): 601-649 (2009)
9		Raghav Kulkarni: On the Power of Isolation in Planar Structures. Electronic Colloquium on Computational Complexity (ECCC) 16: 24 (2009)
	2008
8		Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS 2008: 229-240
7		Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan: Some perfect matchings and perfect half-integral matchings in NC. Chicago J. Theor. Comput. Sci. 2008: (2008)
6		Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs CoRR abs/0802.2850: (2008)
	2007
5		Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan: Planarity, Determinants, Permanents, and (Unique) Matchings. CSR 2007: 115-126
4		Mark Braverman, Raghav Kulkarni, Sambuddha Roy: Parity Problems in Planar Graphs. IEEE Conference on Computational Complexity 2007: 222-235
3		Mark Braverman, Raghav Kulkarni, Sambuddha Roy: Parity Problems in Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(035): (2007)
	2006
2		Raghav Kulkarni: A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small. CIAC 2006: 308-319
	2004
1		Raghav Kulkarni, Meena Mahajan: Seeking a Vertex of the Planar Matching Polytope in NC. ESA 2004: 472-483

Coauthor Index

1	László Babai	[17] [18]
2	Anandam Banerjee	[17] [18]
3	Mark Braverman	[3] [4] [10]
4	Samir Datta	[5] [6] [8] [11] [12] [13] [14] [16] [21] [22] [24]
5	Arjun Gopalan	[24]
6	Pooya Hatami	[15] [19]
7	Nutan Limaye	[5] [12]
8	Meena Mahajan	[1] [5] [7] [12]
9	Vipul Naik	[17] [18]
10	Denis Pankratov	[15] [19]
11	Sambuddha Roy	[3] [4] [6] [8] [10] [11]
12	Miklos Santha	[23]
13	Raghunath Tewari	[13] [14] [16] [21] [22] [24]
14	Kasturi R. Varadarajan	[7]
15	N. V. Vinodchandran (N. Variyam Vinodchandran)	[13] [16] [21] [22]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page