#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2008

2018

- This year (4)
- Last 5 years (11)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan
- WALCOM
- 2009

In the k-means problem, we are given a finite set S of points in Rm, and integer k â‰¥ 1, and we want to find k points (centers) so as to minimize the sum of the square of the Euclidean distance ofâ€¦ (More)

- Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
- 2009 24th Annual IEEE Conference on Computationalâ€¦
- 2009

Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant gap between extantâ€¦ (More)

- Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
- CATS
- 2009

Reachability and distance computation are known to be NL-complete in general graphs, but within UL âˆ© co-UL if the graphs are planar. However, finding longest paths is known to be NP-complete, evenâ€¦ (More)

- Samir Datta, Nutan Limaye, Prajakta Nimbhorkar
- FSTTCS
- 2008

We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL âˆ© coUL [TW08]. In this paper, we give a deterministic log-spaceâ€¦ (More)

- Bireswar Das, Samir Datta, Prajakta Nimbhorkar
- Theory of Computing Systems
- 2013

Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 (Jakoby and Tantau in Proceedings of FSTTCSâ€™07: The 27th Annualâ€¦ (More)

- Michal KouckÃ½, Prajakta Nimbhorkar, Pavel PudlÃ¡k
- STOC
- 2011

We prove that the pseudorandom generator introduced by Impagliazzo et al. (1994) with proper choice of parameters fools group products of a given finite group G. The seed length is O((|G|O(1) + logâ€¦ (More)

- Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan
- Theor. Comput. Sci.
- 2012

- Prajakta Nimbhorkar, V ArvindRameshwar
- COCOON
- 2017

We consider the problem of matching applicants to posts where applicants have preferences over posts. Thus the input to our problem is a bipartite graph G = (A âˆª P , E), where A denotes a set ofâ€¦ (More)

- Michal KouckÃ½, Prajakta Nimbhorkar, Pavel PudlÃ¡k
- Electronic Colloquium on Computational Complexity
- 2010

We prove that the pseudorandom generator introduced in [INW94] fools group products of a given finite group. The seed length is O(log n log 1Îµ ), where n the length of the word and Îµ is theâ€¦ (More)

- Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
- J. Comb. Optim.
- 2014