Coping with Known Patterns of Lies in a Search Game. - Bala Ravikumar; K. B. Lakshmanan (Theor. Comput. Sci., 1984)

On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers. - Oscar H. Ibarra; Bala Ravikumar (STACS, 1986)

On Pebble Automata. - Jik H. Chang; Oscar H. Ibarra; Michael A. Palis; Bala Ravikumar (Theor. Comput. Sci., 1986)

Strong nondeterministic reduction - a technique for proving intractability. - Moon-Jung Chung; Bala Ravikumar (SCT, 1987)

Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation. - Oscar H. Ibarra; Bala Ravikumar (FSTTCS, 1987)

On Selecting the Largest Element in Spite of Erroneous Information. - Bala Ravikumar; K. Ganesan 001; K. B. Lakshmanan (STACS, 1987)

Some Observations Concerning Alternating Turing Machines Using Small Space. - Jik H. Chang; Oscar H. Ibarra; Bala Ravikumar; Leonard Berman (Inf. Process. Lett., 1987)

On Some Languages in NC. - Oscar H. Ibarra; Tao Jiang 001; Bala Ravikumar; Jik H. Chang (AWOC, 1988)

Some Subclasses of Context-Free Languages In NC1. - Oscar H. Ibarra; Tao Jiang 001; Bala Ravikumar (Inf. Process. Lett., 1988)

Sublogarithmic-Space Turing Machines, Nonuniform Space Complexity, and Closure Properties. - Oscar H. Ibarra; Bala Ravikumar (Math. Syst. Theory, 1988)

Strong Nondeterministic Turing Reduction - A Technique for Proving Intractability. - Moon-Jung Chung; Bala Ravikumar (J. Comput. Syst. Sci., 1989)

Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation. - Bala Ravikumar; Oscar H. Ibarra (SIAM J. Comput., 1989)

Bounds on the size of test sets for sorting and related networks. - Moon-Jung Chung; Bala Ravikumar (Discret. Math., 1990)

The Structure and Complexity of Minimal NFA's over a Unary Alphabet. - Tao Jiang 001; Edward McDowell; Bala Ravikumar (Int. J. Found. Comput. Sci., 1991)

A Note on the Space Complexity of Some Decision Problems for Finite Automata. - Tao Jiang 001; Bala Ravikumar (Inf. Process. Lett., 1991)

Coping with Erroneous Information while Sorting. - K. B. Lakshmanan; Bala Ravikumar; K. Ganesan 001 (IEEE Trans. Computers, 1991)

Some Classes of Languages in NC¹ - Oscar H. Ibarra; Tao Jiang 001; Jik H. Chang; Bala Ravikumar (Inf. Comput., 1991)

Some Observations on 2-way Probabilistic Finite Automata. - Bala Ravikumar (FSTTCS, 1992)

Minimal NFA Problems are Hard. - Tao Jiang 001; Bala Ravikumar (SIAM J. Comput., 1993)

Randomized Parallel Algorithms for the Homing Sequence Problem. - Bala Ravikumar; X. Xiong (ICPP, Vol. 2, 1996)

A Parallel Algorithm for Minimization of Finite Automata. - Bala Ravikumar; X. Xiong (IPPS, 1996)

Implementing Sequential and Parallel Programs for the Homing Sequence Problem. - Bala Ravikumar; X. Xiong (Workshop on Implementing Automata, 1996)

Formal Models and Computability. - Tao Jiang 001; Ming Li 001; Bala Ravikumar (The Computer Science and Engineering Handbook, 1997)

Parallel Algorithms for Finite Automata Problems. - Bala Ravikumar (IPPS/SPDP Workshops, 1998)

A Simplified NP-Complete MAXSAT Problem. - Venkatesh Raman 001; Bala Ravikumar; S. Srinivasa Rao 001 (Inf. Process. Lett., 1998)

Basic Notions in Computational Complexity. - Tao Jiang 001; Ming Li 001; Bala Ravikumar (Algorithms and Theory of Computation Handbook, 1999)

Computability. - Tao Jiang 001; Ming Li 001; Bala Ravikumar; Kenneth W. Regan (Algorithms and Theory of Computation Handbook, 1999)

