default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBala Ravikumar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j29]Oscar H. Ibarra, Ian McQuillan
, Bala Ravikumar:
On counting functions and slenderness of languages. Theor. Comput. Sci. 777: 356-378 (2019)- [i1]Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar:
On counting functions and slenderness of languages. CoRR abs/1903.03504 (2019) - 2018
- [c27]Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar:
On Counting Functions of Languages. DLT 2018: 429-440 - 2016
- [j28]Oscar H. Ibarra, Bala Ravikumar:
On bounded languages and reversal-bounded automata. Inf. Comput. 246: 30-42 (2016) - 2014
- [j27]Oscar H. Ibarra, Bala Ravikumar:
Some Decision Questions Concerning the Time Complexity of Language Acceptors. Int. J. Found. Comput. Sci. 25(8): 1127-1140 (2014) - [c26]Oscar H. Ibarra, Bala Ravikumar:
On the Parikh Membership Problem for FAs, PDAs, and CMs. LATA 2014: 14-31 - [c25]Bala Ravikumar, Duncan Innes:
An Improved Upper-Bound for Rivest et al.'s Half-Lie Problem. TAMC 2014: 23-38 - [p4]Tao Jiang, Ming Li, Bala Ravikumar:
Formal Models and Computability. Computing Handbook, 3rd ed. (1) 2014: 8: 1-37 - 2013
- [c24]Oscar H. Ibarra, Bala Ravikumar:
Some Decision Questions Concerning the Time Complexity of Language Acceptors. Developments in Language Theory 2013: 264-276 - [c23]Oscar H. Ibarra, Bala Ravikumar:
On Bounded Languages and Reversal-Bounded Automata. LATA 2013: 359-370 - [c22]Oscar H. Ibarra, Bala Ravikumar:
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages. CIAA 2013: 193-207 - 2011
- [j26]Gerry Eisman, Bala Ravikumar:
On Approximating Non-regular Languages by Regular Languages. Fundam. Informaticae 110(1-4): 125-142 (2011)
2000 – 2009
- 2009
- [j25]Oscar H. Ibarra, Bala Ravikumar:
Preface. Int. J. Found. Comput. Sci. 20(4): 559-561 (2009) - [j24]Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey O. Shallit:
Decimations of languages and state complexity. Theor. Comput. Sci. 410(24-25): 2401-2409 (2009) - [j23]Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit, Bala Ravikumar:
State complexity of unique rational operations. Theor. Comput. Sci. 410(24-25): 2431-2441 (2009) - 2008
- [j22]Bala Ravikumar:
The Benford-Newcomb Distribution and Unambiguous Context-Free Languages. Int. J. Found. Comput. Sci. 19(3): 717-727 (2008) - [j21]Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su:
Minimum-cost delegation in service composition. Theor. Comput. Sci. 409(3): 417-431 (2008) - [e1]Oscar H. Ibarra, Bala Ravikumar:
Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings. Lecture Notes in Computer Science 5148, Springer 2008, ISBN 978-3-540-70843-8 [contents] - 2007
- [j20]Bala Ravikumar, Nicolae Santean:
On the Existence of Lookahead Delegators for NFA. Int. J. Found. Comput. Sci. 18(5): 949-973 (2007) - [j19]Bala Ravikumar:
On some variations of two-way probabilistic finite automata models. Theor. Comput. Sci. 376(1-2): 127-136 (2007) - [c21]Bala Ravikumar, Nicolae Santean:
Deterministic Simulation of a NFA with k -Symbol Lookahead. SOFSEM (1) 2007: 488-497 - 2006
- [j18]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): 169-188 (2006) - [j17]Oscar H. Ibarra, Bala Ravikumar:
On partially blind multihead finite automata. Theor. Comput. Sci. 356(1-2): 190-199 (2006) - [c20]Bala Ravikumar:
On Some Variations of Two-Way Probabilistic Finite Automata Models. Developments in Language Theory 2006: 443-454 - 2005
- [c19]Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su:
Online and Minimum-Cost Ad Hoc Delegation in e-Service Composition. IEEE SCC 2005: 103-112 - [c18]Gerry Eisman, Bala Ravikumar:
Approximate Recognition of Non-regular Languages by Finite Automata. ACSC 2005: 219-228 - [c17]Bala Ravikumar, Greg Cooper:
Fibonacci Search Algorithm for Finding Extremum Using Unary Predicates. FCS 2005: 59-63 - 2004
- [j16]Bala Ravikumar:
Peg-solitaire, string rewriting systems and finite automata. Theor. Comput. Sci. 321(2-3): 383-394 (2004) - [j15]Bala Ravikumar, Gerry Eisman:
Weak minimization of DFA - an algorithm and applications. Theor. Comput. Sci. 328(1-2): 113-133 (2004) - 2003
- [c16]Bala Ravikumar:
Weak Minimization of DFA - An Algorithm and Applications. CIAA 2003: 226-238 - 2002
- [c15]Bala Ravikumar:
A Fault-Tolerant Merge Sorting Algorithm. COCOON 2002: 440-447
1990 – 1999
- 1999
- [p3]Tao Jiang, Ming Li, Bala Ravikumar:
Basic Notions in Computational Complexity. Algorithms and Theory of Computation Handbook 1999 - [p2]Tao Jiang, Ming Li, Bala Ravikumar, Kenneth W. Regan:
Computability. Algorithms and Theory of Computation Handbook 1999 - [p1]Tao Jiang, Ming Li, Bala Ravikumar, Kenneth W. Regan:
Formal Grammars and Languages. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j14]Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao:
A Simplified NP-Complete MAXSAT Problem. Inf. Process. Lett. 65(1): 1-6 (1998) - [c14]Bala Ravikumar:
Parallel Algorithms for Finite Automata Problems. IPPS/SPDP Workshops 1998: 373 - 1997
- [c13]Bala Ravikumar:
Peg-Solitaire, String Rewriting Systems and Finite Automata. ISAAC 1997: 233-242 - [r1]Tao Jiang, Ming Li, Bala Ravikumar:
Formal Models and Computability. The Computer Science and Engineering Handbook 1997: 31-63 - 1996
- [c12]Bala Ravikumar, X. Xiong:
Randomized Parallel Algorithms for the Homing Sequence Problem. ICPP, Vol. 2 1996: 82-89 - [c11]Bala Ravikumar, X. Xiong:
A Parallel Algorithm for Minimization of Finite Automata. IPPS 1996: 187-191 - [c10]Bala Ravikumar, X. Xiong:
Implementing Sequential and Parallel Programs for the Homing Sequence Problem. Workshop on Implementing Automata 1996: 120-131 - 1993
- [j13]Tao Jiang, Bala Ravikumar:
Minimal NFA Problems are Hard. SIAM J. Comput. 22(6): 1117-1141 (1993) - 1992
- [c9]Bala Ravikumar:
Some Observations on 2-way Probabilistic Finite Automata. FSTTCS 1992: 392-403 - 1991
- [j12]Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Bala Ravikumar:
Some Classes of Languages in NC¹. Inf. Comput. 90(1): 86-106 (1991) - [j11]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): 163-182 (1991) - [j10]Tao Jiang, Bala Ravikumar:
A Note on the Space Complexity of Some Decision Problems for Finite Automata. Inf. Process. Lett. 40(1): 25-31 (1991) - [j9]K. B. Lakshmanan, Bala Ravikumar, K. Ganesan:
Coping with Erroneous Information while Sorting. IEEE Trans. Computers 40(9): 1081-1084 (1991) - [c8]Tao Jiang, Edward McDowell, Bala Ravikumar:
The Structure and Complexity of Minimal NFA's over a Unary Alphabet. FSTTCS 1991: 152-171 - [c7]Tao Jiang, Bala Ravikumar:
Minimal NFA Problems Are Hard. ICALP 1991: 629-640 - 1990
- [j8]Moon-Jung Chung, Bala Ravikumar:
Bounds on the size of test sets for sorting and related networks. Discret. Math. 81(1): 1-9 (1990)
1980 – 1989
- 1989
- [j7]Moon-Jung Chung, Bala Ravikumar:
Strong Nondeterministic Turing Reduction - A Technique for Proving Intractability. J. Comput. Syst. Sci. 39(1): 2-20 (1989) - [j6]Bala Ravikumar, Oscar H. Ibarra:
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation. SIAM J. Comput. 18(6): 1263-1282 (1989) - 1988
- [j5]Oscar H. Ibarra, Tao Jiang, Bala Ravikumar:
Some Subclasses of Context-Free Languages In NC1. Inf. Process. Lett. 29(3): 111-117 (1988) - [j4]Oscar H. Ibarra, Bala Ravikumar:
Sublogarithmic-Space Turing Machines, Nonuniform Space Complexity, and Closure Properties. Math. Syst. Theory 21(1): 1-17 (1988) - [c6]Oscar H. Ibarra, Tao Jiang, Bala Ravikumar, Jik H. Chang:
On Some Languages in NC. AWOC 1988: 64-73 - 1987
- [j3]Jik H. Chang, Oscar H. Ibarra, Bala Ravikumar, Leonard Berman:
Some Observations Concerning Alternating Turing Machines Using Small Space. Inf. Process. Lett. 25(1): 1-9 (1987) - [c5]Moon-Jung Chung, Bala Ravikumar:
Strong nondeterministic reduction - a technique for proving intractability. SCT 1987: 132-137 - [c4]Oscar H. Ibarra, Bala Ravikumar:
Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation. FSTTCS 1987: 26-43 - [c3]Moon-Jung Chung, Bala Ravikumar:
Bounds on the Size of Test Sets for Sorting and Related Networks. ICPP 1987: 745-751 - [c2]Bala Ravikumar, K. Ganesan, K. B. Lakshmanan:
On Selecting the Largest Element in Spite of Erroneous Information. STACS 1987: 88-99 - 1986
- [j2]Jik H. Chang, Oscar H. Ibarra, Michael A. Palis, Bala Ravikumar:
On Pebble Automata. Theor. Comput. Sci. 44: 111-121 (1986) - [c1]Oscar H. Ibarra, Bala Ravikumar:
On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers. STACS 1986: 171-179 - 1984
- [j1]Bala Ravikumar, K. B. Lakshmanan:
Coping with Known Patterns of Lies in a Search Game. Theor. Comput. Sci. 33: 85-94 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
