Concepedia

Bala Ravikumar

BR

Statistics

Publications

18

Citations

777

H-Index

14

Active since

1984

Affiliations

University of Rhode Island(Current)

University of Minnesota

Sonoma State University

McMaster University

University of California, Santa Barbara

Bala Ravikumar is an author at University of Rhode Island specializing in computer science, engineering, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityFormal MethodsFormal VerificationDiscrete MathematicsAutomated ReasoningLinguisticsArtsSystems Engineering

Publications per year

1984–2009

18

Publications

18

Minimal NFA Problems are Hard

Tao Jiang, Bala Ravikumar · SIAM Journal on Computing · 1993 · 248 citations

Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation

Bala Ravikumar, Óscar H. Ibarra · SIAM Journal on Computing · 1989 · 79 citations

A note on the space complexity of some decision problems for finite automata

Tao Jiang, Bala Ravikumar · Information Processing Letters · 1991 · 71 citations

Decision Problems, Engineering, Space Complexity +10

A simplified NP-complete MAXSAT problem

Venkatesh Raman, Bala Ravikumar, Srinivasa Rao Satti · Information Processing Letters · 1998 · 61 citations

Engineering, Sat Solving, Computational Complexity +4

THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET

Tao Jiang, Edward D. McDowell, Bala Ravikumar · International Journal of Foundations of Computer Science · 1991 · 50 citations

A Unary Alphabet, Normal Forms, Computational Complexity Theory +14

1–5 of 18