The SCEAS System
| |||||||

## Search the dblp DataBase
Mayur Thakur:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Lane A. Hemaspaandra, Mayur Thakur
**Query-Monotonic Turing Reductions.**[Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:895-904 [Conf] - Holger Spakowski, Mayur Thakur, Rahul Tripathi
**Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2003, pp:375-386 [Conf] - Mayur Thakur, Rahul Tripathi
**Complexity of Linear Connectivity Problems in Directed Hypergraphs.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:481-493 [Conf] - Christopher M. Homan, Mayur Thakur
**One-Way Permutations and Self-Witnessing Languages.**[Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:243-254 [Conf] - Lane A. Hemaspaandra, Mayur Thakur
**Lower Bounds and the Hardness of Counting Properties.**[Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:217-229 [Conf] - Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur
**Computational Aspects of Analyzing Social Network Dynamics.**[Citation Graph (0, 0)][DBLP] IJCAI, 2007, pp:2268-2273 [Conf] - Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
**Complexity of Cycle Length Modularity Problems in Graphs.**[Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:509-518 [Conf] - Sreeram Ramakrishnan, Mayur Thakur
**An SDS modeling approach for simulation-based control.**[Citation Graph (0, 0)][DBLP] Winter Simulation Conference, 2005, pp:1473-1482 [Conf] - Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
**Complexity of Cycle Length Modularity Problems in Graphs**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Holger Spakowski, Mayur Thakur, Rahul Tripathi
**Quantum and classical complexity classes: Separations, collapses, and closure properties.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2005, v:200, n:1, pp:1-34 [Journal] - Christopher M. Homan, Mayur Thakur
**One-way permutations and self-witnessing languages.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:3, pp:608-622 [Journal] - Lane A. Hemaspaandra, Mayur Thakur
**Lower bounds and the hardness of counting properties.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:326, n:1-3, pp:1-28 [Journal] - Ekaterina Smorodkina, Mayur Thakur, Daniel Tauritz
**Algorithms for the Balanced Edge Partitioning Problem.**[Citation Graph (0, 0)][DBLP] WEA, 2007, pp:311-323 [Conf] - Lane A. Hemaspaandra, Mayur Thakur
**Query-Monotonic Turing Reductions**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Lane A. Hemaspaandra, Mayur Thakur
**Query-monotonic Turing reductions.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:383, n:2-3, pp:153-186 [Journal] - Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur
**Predecessor existence problems for finite discrete dynamical systems.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:386, n:1-2, pp:3-37 [Journal] **Energy Constrained Dominating Set for Clustering in Wireless Sensor Networks.**[Citation Graph (, )][DBLP]**Preprocessing DNS Log Data for Effective Data Mining.**[Citation Graph (, )][DBLP]**A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses.**[Citation Graph (, )][DBLP]**Recursive Decomposition of Progress Graphs.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |