Bala Ravikumar

Publication Activity (10 Years)

Years Active: 1984-2019
Publications (10 Years): 4

Top Topics

Natural Language Queries

Decision Problems

Cellular Phones

Top Venues

Developments in Language Theory

Publications

Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar
On counting functions and slenderness of languages. CoRR (2019)
Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar
On counting functions and slenderness of languages. Theor. Comput. Sci. 777 (2019)
Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar
On Counting Functions of Languages. DLT (2018)
Oscar H. Ibarra, Bala Ravikumar
On bounded languages and reversal-bounded automata. Inf. Comput. 246 (2016)
Bala Ravikumar, Duncan Innes
An Improved Upper-Bound for Rivest et al.'s Half-Lie Problem. TAMC (2014)
Oscar H. Ibarra, Bala Ravikumar
On the Parikh Membership Problem for FAs, PDAs, and CMs. LATA (2014)
Oscar H. Ibarra, Bala Ravikumar
Some Decision Questions Concerning the Time Complexity of Language Acceptors. Int. J. Found. Comput. Sci. 25 (8) (2014)
Oscar H. Ibarra, Bala Ravikumar
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages. CIAA (2013)
Oscar H. Ibarra, Bala Ravikumar
Some Decision Questions Concerning the Time Complexity of Language Acceptors. Developments in Language Theory (2013)
Oscar H. Ibarra, Bala Ravikumar
On Bounded Languages and Reversal-Bounded Automata. LATA (2013)
Gerry Eisman, Bala Ravikumar
On Approximating Non-regular Languages by Regular Languages. Fundam. Informaticae 110 (1-4) (2011)
Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey O. Shallit
Decimations of languages and state complexity. Theor. Comput. Sci. 410 (24-25) (2009)
Oscar H. Ibarra, Bala Ravikumar
Preface. Int. J. Found. Comput. Sci. 20 (4) (2009)
Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit, Bala Ravikumar
State complexity of unique rational operations. Theor. Comput. Sci. 410 (24-25) (2009)
Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su
Minimum-cost delegation in service composition. Theor. Comput. Sci. 409 (3) (2008)
Bala Ravikumar
The Benford-Newcomb Distribution and Unambiguous Context-Free Languages. Int. J. Found. Comput. Sci. 19 (3) (2008)
Bala Ravikumar, Nicolae Santean
On the Existence of Lookahead Delegators for NFA. Int. J. Found. Comput. Sci. 18 (5) (2007)
Bala Ravikumar, Nicolae Santean
-Symbol Lookahead. SOFSEM (1) (2007)
Bala Ravikumar
On some variations of two-way probabilistic finite automata models. Theor. Comput. Sci. 376 (1-2) (2007)
Oscar H. Ibarra, Bala Ravikumar, Cagdas Evren Gerede
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach. J. Autom. Lang. Comb. 11 (2) (2006)
Bala Ravikumar
On Some Variations of Two-Way Probabilistic Finite Automata Models. Developments in Language Theory (2006)
Oscar H. Ibarra, Bala Ravikumar
On partially blind multihead finite automata. Theor. Comput. Sci. 356 (1-2) (2006)
Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su
Online and Minimum-Cost Ad Hoc Delegation in e-Service Composition. IEEE SCC (2005)
Bala Ravikumar, Greg Cooper
Fibonacci Search Algorithm for Finding Extremum Using Unary Predicates. FCS (2005)
Gerry Eisman, Bala Ravikumar
Approximate Recognition of Non-regular Languages by Finite Automata. ACSC (2005)
Bala Ravikumar
Peg-solitaire, string rewriting systems and finite automata. Theor. Comput. Sci. 321 (2-3) (2004)
Bala Ravikumar, Gerry Eisman
Weak minimization of DFA - an algorithm and applications. Theor. Comput. Sci. 328 (1-2) (2004)
Bala Ravikumar
Weak Minimization of DFA - An Algorithm and Applications. CIAA (2003)
Bala Ravikumar
A Fault-Tolerant Merge Sorting Algorithm. COCOON (2002)
Bala Ravikumar
Parallel Algorithms for Finite Automata Problems. IPPS/SPDP Workshops (1998)
Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao
A Simplified NP-Complete MAXSAT Problem. Inf. Process. Lett. 65 (1) (1998)
Bala Ravikumar
Peg-Solitaire, String Rewriting Systems and Finite Automata. ISAAC (1997)
Bala Ravikumar, X. Xiong
Randomized Parallel Algorithms for the Homing Sequence Problem. ICPP, Vol. 2 (1996)
Bala Ravikumar, X. Xiong
A Parallel Algorithm for Minimization of Finite Automata. IPPS (1996)
Bala Ravikumar, X. Xiong
Implementing Sequential and Parallel Programs for the Homing Sequence Problem. Workshop on Implementing Automata (1996)
Tao Jiang, Bala Ravikumar
Minimal NFA Problems are Hard. SIAM J. Comput. 22 (6) (1993)
Bala Ravikumar
Some Observations on 2-way Probabilistic Finite Automata. FSTTCS (1992)
Tao Jiang, Edward McDowell, Bala Ravikumar
The Structure and Complexity of Minimal NFA's over a Unary Alphabet. Int. J. Found. Comput. Sci. 2 (2) (1991)
Tao Jiang, Edward McDowell, Bala Ravikumar
The Structure and Complexity of Minimal NFA's over a Unary Alphabet. FSTTCS (1991)
K. B. Lakshmanan, Bala Ravikumar, K. Ganesan
Coping with Erroneous Information while Sorting. IEEE Trans. Computers 40 (9) (1991)
Tao Jiang, Bala Ravikumar
Minimal NFA Problems Are Hard. ICALP (1991)
Tao Jiang, Bala Ravikumar
A Note on the Space Complexity of Some Decision Problems for Finite Automata. Inf. Process. Lett. 40 (1) (1991)
Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Bala Ravikumar
Some Classes of Languages in NC¹ Inf. Comput. 90 (1) (1991)
Moon-Jung Chung, Bala Ravikumar
Bounds on the size of test sets for sorting and related networks. Discret. Math. 81 (1) (1990)
Bala Ravikumar, Oscar H. Ibarra
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation. SIAM J. Comput. 18 (6) (1989)
Moon-Jung Chung, Bala Ravikumar
Strong Nondeterministic Turing Reduction - A Technique for Proving Intractability. J. Comput. Syst. Sci. 39 (1) (1989)
Oscar H. Ibarra, Bala Ravikumar
Sublogarithmic-Space Turing Machines, Nonuniform Space Complexity, and Closure Properties. Math. Syst. Theory 21 (1) (1988)
Oscar H. Ibarra, Tao Jiang, Bala Ravikumar, Jik H. Chang
On Some Languages in NC. AWOC (1988)
Oscar H. Ibarra, Tao Jiang, Bala Ravikumar
Some Subclasses of Context-Free Languages In NC1. Inf. Process. Lett. 29 (3) (1988)
Jik H. Chang, Oscar H. Ibarra, Bala Ravikumar, Leonard Berman
Some Observations Concerning Alternating Turing Machines Using Small Space. Inf. Process. Lett. 25 (1) (1987)
Oscar H. Ibarra, Bala Ravikumar
Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation. FSTTCS (1987)
Moon-Jung Chung, Bala Ravikumar
Bounds on the Size of Test Sets for Sorting and Related Networks. ICPP (1987)
Moon-Jung Chung, Bala Ravikumar
Strong nondeterministic reduction - a technique for proving intractability. Computational Complexity Conference (1987)
Bala Ravikumar, K. Ganesan, K. B. Lakshmanan
On Selecting the Largest Element in Spite of Erroneous Information. STACS (1987)
Oscar H. Ibarra, Bala Ravikumar
On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers. STACS (1986)
Jik H. Chang, Oscar H. Ibarra, Michael A. Palis, Bala Ravikumar
On Pebble Automata. Theor. Comput. Sci. 44 (1986)
Bala Ravikumar, K. B. Lakshmanan
Coping with Known Patterns of Lies in a Search Game. Theor. Comput. Sci. 33 (1984)