| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gerry Eisman, Bala Ravikumar |
On Approximating Non-regular Languages by Regular Languages.  |
Fundam. Inform.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey Shallit |
Decimations of languages and state complexity.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Narad Rampersad, Nicolae Santean, Jeffrey Shallit, Bala Ravikumar |
State complexity of unique rational operations.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Bala Ravikumar |
Preface.  |
Int. J. Found. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su |
Minimum-cost delegation in service composition.  |
Theor. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar |
The Benford-Newcomb Distribution and Unambiguous Context-Free Languages.  |
Int. J. Found. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Bala Ravikumar (eds.) |
Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings  |
CIAA  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Bala Ravikumar |
On some variations of two-way probabilistic finite automata models.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar, Nicolae Santean |
On the Existence of Lookahead Delegators for NFA.  |
Int. J. Found. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar, Nicolae Santean |
Deterministic Simulation of a NFA with k -Symbol Lookahead.  |
SOFSEM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Bala Ravikumar |
On partially blind multihead finite automata.  |
Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Bala Ravikumar, Cagdas Evren Gerede |
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach.  |
Journal of Automata, Languages and Combinatorics  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Bala Ravikumar |
On Some Variations of Two-Way Probabilistic Finite Automata Models.  |
Developments in Language Theory  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su |
Online and Minimum-Cost Ad Hoc Delegation in e-Service Composition.  |
IEEE SCC  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar, Greg Cooper |
Fibonacci Search Algorithm for Finding Extremum Using Unary Predicates.  |
FCS  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Gerry Eisman, Bala Ravikumar |
Approximate Recognition of Non-regular Languages by Finite Automata.  |
ACSC  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Bala Ravikumar, Gerry Eisman |
Weak minimization of DFA - an algorithm and applications.  |
Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar |
Peg-solitaire, string rewriting systems and finite automata.  |
Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar |
Weak Minimization of DFA - An Algorithm and Applications.  |
CIAA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar |
A Fault-Tolerant Merge Sorting Algorithm.  |
COCOON  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao |
A Simplified NP-Complete MAXSAT Problem.  |
Inf. Process. Lett.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar |
Parallel Algorithms for Finite Automata Problems.  |
IPPS/SPDP Workshops  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Tao Jiang, Ming Li, Bala Ravikumar |
Formal Models and Computability.  |
The Computer Science and Engineering Handbook  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Bala Ravikumar |
Peg-Solitaire, String Rewriting Systems and Finite Automata.  |
ISAAC  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar, X. Xiong |
A Parallel Algorithm for Minimization of Finite Automata. (PDF / PS)  |
IPPS  |
1996 |
DBLP DOI BibTeX RDF |
parallel algorithms, automata, minimization |
| 1 | Bala Ravikumar, X. Xiong |
Randomized Parallel Algorithms for the Homing Sequence Problem.  |
ICPP, Vol. 2  |
1996 |
DBLP BibTeX RDF |
|
| 1 | Bala Ravikumar, X. Xiong |
Implementing Sequential and Parallel Programs for the Homing Sequence Problem.  |
Workshop on Implementing Automata  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Tao Jiang, Bala Ravikumar |
Minimal NFA Problems are Hard.  |
SIAM J. Comput.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar |
Some Observations on 2-way Probabilistic Finite Automata.  |
FSTTCS  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Tao Jiang, Bala Ravikumar |
A Note on the Space Complexity of Some Decision Problems for Finite Automata.  |
Inf. Process. Lett.  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Tao Jiang, Edward McDowell, Bala Ravikumar |
The Structure and Complexity of Minimal NFA's over a Unary Alphabet.  |
Int. J. Found. Comput. Sci.  |
1991 |
DBLP BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Bala Ravikumar |
Some Classes of Languages in NC¹  |
Inf. Comput.  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | K. B. Lakshmanan, Bala Ravikumar, K. Ganesan |
Coping with Erroneous Information while Sorting.  |
IEEE Trans. Computers  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Tao Jiang, Bala Ravikumar |
Minimal NFA Problems Are Hard.  |
ICALP  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Tao Jiang, Edward McDowell, Bala Ravikumar |
The Structure and Complexity of Minimal NFA's over a Unary Alphabet.  |
FSTTCS  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Moon-Jung Chung, Bala Ravikumar |
Strong Nondeterministic Turing Reduction - A Technique for Proving Intractability.  |
J. Comput. Syst. Sci.  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar, Oscar H. Ibarra |
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation.  |
SIAM J. Comput.  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Tao Jiang, Bala Ravikumar |
Some Subclasses of Context-Free Languages In NC1.  |
Inf. Process. Lett.  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Bala Ravikumar |
Sublogarithmic-Space Turing Machines, Nonuniform Space Complexity, and Closure Properties.  |
Mathematical Systems Theory  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Tao Jiang, Bala Ravikumar, Jik H. Chang |
On Some Languages in NC.  |
AWOC  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Jik H. Chang, Oscar H. Ibarra, Bala Ravikumar, Leonard Berman |
Some Observations Concerning Alternating Turing Machines Using Small Space.  |
Inf. Process. Lett.  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar, K. Ganesan, K. B. Lakshmanan |
On Selecting the Largest Element in Spite of Erroneous Information.  |
STACS  |
1987 |
DBLP DOI BibTeX RDF |
largest element, adversary strategy, selection networks, selection, errors, analysis of algorithm, comparisons, lies |
| 1 | Moon-Jung Chung, Bala Ravikumar |
Bounds on the Size of Test Sets for Sorting and Related Networks.  |
ICPP  |
1987 |
DBLP BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Bala Ravikumar |
Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation.  |
FSTTCS  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Jik H. Chang, Oscar H. Ibarra, Michael A. Palis, Bala Ravikumar |
On Pebble Automata.  |
Theor. Comput. Sci.  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Bala Ravikumar |
On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers.  |
STACS  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Ravikumar, K. B. Lakshmanan |
Coping with Known Patterns of Lies in a Search Game.  |
Theor. Comput. Sci.  |
1984 |
DBLP DOI BibTeX RDF |
|