The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bala Ravikumar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su
    Online and Minimum-Cost Ad Hoc Delegation in e-Service Composition. [Citation Graph (0, 0)][DBLP]
    IEEE SCC, 2005, pp:103-112 [Conf]
  2. Gerry Eisman, Bala Ravikumar
    Approximate Recognition of Non-regular Languages by Finite Automata. [Citation Graph (0, 0)][DBLP]
    ACSC, 2005, pp:219-228 [Conf]
  3. Oscar H. Ibarra, Tao Jiang, Bala Ravikumar, Jik H. Chang
    On Some Languages in NC. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:64-73 [Conf]
  4. Bala Ravikumar
    A Fault-Tolerant Merge Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:440-447 [Conf]
  5. Bala Ravikumar
    On Some Variations of Two-Way Probabilistic Finite Automata Models. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:443-454 [Conf]
  6. Bala Ravikumar, Greg Cooper
    Fibonacci Search Algorithm for Finding Extremum Using Unary Predicates. [Citation Graph (0, 0)][DBLP]
    FCS, 2005, pp:59-63 [Conf]
  7. Oscar H. Ibarra, Bala Ravikumar
    Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1987, pp:26-43 [Conf]
  8. Tao Jiang, Edward McDowell, Bala Ravikumar
    The Structure and Complexity of Minimal NFA's over a Unary Alphabet. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:152-171 [Conf]
  9. Bala Ravikumar
    Some Observations on 2-way Probabilistic Finite Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:392-403 [Conf]
  10. Tao Jiang, Bala Ravikumar
    Minimal NFA Problems Are Hard. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:629-640 [Conf]
  11. Moon-Jung Chung, Bala Ravikumar
    Bounds on the Size of Test Sets for Sorting and Related Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:745-751 [Conf]
  12. Bala Ravikumar, X. Xiong
    Randomized Parallel Algorithms for the Homing Sequence Problem. [Citation Graph (0, 0)][DBLP]
    ICPP, Vol. 2, 1996, pp:82-89 [Conf]
  13. Bala Ravikumar, X. Xiong
    A Parallel Algorithm for Minimization of Finite Automata. [Citation Graph (0, 0)][DBLP]
    IPPS, 1996, pp:187-191 [Conf]
  14. Bala Ravikumar
    Parallel Algorithms for Finite Automata Problems. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP Workshops, 1998, pp:373- [Conf]
  15. Bala Ravikumar
    Peg-Solitaire, String Rewriting Systems and Finite Automata. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:233-242 [Conf]
  16. Oscar H. Ibarra, Bala Ravikumar
    On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:171-179 [Conf]
  17. Bala Ravikumar, K. Ganesan, K. B. Lakshmanan
    On Selecting the Largest Element in Spite of Erroneous Information. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:88-99 [Conf]
  18. Bala Ravikumar
    Weak Minimization of DFA - An Algorithm and Applications. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:226-238 [Conf]
  19. Bala Ravikumar, X. Xiong
    Implementing Sequential and Parallel Programs for the Homing Sequence Problem. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1996, pp:120-131 [Conf]
  20. Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Bala Ravikumar
    Some Classes of Languages in NC¹ [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:90, n:1, pp:86-106 [Journal]
  21. Tao Jiang, Edward McDowell, Bala Ravikumar
    The Structure and Complexity of Minimal NFA's over a Unary Alphabet. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1991, v:2, n:2, pp:163-182 [Journal]
  22. Jik H. Chang, Oscar H. Ibarra, Bala Ravikumar, Leonard Berman
    Some Observations Concerning Alternating Turing Machines Using Small Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:1, pp:1-9 [Journal]
  23. Oscar H. Ibarra, Tao Jiang, Bala Ravikumar
    Some Subclasses of Context-Free Languages In NC1. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:3, pp:111-117 [Journal]
  24. Tao Jiang, Bala Ravikumar
    A Note on the Space Complexity of Some Decision Problems for Finite Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:1, pp:25-31 [Journal]
  25. Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao
    A Simplified NP-Complete MAXSAT Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:1, pp:1-6 [Journal]
  26. Moon-Jung Chung, Bala Ravikumar
    Strong Nondeterministic Turing Reduction - A Technique for Proving Intractability. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:1, pp:2-20 [Journal]
  27. Oscar H. Ibarra, Bala Ravikumar
    Sublogarithmic-Space Turing Machines, Nonuniform Space Complexity, and Closure Properties. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1988, v:21, n:1, pp:1-17 [Journal]
  28. Tao Jiang, Bala Ravikumar
    Minimal NFA Problems are Hard. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1117-1141 [Journal]
  29. Bala Ravikumar, Oscar H. Ibarra
    Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:6, pp:1263-1282 [Journal]
  30. K. B. Lakshmanan, Bala Ravikumar, K. Ganesan
    Coping with Erroneous Information while Sorting. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1991, v:40, n:9, pp:1081-1084 [Journal]
  31. Jik H. Chang, Oscar H. Ibarra, Michael A. Palis, Bala Ravikumar
    On Pebble Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:111-121 [Journal]
  32. Oscar H. Ibarra, Bala Ravikumar
    On partially blind multihead finite automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:190-199 [Journal]
  33. Bala Ravikumar
    Peg-solitaire, string rewriting systems and finite automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:383-394 [Journal]
  34. Bala Ravikumar, Gerry Eisman
    Weak minimization of DFA - an algorithm and applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:328, n:1-2, pp:113-133 [Journal]
  35. Bala Ravikumar, K. B. Lakshmanan
    Coping with Known Patterns of Lies in a Search Game. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:85-94 [Journal]
  36. Bala Ravikumar
    On some variations of two-way probabilistic finite automata models. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:127-136 [Journal]
  37. Bala Ravikumar, Nicolae Santean
    Deterministic Simulation of a NFA with k -Symbol Lookahead. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:488-497 [Conf]

Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002