|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 20 publication records. Showing 20 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev |
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar |
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev |
Expanding Generator Sets for Solvable Permutation Groups. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar |
Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák |
Pseudorandom generators for group products: extended abstract. |
STOC |
2011 |
DBLP DOI 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 | Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák |
Pseudorandom Generators for Group Products. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar |
Longest Paths in Planar DAGs in Unambiguous Log-Space. |
Chicago J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar |
Popularity at Minimum Cost |
CoRR |
2010 |
DBLP 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 | Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar |
Popularity at Minimum Cost. |
ISAAC |
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 | Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan |
The Planar k-Means Problem is NP-Hard. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 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, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
A Log-space Algorithm for Canonization of Planar Graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar |
Longest paths in Planar DAGs in Unambiguous Logspace |
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, Nutan Limaye, Prajakta Nimbhorkar |
3-connected Planar Graph Isomorphism is in Log-space. |
FSTTCS |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #20 of 20 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")