default search action
Mayur Thakur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [c18]Jiangzhuo Chen, V. S. Anil Kumar, Madhav V. Marathe, Ravi Sundaram, Mayur Thakur, Sunil Thulasidasan:
A study of the structure and vulnerabilities of metropolitan area networks. COMSNETS 2016: 1-8 - [c17]Bryan Perozzi, Michael Schueppert, Jack Saalweachter, Mayur Thakur:
When Recommendation Goes Wrong: Anomalous Link Discovery in Recommendation Networks. KDD 2016: 569-578 - 2014
- [j9]Sriram Chellappan, Mark E. Snyder, Mayur Thakur:
Distributed exploratory coverage with limited mobility. Int. J. Space Based Situated Comput. 4(2): 114-124 (2014) - 2013
- [j8]Julia Albath, Mayur Thakur, Sanjay Madria:
Energy constraint clustering algorithms for wireless sensor networks. Ad Hoc Networks 11(8): 2512-2525 (2013) - [c16]Zeinab Abbassi, Vahab S. Mirrokni, Mayur Thakur:
Diversity maximization under matroid constraints. KDD 2013: 32-40 - [c15]Mark E. Snyder, Sriram Chellappan, Mayur Thakur:
Exploratory Coverage in Limited Mobility Sensor Networks. NBiS 2013: 186-193 - 2012
- [c14]Ramanuja Simha
, Rahul Tripathi, Mayur Thakur:
Mining Associations Using Directed Hypergraphs. ICDE Workshops 2012: 190-197 - 2010
- [c13]Julia Albath, Mayur Thakur, Sanjay Madria:
Energy Constrained Dominating Set for Clustering in Wireless Sensor Networks. AINA 2010: 812-819
2000 – 2009
- 2009
- [j7]Mayur Thakur, Rahul Tripathi:
Linear connectivity problems in directed hypergraphs. Theor. Comput. Sci. 410(27-29): 2592-2618 (2009) - [c12]Mark E. Snyder, Ravi Sundaram, Mayur Thakur:
Preprocessing DNS Log Data for Effective Data Mining. ICC 2009: 1-5 - [c11]David A. Cape, Bruce M. McMillin
Recursive Decomposition of Progress Graphs. SSIRI 2009: 23-31 - 2008
- [j6]Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur:
Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37]. Theor. Comput. Sci. 395(1): 132-133 (2008) - 2007
- [j5]Lane A. Hemaspaandra
Query-monotonic Turing reductions. Theor. Comput. Sci. 383(2-3): 153-186 (2007) - [j4]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. Theor. Comput. Sci. 386(1-2): 3-37 (2007) - [c10]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. IJCAI 2007: 2268-2273 - [c9]Mark E. Snyder, Ravi Sundaram, Mayur Thakur:
A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses. LCN 2007: 556-566 - [c8]Ekaterina Smorodkina, Mayur Thakur, Daniel R. Tauritz:
Algorithms for the Balanced Edge Partitioning Problem. WEA 2007: 311-323 - 2006
- [i2]Lane A. Hemaspaandra, Mayur Thakur:
Query-Monotonic Turing Reductions. CoRR abs/cs/0602001 (2006) - 2005
- [j3]Holger Spakowski, Mayur Thakur, Rahul Tripathi:
Quantum and classical complexity classes: Separations, collapses, and closure properties. Inf. Comput. 200(1): 1-34 (2005) - [c7]Lane A. Hemaspaandra
Query-Monotonic Turing Reductions. COCOON 2005: 895-904 - [c6]Sreeram Ramakrishnan, Mayur Thakur:
An SDS modeling approach for simulation-based control. WSC 2005: 1473-1482 - 2004
- [j2]Lane A. Hemaspaandra
Lower bounds and the hardness of counting properties. Theor. Comput. Sci. 326(1-3): 1-28 (2004) - [c5]Mayur Thakur, Rahul Tripathi:
Complexity of Linear Connectivity Problems in Directed Hypergraphs. FSTTCS 2004: 481-493 - [c4]Edith Hemaspaandra, Holger Spakowski, Mayur Thakur:
Complexity of Cycle Length Modularity Problems in Graphs. LATIN 2004: 509-518 - 2003
- [j1]Christopher M. Homan, Mayur Thakur:
One-way permutations and self-witnessing languages. J. Comput. Syst. Sci. 67(3): 608-622 (2003) - [c3]Holger Spakowski, Mayur Thakur, Rahul Tripathi:
Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. FSTTCS 2003: 375-386 - [i1]Edith Hemaspaandra, Holger Spakowski, Mayur Thakur:
Complexity of Cycle Length Modularity Problems in Graphs. CoRR cs.CC/0306131 (2003) - 2002
- [c2]Lane A. Hemaspaandra
Lower Bounds and the Hardness of Counting Properties. IFIP TCS 2002: 217-229 - [c1]Christopher M. Homan, Mayur Thakur:
One-Way Permutations and Self-Witnessing Languages. IFIP TCS 2002: 243-254
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: