Concepedia

Venkatesh Raman

VR

59

Publications

4.5K

Citations

35

H-Index

1990

Active since

Affiliations

Institute of Mathematical Sciences(Current)

University of Waterloo

University of Bergen

University of Leicester

University of California San Diego

Venkatesh Raman is an author at Institute of Mathematical Sciences specializing in engineering, computer science, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityCombinatorial OptimizationDiscrete MathematicsGraph TheoryMathematical ProgrammingComputational GeometryData ScienceApproximation Theory

Publications per year

1990–2019

59

Publications

59

Succinct indexable dictionaries with applications to encoding k-ary trees and multisets

Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti · Symposium on Discrete Algorithms · 2002 · 397 citations

Computational Complexity Theory, Engineering, Computational Complexity +20

Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets

Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti · ACM Transactions on Algorithms · 2007 · 372 citations · Full text

Engineering, Computational Complexity, Data Structure +17

Succinct Representation of Balanced Parentheses and Static Trees

J. Ian Munro, Venkatesh Raman · SIAM Journal on Computing · 2001 · 328 citations

Succinct Representation, Binary Trees, Engineering +16

Parameterizing above Guaranteed Values: MaxSat and MaxCut

Meena Mahajan, Venkatesh Raman · Journal of Algorithms · 1999 · 308 citations

Mathematical Programming, Parametric Programming, Parameterized Algorithm +2

Representing Trees of Higher Degree

David Benoit, Erik D. Demaine, J. Ian Munro et al. · Algorithmica · 2005 · 232 citations · Full text

Tree Language, Higher Degree, Graph Theory +5

Rows per page

1–5 of 59