Bala Ravikumar - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 60 from 60

2019

On counting functions and slenderness of languagesOscar H. Ibarra, Ian McQuillan, Bala Ravikumar. TCS, 777:356-378, 2019. [doi]

2018

On Counting Functions of LanguagesOscar H. Ibarra, Ian McQuillan, Bala Ravikumar. dlt 2018: 429-440 [doi]

2016

On bounded languages and reversal-bounded automataOscar H. Ibarra, Bala Ravikumar. iandc, 246:30-42, 2016. [doi]

2014

2013

Some Decision Problems Concerning NPDAs, Palindromes, and Dyck LanguagesOscar H. Ibarra, Bala Ravikumar. wia 2013: 193-207 [doi]

On Bounded Languages and Reversal-Bounded AutomataOscar H. Ibarra, Bala Ravikumar. LATA 2013: 359-370 [doi]

Some Decision Questions Concerning the Time Complexity of Language AcceptorsOscar H. Ibarra, Bala Ravikumar. dlt 2013: 264-276 [doi]

2011

On Approximating Non-regular Languages by Regular LanguagesGerry Eisman, Bala Ravikumar. FUIN, 110(1-4):125-142, 2011. [doi]

2009

PrefaceOscar H. Ibarra, Bala Ravikumar. ijfcs, 20(4):559-561, 2009. [doi]

Decimations of languages and state complexityDalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey Shallit. TCS, 410(24-25):2401-2409, 2009. [doi]

State complexity of unique rational operationsNarad Rampersad, Nicolae Santean, Jeffrey Shallit, Bala Ravikumar. TCS, 410(24-25):2431-2441, 2009. [doi]

2008

Minimum-cost delegation in service compositionCagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su. TCS, 409(3):417-431, 2008. [doi]

The Benford-Newcomb Distribution and Unambiguous Context-Free LanguagesBala Ravikumar. ijfcs, 19(3):717-727, 2008. [doi]

2007

Deterministic Simulation of a NFA with ::::k:::: -Symbol LookaheadBala Ravikumar, Nicolae Santean. sofsem 2007: 488-497 [doi]

On the Existence of Lookahead Delegators for NFABala Ravikumar, Nicolae Santean. ijfcs, 18(5):949-973, 2007. [doi]

On some variations of two-way probabilistic finite automata modelsBala Ravikumar. TCS, 376(1-2):127-136, 2007. [doi]

2006

Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic ApproachOscar H. Ibarra, Bala Ravikumar, Cagdas Evren Gerede. jalc, 11(2):169-188, 2006.

On partially blind multihead finite automataOscar H. Ibarra, Bala Ravikumar. TCS, 356(1-2):190-199, 2006. [doi]

On Some Variations of Two-Way Probabilistic Finite Automata ModelsBala Ravikumar. dlt 2006: 443-454 [doi]

2005

Approximate Recognition of Non-regular Languages by Finite AutomataGerry Eisman, Bala Ravikumar. acsc 2005: 219-228 [doi]

Online and Minimum-Cost Ad Hoc Delegation in e-Service CompositionCagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su. IEEEscc 2005: 103-112 [doi]

Fibonacci Search Algorithm for Finding Extremum Using Unary PredicatesBala Ravikumar, Greg Cooper. fcs 2005: 59-63

2004

Weak minimization of DFA - an algorithm and applicationsBala Ravikumar, Gerry Eisman. TCS, 328(1-2):113-133, 2004. [doi]

Peg-solitaire, string rewriting systems and finite automataBala Ravikumar. TCS, 321(2-3):383-394, 2004. [doi]

2003

Weak Minimization of DFA - An Algorithm and ApplicationsBala Ravikumar. wia 2003: 226-238 [doi]

2002

A Fault-Tolerant Merge Sorting AlgorithmBala Ravikumar. cocoon 2002: 440-447 [doi]

1999

Formal Grammars and LanguagesTao Jiang 0001, Ming Li 0001, Bala Ravikumar, Kenneth W. Regan. In Mikhail J. Atallah, editor, Algorithms and Theory of Computation Handbook. Chapman & Hall/CRC Applied Algorithms and Data Structures series, CRC Press, 1999. [doi]

