Bala Ravikumar

According to our database, Bala Ravikumar authored at least 54 papers between 1984 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2019

On counting functions and slenderness of languages.

Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar

Theor. Comput. Sci., 2019

2018

On Counting Functions of Languages.

Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2014

An Improved Upper-Bound for Rivest et al.'s Half-Lie Problem.

Bala Ravikumar, Duncan Innes

Proceedings of the Theory and Applications of Models of Computation, 2014

On the Parikh Membership Problem for FAs, PDAs, and CMs.

Oscar H. Ibarra, Bala Ravikumar

Proceedings of the Language and Automata Theory and Applications, 2014

Formal Models and Computability.

Tao Jiang, Ming Li, Bala Ravikumar

Proceedings of the Computing Handbook, 2014

2013

Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages.

Oscar H. Ibarra, Bala Ravikumar

Proceedings of the Implementation and Application of Automata, 2013

On Bounded Languages and Reversal-Bounded Automata.

Oscar H. Ibarra, Bala Ravikumar

Proceedings of the Language and Automata Theory and Applications, 2013

Some Decision Questions Concerning the Time Complexity of Language Acceptors.

Oscar H. Ibarra, Bala Ravikumar

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2011

On Approximating Non-regular Languages by Regular Languages.

Gerry Eisman, Bala Ravikumar

Fundam. Informaticae, 2011

2009

State complexity of unique rational operations.

Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit, Bala Ravikumar

Theor. Comput. Sci., 2009

Decimations of languages and state complexity.

Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey O. Shallit

Theor. Comput. Sci., 2009

Preface.

Oscar H. Ibarra, Bala Ravikumar

Int. J. Found. Comput. Sci., 2009

2008

Minimum-cost delegation in service composition.

Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su

Theor. Comput. Sci., 2008

The Benford-Newcomb Distribution and Unambiguous Context-Free Languages.

Bala Ravikumar

Int. J. Found. Comput. Sci., 2008

2007

On the Existence of Lookahead Delegators for NFA.

Bala Ravikumar, Nicolae Santean

Int. J. Found. Comput. Sci., 2007

Deterministic Simulation of a NFA with <i>k</i> -Symbol Lookahead.

Bala Ravikumar, Nicolae Santean

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006

On partially blind multihead finite automata.

Oscar H. Ibarra, Bala Ravikumar

Theor. Comput. Sci., 2006

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 Some Variations of Two-Way Probabilistic Finite Automata Models.

Bala Ravikumar

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

Fibonacci Search Algorithm for Finding Extremum Using Unary Predicates.

Bala Ravikumar, Greg Cooper

Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005

Approximate Recognition of Non-regular Languages by Finite Automata.

Gerry Eisman, Bala Ravikumar

Proceedings of the Computer Science 2005, 2005

Online and Minimum-Cost Ad Hoc Delegation in e-Service Composition.

Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su

Proceedings of the 2005 IEEE International Conference on Services Computing (SCC 2005), 2005

2004

Weak minimization of DFA - an algorithm and applications.

Bala Ravikumar, Gerry Eisman

Theor. Comput. Sci., 2004

2003

Weak Minimization of DFA - An Algorithm and Applications.

Bala Ravikumar

Proceedings of the Implementation and Application of Automata, 2003

2002

A Fault-Tolerant Merge Sorting Algorithm.

Bala Ravikumar

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

1999

Formal Grammars and Languages.

Tao Jiang, Ming Li, Bala Ravikumar, Kenneth W. Regan

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

Computability.

Tao Jiang, Ming Li, Bala Ravikumar, Kenneth W. Regan

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

Basic Notions in Computational Complexity.

Tao Jiang, Ming Li, Bala Ravikumar

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

A Simplified NP-Complete MAXSAT Problem.

Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao

Inf. Process. Lett., 1998

Parallel Algorithms for Finite Automata Problems.

Bala Ravikumar

Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

1997

Peg-Solitaire, String Rewriting Systems and Finite Automata.

Bala Ravikumar

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Formal Models and Computability.

Tao Jiang, Ming Li, Bala Ravikumar

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

Implementing Sequential and Parallel Programs for the Homing Sequence Problem.

Bala Ravikumar, X. Xiong

Proceedings of the Automata Implementation, 1996

A Parallel Algorithm for Minimization of Finite Automata.

Bala Ravikumar, X. Xiong

Proceedings of IPPS '96, 1996

Randomized Parallel Algorithms for the Homing Sequence Problem.

Bala Ravikumar, X. Xiong

Proceedings of the 1996 International Conference on Parallel Processing, 1996

1992

Some Observations on 2-way Probabilistic Finite Automata.

Bala Ravikumar

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1991

Some Classes of Languages in NC¹

Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Bala Ravikumar

Inf. Comput., January, 1991

Coping with Erroneous Information while Sorting.

K. B. Lakshmanan, Bala Ravikumar, K. Ganesan

IEEE Trans. Computers, 1991

A Note on the Space Complexity of Some Decision Problems for Finite Automata.

Tao Jiang, Bala Ravikumar

Inf. Process. Lett., 1991

Minimal NFA Problems Are Hard.

Tao Jiang, Bala Ravikumar

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

The Structure and Complexity of Minimal NFA's over a Unary Alphabet.

Tao Jiang, Edward McDowell, Bala Ravikumar

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1989

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

Bala Ravikumar, Oscar H. Ibarra

SIAM J. Comput., 1989

Strong Nondeterministic Turing Reduction - A Technique for Proving Intractability.

Moon-Jung Chung, Bala Ravikumar

J. Comput. Syst. Sci., 1989

1988

Sublogarithmic-Space Turing Machines, Nonuniform Space Complexity, and Closure Properties.

Oscar H. Ibarra, Bala Ravikumar

Math. Syst. Theory, 1988

Some Subclasses of Context-Free Languages In NC1.

Oscar H. Ibarra, Tao Jiang, Bala Ravikumar

Inf. Process. Lett., 1988

On Some Languages in NC.

Oscar H. Ibarra, Tao Jiang, Bala Ravikumar, Jik H. Chang

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

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 Selecting the Largest Element in Spite of Erroneous Information.

Bala Ravikumar, K. Ganesan, K. B. Lakshmanan

Proceedings of the STACS 87, 1987

Bounds on the Size of Test Sets for Sorting and Related Networks.

Moon-Jung Chung, Bala Ravikumar

Proceedings of the International Conference on Parallel Processing, 1987

Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation.

Oscar H. Ibarra, Bala Ravikumar

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

Strong nondeterministic reduction - a technique for proving intractability.

Moon-Jung Chung, Bala Ravikumar

Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986

On Pebble Automata.

Jik H. Chang, Oscar H. Ibarra, Michael A. Palis, Bala Ravikumar

Theor. Comput. Sci., 1986

On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers.

Oscar H. Ibarra, Bala Ravikumar

Proceedings of the STACS 86, 1986

1984

Coping with Known Patterns of Lies in a Search Game.

Bala Ravikumar, K. B. Lakshmanan

Theor. Comput. Sci., 1984