Venkatesh Radhakrishnan

According to our database1, Venkatesh Radhakrishnan authored at least 20 papers between 1992 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Heuristic and Cost-Based Optimization for Diverse Provenance Tasks.
IEEE Trans. Knowl. Data Eng., 2019

2018
Using Reenactment to Retroactively Capture Provenance for Transactions.
IEEE Trans. Knowl. Data Eng., 2018

2017
Provenance-Aware Query Optimization.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

2016
Reenactment for Read-Committed Snapshot Isolation.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2015
Interoperability for Provenance-aware Databases using PROV and JSON.
Proceedings of the 7th USENIX Workshop on the Theory and Practice of Provenance, 2015

2014
A Generic Provenance Middleware for Queries, Updates, and Transactions.
Proceedings of the 6th Workshop on the Theory and Practice of Provenance, 2014

2011
Fine Grain Provenance Using Temporal Databases.
Proceedings of the 3rd Workshop on the Theory and Practice of Provenance, 2011

2002
Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems.
Inf. Comput., 2002

1998
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems.
SIAM J. Comput., 1998

The Complexity of Planar Counting Problems.
SIAM J. Comput., 1998

NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs.
J. Algorithms, 1998

1997
Hierarchically Specified Unit Disk Graphs.
Theor. Comput. Sci., 1997

Compact Location Problems.
Theor. Comput. Sci., 1997

1996
Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996

1994
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Approximation Schemes Using L-Reductions.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs.
Proceedings of the Algorithms, 1994

1993
Hierarchical Specified Unit Disk Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Compact Location Problems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1992
Efficient Algorithms for Solving Systems of Linear Equations and Path Problems.
Proceedings of the STACS 92, 1992


  Loading...