( en | de | ru )

 

Disambiguation of "Ravikumar, Bala"

Author of the publication

copydeleteadd this publication to your clipboard
Coping with Erroneous Information while Sorting.

, , and . IEEE Trans. Computers, 40 (9): 1081-1084 (1991)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kiran Bala

Kavita Bala

Andreas Bala

Sruti Bala

Juraj Balà

 

Other publications of authors with the same name

Fibonacci Search Algorithm for Finding Extremum Using Unary Predicates., and . FCS, page 59-63. CSREA Press, (2005)Weak Minimization of DFA - An Algorithm and Applications.. CIAA, volume 2759 of Lecture Notes in Computer Science, page 226-238. Springer, (2003)Peg-Solitaire, String Rewriting Systems and Finite Automata.. ISAAC, volume 1350 of Lecture Notes in Computer Science, page 233-242. Springer, (1997)An Improved Upper-Bound for Rivest et al.'s Half-Lie Problem., and . TAMC, volume 8402 of Lecture Notes in Computer Science, page 23-38. Springer, (2014)On Approximating Non-regular Languages by Regular Languages., and . Fundam. Informaticae, 110 (1-4): 125-142 (2011)Decimations of languages and state complexity., , , , and . Theor. Comput. Sci., 410 (24-25): 2401-2409 (2009)On Pebble Automata., , , and . Theor. Comput. Sci., (1986)Minimal NFA Problems are Hard., and . SIAM J. Comput., 22 (6): 1117-1141 (1993)The Structure and Complexity of Minimal NFA's over a Unary Alphabet., , and . Int. J. Found. Comput. Sci., 2 (2): 163-182 (1991)On Selecting the Largest Element in Spite of Erroneous Information., , and . STACS, volume 247 of Lecture Notes in Computer Science, page 88-99. Springer, (1987)