Bala Ravikumar

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