| 2018 | DLT | On Counting Functions of Languages. | Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar |
| 2014 | LATA | On the Parikh Membership Problem for FAs, PDAs, and CMs. | Oscar H. Ibarra, Bala Ravikumar |
| 2014 | TAMC | An Improved Upper-Bound for Rivest et al.'s Half-Lie Problem. | Bala Ravikumar, Duncan Innes |
| 2013 | DLT | Some Decision Questions Concerning the Time Complexity of Language Acceptors. | Oscar H. Ibarra, Bala Ravikumar |
| 2013 | LATA | On Bounded Languages and Reversal-Bounded Automata. | Oscar H. Ibarra, Bala Ravikumar |
| 2007 | SOFSEM | Deterministic Simulation of a NFA with | Bala Ravikumar, Nicolae Santean |
| 2006 | DLT | On Some Variations of Two-Way Probabilistic Finite Automata Models. | Bala Ravikumar |
| 2002 | COCOON | A Fault-Tolerant Merge Sorting Algorithm. | Bala Ravikumar |
| 1997 | ISAAC | Peg-Solitaire, String Rewriting Systems and Finite Automata. | Bala Ravikumar |
| 1996 | ICPP | Randomized Parallel Algorithms for the Homing Sequence Problem. | Bala Ravikumar, X. Xiong |
| 1991 | ICALP | Minimal NFA Problems Are Hard. | Tao Jiang, Bala Ravikumar |
| 1987 | ICPP | Bounds on the Size of Test Sets for Sorting and Related Networks. | Moon-Jung Chung, Bala Ravikumar |
| 1987 | STACS | On Selecting the Largest Element in Spite of Erroneous Information. | Bala Ravikumar, K. Ganesan, K. B. Lakshmanan |
| 1986 | STACS | On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers. | Oscar H. Ibarra, Bala Ravikumar |