Basic Notions in Computational ComplexityTao Jiang 0001, Ming Li 0001, Bala Ravikumar. In Mikhail J. Atallah, editor, Algorithms and Theory of Computation Handbook. Chapman & Hall/CRC Applied Algorithms and Data Structures series, CRC Press, 1999. [doi]

ComputabilityTao Jiang 0001, Ming Li 0001, Bala Ravikumar, Kenneth W. Regan. In Mikhail J. Atallah, editor, Algorithms and Theory of Computation Handbook. Chapman & Hall/CRC Applied Algorithms and Data Structures series, CRC Press, 1999. [doi]

1998

A Simplified NP-Complete MAXSAT ProblemVenkatesh Raman, Bala Ravikumar, S. Srinivasa Rao. ipl, 65(1):1-6, 1998. [doi]

Parallel Algorithms for Finite Automata ProblemsBala Ravikumar. ipps 1998: 373

1997

Formal Models and ComputabilityTao Jiang, Ming Li, Bala Ravikumar. In Allen B. Tucker, editor, The Computer Science and Engineering Handbook. pages 31-63, CRC Press, 1997.

Peg-Solitaire, String Rewriting Systems and Finite AutomataBala Ravikumar. isaac 1997: 233-242

1996

A Parallel Algorithm for Minimization of Finite AutomataBala Ravikumar, X. Xiong. ipps 1996: 187-191 [doi]

Randomized Parallel Algorithms for the Homing Sequence ProblemBala Ravikumar, X. Xiong. icpp 1996: 82-89

Implementing Sequential and Parallel Programs for the Homing Sequence ProblemBala Ravikumar, X. Xiong. wia 1997: 120-131

1993

Minimal NFA Problems are HardTao Jiang, Bala Ravikumar. SICOMP, 22(6):1117-1141, 1993.

1992

Some Observations on 2-way Probabilistic Finite AutomataBala Ravikumar. fsttcs 1992: 392-403

1991

Some Classes of Languages in NC¹Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Bala Ravikumar. iandc, 90(1):86-106, January 1991.

A Note on the Space Complexity of Some Decision Problems for Finite AutomataTao Jiang, Bala Ravikumar. ipl, 40(1):25-31, 1991.

The Structure and Complexity of Minimal NFA s over a Unary AlphabetTao Jiang, Edward McDowell, Bala Ravikumar. ijfcs, 2(2):163-182, 1991.

The Structure and Complexity of Minimal NFA s over a Unary AlphabetTao Jiang, Edward McDowell, Bala Ravikumar. fsttcs 1991: 152-171

Minimal NFA Problems Are HardTao Jiang, Bala Ravikumar. icalp 1991: 629-640

Coping with Erroneous Information while SortingK. B. Lakshmanan, Bala Ravikumar, K. Ganesan. TC, 40(9):1081-1084, 1991.

1989

Strong Nondeterministic Turing Reduction - A Technique for Proving IntractabilityMoon-Jung Chung, Bala Ravikumar. jcss, 39(1):2-20, 1989.

Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their RepresentationBala Ravikumar, Oscar H. Ibarra. SICOMP, 18(6):1263-1282, 1989.

1988

Sublogarithmic-Space Turing Machines, Nonuniform Space Complexity, and Closure PropertiesOscar H. Ibarra, Bala Ravikumar. mst, 21(1):1-17, 1988.

Some Subclasses of Context-Free Languages In NC1Oscar H. Ibarra, Tao Jiang, Bala Ravikumar. ipl, 29(3):111-117, 1988.

On Some Languages in NCOscar H. Ibarra, Tao Jiang, Bala Ravikumar, Jik H. Chang. awoc 1988: 64-73

1987

1986

On Pebble AutomataJik H. Chang, Oscar H. Ibarra, Michael A. Palis, Bala Ravikumar. TCS, 44:111-121, 1986.

On Sparseness, Ambiguity and other Decision Problems for Acceptors and TransducersOscar H. Ibarra, Bala Ravikumar. STACS 1986: 171-179

1984

Coping with Known Patterns of Lies in a Search GameBala Ravikumar, K. B. Lakshmanan. TCS, 33:85-94, 1984.

Sign in or sign up to see more results.

runs on WebDSL