- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c10 |      | |
| c9 | | Raghav Kulkarni, Youming Qiao, Xiaoming Sun: Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive. TAMC 2013: 224-235 |
| i10 | | Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh: {Upper Bounds on Fourier Entropy. Electronic Colloquium on Computational Complexity (ECCC) 20: 52 (2013) |
| 2012 | ||
| j7 | | 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) |
| c8 | | Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari: Improved Bounds for Bipartite Matching on Surfaces. STACS 2012: 254-265 |
| i9 | | Raghav Kulkarni, Miklos Santha: Query complexity of matroids. Electronic Colloquium on Computational Complexity (ECCC) 19: 63 (2012) |
| 2011 | ||
| j6 | | Pooya Hatami, Raghav Kulkarni, Denis Pankratov: Variations on the Sensitivity Conjecture. Theory of Computing, Graduate Surveys 2: 1-27 (2011) |
| j5 | | |
| c7 | | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS 2011: 579-590 |
| 2010 | ||
| j4 | | Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Theory Comput. Syst. 47(3): 737-757 (2010) |
| j3 | | Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan: Planarity, Determinants, Permanents, and (Unique) Matchings. TOCT 1(3) (2010) |
| c6 | | László Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik: Evasiveness and the Distribution of Prime Numbers. STACS 2010: 71-82 |
| i8 | | László Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik: Evasiveness and the Distribution of Prime Numbers. CoRR abs/1001.4829 (2010) |
| i7 | | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. CoRR abs/1004.5080 (2010) |
| i6 | | Pooya Hatami, Raghav Kulkarni, Denis Pankratov: Variations on the Sensitivity Conjecture. CoRR abs/1011.0354 (2010) |
| i5 | | 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) |
| i4 | | 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 | ||
| j2 | | Mark Braverman, Raghav Kulkarni, Sambuddha Roy: Space-Efficient Counting in Graphs on Surfaces. Computational Complexity 18(4): 601-649 (2009) |
| i3 | | Raghav Kulkarni: On the Power of Isolation in Planar Structures. Electronic Colloquium on Computational Complexity (ECCC) 16: 24 (2009) |
| 2008 | ||
| j1 | | Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan: Some perfect matchings and perfect half-integral matchings in NC. Chicago J. Theor. Comput. Sci. 2008 (2008) |
| c5 | | Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS 2008: 229-240 |
| i2 | | Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. CoRR abs/0802.2850 (2008) |
| 2007 | ||
| c4 | | Mark Braverman, Raghav Kulkarni, Sambuddha Roy: Parity Problems in Planar Graphs. IEEE Conference on Computational Complexity 2007: 222-235 |
| c3 | | Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan: Planarity, Determinants, Permanents, and (Unique) Matchings. CSR 2007: 115-126 |
| i1 | | Mark Braverman, Raghav Kulkarni, Sambuddha Roy: Parity Problems in Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(035) (2007) |
| 2006 | ||
| c2 | | 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 | ||
| c1 | | Raghav Kulkarni, Meena Mahajan: Seeking a Vertex of the Planar Matching Polytope in NC. ESA 2004: 472-483 |
Data released under the ODC-BY 1.0 license — See also our legal information page