Bala Ravikumar Professor Department of Computer and Engineering Science Sonoma State University 1801 E.Cotati Avenue Rohnert Park CA 94928 Office: 116 I Darwin Hall Phone: (707) 664 3335 ravi AT cs DOT sonoma DOT edu

Vitae

Office hours for Fall 2008:

T Th 9:30 to 10:30

Teaching

· Fall 2009

o CS 351 Computer Architecture

o CS 480 Artificial Intelligence

o ES 314 Advanced Programming, Modeling and Simulation

· Spring 2009

o CS 385 Social Network Analysis

o CES 524 Advanced Computer Architecture

· Spring 2013

o CS 315 Data Structures

o CES 510 Intelligent System Design

o ES 314 Advanced Programming, modeling and simulation

· Other Recent Courses

Recent Professional Activities

• PC member, 14^th Conference on Implementation and Application of Automata, Sydney, Australia, July 2009.
• Invited speaker, Workshop on Benford Distribution and Applications, Santa Fe, New Mexico, December 17-18, 2008.

• Invited speaker, Workshop on Descriptional Complexity of Formal Systems, Prince Edwards Island, July 2008.
• Program Co-chair, Conference on Implementation and Application of Automata, San Francisco, July 21-24, 2008.
• Member of Program Committee, Conference on Implementation and Application of Automata, Prague, Czech Republic, July 2007.
• Member of the program committee, Descriptional Complexity of Formal Systems, July 2006, Las Cruces, NM.
• Member of the program committee, Developments in Language Theory, June 2006, Santa Barbara, CA.

Current Research Interests

• Theory of computation, algorithm design
• Parallel computing
• Bioinformatics
• Pen-based computing

Recent Graduate Projects Supervised

Some Recent Publications

A simple multiplication game and its analysis, accepted for publication in the International Journal of Combinatorial Number Theory.

Benford-Newcomb distribution and unambiguous context-free languages, accepted for publication in Journal of Foundations of Computer Science.

Decimation of formal languages and state complexity, (with Kreiger, Shallit, and Ramparsad), accepted for publication in Theoretical Computer Science.

On unique operations and the state complexity of regular languages, (with Santean, Ramparsad and Shallit), accepted for publication in Theoretical Computer Science.

Quality-Aware Service Delegation in Automated Web Service Composition, (with Ibarra, Gerede and Su), accepted for publication in Theoretical Computer Science.

Efficient Implementation of algorithms for approximate exponentiation (with Kooshesh) to appear in Information Processing Letters, Feb 2008.

Row completion problem for SUDOKU, (with Kananaa), accepted for publication in Utilitas Mathematica.

On some variations of probabilistic finite automata, accepted for presentation at the international conference on Developments in Language Theory, Santa Barbara, June 2006.

On partially blind multihead finite automata (with O. Ibarra), in Theoretical Computer Science. 356(1-2): 190-199 (2006)

Some connections between the lying oracle problem and Ulam's search problem, in the proceedings of the Australasian Workshop on Combinatorial Algorithms, September 21-24, 2005, University of Ballarat, Victoria, Australia. Revised version submitted for journal publication.

QoS-aware Delegation in Automated Web Service Composition, (with O. Ibarra and Gerede), accepted for publication in the Journal of Automata, Languages and Combinatorics.

On-line and ad-hoc minimum cost delegation in e-service composition (with Gerede, Ibarra and Su, UC Santa Barbara), presented at the IEEE International Conference on Services Computing, Orlando, Florida, July 15-18, 2005.

On the approximation of non-regular languages by regular languages, (with G.Eisman), accepted for presentation at the Australian Computer Science Conference, New Castle, Australia, January 31, 2005 to February 4, 2005.

A Fibonacci Search Algorithm for a Two-person Search Game (with G.Cooper), presented at the Conference on Foundations of Computer Science, June 27-29, 2005, Las Vegas, Nevada.

A more complete list (in PDF)