default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVenkatesh Radhakrishnan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j8]Xing Niu
, Raghav Kapoor, Boris Glavic, Dieter Gawlick, Zhen Hua Liu, Vasudha Krishnaswamy, Venkatesh Radhakrishnan:
Heuristic and Cost-Based Optimization for Diverse Provenance Tasks. IEEE Trans. Knowl. Data Eng. 31(7): 1267-1280 (2019)- 2018
- [j7]Bahareh Sadat Arab, Dieter Gawlick, Vasudha Krishnaswamy, Venkatesh Radhakrishnan, Boris Glavic:
Using Reenactment to Retroactively Capture Provenance for Transactions. IEEE Trans. Knowl. Data Eng. 30(3): 599-612 (2018) - [i4]Xing Niu, Raghav Kapoor, Boris Glavic, Dieter Gawlick, Zhen Hua Liu, Vasudha Krishnaswamy, Venkatesh Radhakrishnan:
Heuristic and Cost-based Optimization for Diverse Provenance Tasks. CoRR abs/1804.07156 (2018) - 2017
- [c12]Xing Niu, Raghav Kapoor, Boris Glavic, Dieter Gawlick, Zhen Hua Liu, Venkatesh Radhakrishnan:
Provenance-Aware Query Optimization. ICDE 2017: 473-484 - 2016
- [c11]Bahareh Sadat Arab, Dieter Gawlick, Vasudha Krishnaswamy, Venkatesh Radhakrishnan, Boris Glavic:
Reenactment for Read-Committed Snapshot Isolation. CIKM 2016: 841-850 - [i3]Bahareh Arab, Dieter Gawlick, Vasudha Krishnaswamy, Venkatesh Radhakrishnan, Boris Glavic:
Reenactment for Read-Committed Snapshot Isolation. CoRR abs/1608.08258 (2016) - 2015
- [c10]Xing Niu, Boris Glavic, Dieter Gawlick, Zhen Hua Liu, Vasudha Krishnaswamy, Venkatesh Radhakrishnan:
Interoperability for Provenance-aware Databases using PROV and JSON. TaPP 2015 - 2014
- [c9]Bahareh Arab, Dieter Gawlick, Venkatesh Radhakrishnan, Hao Guo, Boris Glavic:
A Generic Provenance Middleware for Queries, Updates, and Transactions. TAPP 2014 - 2011
- [c8]Dieter Gawlick, Venkatesh Radhakrishnan:
Fine Grain Provenance Using Temporal Databases. TaPP 2011
2000 – 2009
- 2002
- [j6]Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems. Inf. Comput. 173(1): 40-63 (2002)
1990 – 1999
- 1998
- [j5]Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. J. Algorithms 26(2): 238-274 (1998) - [j4]Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns:
The Complexity of Planar Counting Problems. SIAM J. Comput. 27(4): 1142-1167 (1998) - [j3]Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan:
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. SIAM J. Comput. 27(5): 1237-1261 (1998) - [i2]Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns:
The Complexity of Planar Counting Problems. CoRR cs.CC/9809017 (1998) - [i1]Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan:
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. CoRR cs.CC/9809064 (1998) - 1997
- [j2]Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi:
Hierarchically Specified Unit Disk Graphs. Theor. Comput. Sci. 174(1-2): 23-65 (1997) - [j1]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz:
Compact Location Problems. Theor. Comput. Sci. 181(2): 379-404 (1997) - 1996
- [c7]Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan:
Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results. Satisfiability Problem: Theory and Applications 1996: 225-259 - 1994
- [c6]Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. ESA 1994: 424-435 - [c5]Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Approximation Schemes Using L-Reductions. FSTTCS 1994: 342-353 - [c4]Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan:
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). STOC 1994: 468-477 - 1993
- [c3]Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
Compact Location Problems. FSTTCS 1993: 238-247 - [c2]Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi:
Hierarchical Specified Unit Disk Graphs (Extended Abstract). WG 1993: 21-32 - 1992
- [c1]Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns:
Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. STACS 1992: 109-119
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 2025-01-09 12:52 CET 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:
