The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Bala Ravikumar" ( http://dblp.L3S.de/Authors/Bala_Ravikumar )

  Author page on DBLP  Author page in RDF  Community of Bala Ravikumar in ASPL-2

Publication years (Num. hits)
1984-1991 (18) 1992-2005 (16) 2006-2011 (13)
Publication types (Num. hits)
article(25) incollection(1) inproceedings(20) proceedings(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 8 occurrences of 8 keywords

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