Formal Grammars and Languages. - Tao Jiang 001; Ming Li 001; Bala Ravikumar; Kenneth W. Regan (Algorithms and Theory of Computation Handbook, 1999)

A Fault-Tolerant Merge Sorting Algorithm. - Bala Ravikumar (COCOON, 2002)

Weak Minimization of DFA - An Algorithm and Applications. - Bala Ravikumar (CIAA, 2003)

Peg-solitaire, string rewriting systems and finite automata. - Bala Ravikumar (Theor. Comput. Sci., 2004)

Weak minimization of DFA - an algorithm and applications. - Bala Ravikumar; Gerry Eisman (Theor. Comput. Sci., 2004)

Online and Minimum-Cost Ad Hoc Delegation in e-Service Composition. - Cagdas Evren Gerede; Oscar H. Ibarra; Bala Ravikumar; Jianwen Su (IEEE SCC, 2005)

Approximate Recognition of Non-regular Languages by Finite Automata. - Gerry Eisman; Bala Ravikumar (ACSC, 2005)

Fibonacci Search Algorithm for Finding Extremum Using Unary Predicates. - Bala Ravikumar; Greg Cooper (FCS, 2005)

Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach. - Oscar H. Ibarra; Bala Ravikumar; Cagdas Evren Gerede (J. Autom. Lang. Comb., 2006)

On partially blind multihead finite automata. - Oscar H. Ibarra; Bala Ravikumar (Theor. Comput. Sci., 2006)

Deterministic Simulation of a NFA with k -Symbol Lookahead. - Bala Ravikumar; Nicolae Santean (SOFSEM (1), 2007)

On the Existence of Lookahead Delegators for NFA. - Bala Ravikumar; Nicolae Santean (Int. J. Found. Comput. Sci., 2007)

On some variations of two-way probabilistic finite automata models. - Bala Ravikumar (Theor. Comput. Sci., 2007)

The Benford-Newcomb Distribution and Unambiguous Context-Free Languages. - Bala Ravikumar (Int. J. Found. Comput. Sci., 2008)

Minimum-cost delegation in service composition. - Cagdas Evren Gerede; Oscar H. Ibarra; Bala Ravikumar; Jianwen Su (Theor. Comput. Sci., 2008)

Preface. - Oscar H. Ibarra; Bala Ravikumar (Int. J. Found. Comput. Sci., 2009)

Decimations of languages and state complexity. - Dalia Krieger; Avery Miller; Narad Rampersad; Bala Ravikumar; Jeffrey O. Shallit (Theor. Comput. Sci., 2009)

State complexity of unique rational operations. - Narad Rampersad; Nicolae Santean; Jeffrey O. Shallit; Bala Ravikumar (Theor. Comput. Sci., 2009)

On Approximating Non-regular Languages by Regular Languages. - Gerry Eisman; Bala Ravikumar (Fundam. Informaticae, 2011)

Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages. - Oscar H. Ibarra; Bala Ravikumar (CIAA, 2013)

Formal Models and Computability. - Tao Jiang 001; Ming Li 001; Bala Ravikumar (Computing Handbook, 3rd ed. (1), 2014)

On the Parikh Membership Problem for FAs, PDAs, and CMs. - Oscar H. Ibarra; Bala Ravikumar (LATA, 2014)

An Improved Upper-Bound for Rivest et al.'s Half-Lie Problem. - Bala Ravikumar; Duncan Innes (TAMC, 2014)

Some Decision Questions Concerning the Time Complexity of Language Acceptors. - Oscar H. Ibarra; Bala Ravikumar (Int. J. Found. Comput. Sci., 2014)

On bounded languages and reversal-bounded automata. - Oscar H. Ibarra; Bala Ravikumar (Inf. Comput., 2016)

On Counting Functions of Languages. - Oscar H. Ibarra; Ian McQuillan; Bala Ravikumar (DLT, 2018)

On counting functions and slenderness of languages. - Oscar H. Ibarra; Ian McQuillan; Bala Ravikumar (Theor. Comput. Sci., 2019)