Professor, Dept. of Computer Science
512-G, Pray-Harrold
Eastern Michigan University
Ypsilanti, Mich. 48197.
Phone#: (734)487-3207
E-mail: ranjan.chaudhuri@emich.edu
EDUCATION:
Ph.D Univ. of South Florida, Tampa (1982)
M.S Univ. of South Florida, Tampa (1981)
M.Sc Univ. of Calcutta, India (1975)
B.Sc Univ. of Calcutta, India (1973)
COURSES TAUGHT (since 2003 at EMU):
COSC 111 Computer Science I (formerly COSC 138)
COSC 211 Computer Science II (formerly COSC 238)
COSC 221 Computer Organization I
COSC 239 Assembly Language Programming
COSC 314 Computational Discrete Structures
COSC 311 Data Structure (formerly COSC 334)
COSC 321 Computer Organization II (formerly COSC 338)
COSC 444 Formal Languages and Automata
COSC 405 Switching Theory
COSC 511 Design and Analysis of Algorithms
COSC 514 Automata, Computability & Formal Lang.
PUBLICATIONS:
A. Refereed Journal Publications:
1)"Idempotent Boolean Matrices" with A.Mukherjea, Semi-Group
Forum(Springer-Verlag), Vol.21, No.2/3, 273-283, 1980.
2)"Convergence of Non-homogeneous Stochastic Chains II" with
A.Mukherjea, Math. Proc. Cambridge Phil. Soc.,Vol.90, 167-
182, 1981.
3)"On a Property of Probabilistic Context-free Grammars" with
A.Rao, Int. J. Math. and Math. Sci.,Vol.6,No.2, 403-406,1983.
4)"Solution of an Open Problem on Probabilistic Grammars" with
S.Pham and O.N.Garcia, I.E.E.E Trans. on Computers, Vol.C-32,
No.8, 748-750, 1983.
5)"Approximating Grammar Probabilities:Solution of a Conjecture"
with A.N.V.Rao, Journal of the A.C.M, Vol.33, No.4, 702-704,
1986.
6)"On Rational Solution of the State Equation of a Finite
Automaton" with H.Höft, Int. J. Math. and Math. Sci.,Vol.11,
No.2, 355-364, 1988.
7)"Splaying a Search Tree in Preorder Takes Linear Time", with
H.Höft, Int. J. Math. Math. Sci.,Vol.14, No.3, 545-552, 1991.
B. Refereed Conference Publications:
1)"A Note on Generating a Worst Case Sequence for Quicksort in
Linear Time" with A.C.Dempster, Proc. of the A.C.M Symposium
on Applied Computing, Phoenix, Arizona, 1994.
C. Other Reviewed Publications:
1)"A Note on Slowing Quicksort" with A.C.Dempster, SIGCSE
Bulletin, Vol.25,No.2, 57-58, June 1993.
2)"Splaying a Search Tree in Preorder Takes Linear Time" with
H.Höft, SIGACT News, Vol.24, No.2, 88-93, Spring 1993.
3)”Do the Arithmetic Operations Really Execute in Constant Time?”,
SIGCSE Bulletin, Vol.35, No.2, 43-44, June 2003.
4)”Teaching Bit-level Algorithm Analysis to the Undergraduates
In Computer Science”, SIGCSE Bulletin, Vol.36, No.2, June 2004.
CONFERENCE PRESENTATIONS
1)"Some Results on the State Space Approach to Finite
Automaton", Annual Conference of the A.C.M, Cincinnati, OH,
1986.
2)"On Rational Solution of the State Equation of a Finite
Automaton, Annual Conference of the A.C.M, St.Louis, MO,
1987.
3)"Splaying Binary search Trees", Annual Meeting of the Michigan
Academy of Science, Arts and Letters, Albion College, March
1990.
4)"On the Reconstruction of a Binary Search Tree from its
Inorder-Preorder Sequence", Annual Meeting of the Michigan
Academy of Science, Arts and Letters, Eastern Michigan Univ.,
March 1991.
5)"On Preorder Splaying in Binary Search Trees", Annual
Conference of the A.C.M, San Antonio, Texas, 1991.
6)"Generating Worst Case Sequences for Quicksort", Annual
Meeting of the Michigan Academy of Science, Arts and Letters,
Western Michigan Univ., March 1993.
7)"On the Parent-Array Representation of Trees", Annual
Meeting of the Michigan Academy of Science, Arts and Letters,
Saginaw Valley State Univ., March 2000.
8)”Do the Arithmetic Operations Really Execute in Constant Time?”,
Annual Meeting of the Michigan Academy of Science, Arts and
Letters, Hope College, Holland, Mich., March 2003.
9)”Exploring the Duality principle from Digital Design Perspective”,
Annual Meeting of the Michigan Academy of Science, Arts and
Letters, Grand Rapids, Michigan, March 2004.
10)”On Synchronizing Instructions and Edge Coloring of Digraphs”,
Annual Meeting of the Michigan Academy of Science, Arts and
Letters, Oakland University, Michigan, March 2006.
11)”Some Results on Synchronization in Colored Digraphs”,
Annual Meeting of the Michigan Academy of Science, Arts and
Letters, Ferris State Univ., Michigan, March 2007.
12)”Helping Students with Recursion”, Annual Meeting of the Michigan
Academy of Science, Arts and Letters, Kalamazoo, Michigan, March
2008(Jointly with A.Tehranipour).
13)”Putting Pair Programming to the Test”, Annual Meeting of the
Michigan Academy of Science, Arts and Letters, Grand Rapids,
Michigan, March 2008(Jointly with A.Tehranipour).
14)”Should We Continue Teaching Assembly Language in a Computer
Science Curriculum?”, Annual Meeting of the Michigan Academy of
Science, Arts and Letters, Calvin College, Michigan, March 2010.
15)”Teaching Amortized Analysis of Algorithms Effectively”,
Annual Meeting of the Michigan Academy of Science, Arts and
Letters, Saginaw Valley State Univ., Michigan, March 2011.
16)”On a Challenging File I/O Problem in CS2”, Annual Meeting of the
Michigan Academy of Science, Arts and Letters, Alma College,
Michigan, March 2012.
CITATIONS OF MY RESEARCH CONTRIBUTIONS:
The following are some of the papers that have cited my
research contributions:
1)"Derived Linear Systems of Context-free Grammars" by David
Mauro, Theoretical Computer Science, Vol.83, No.2, 189-203,
1991.
2)"Ratio Estimators are Maximum-Likelihood Estimators for Non-
Context-free Grammars" by Keith Humenik, S.I.A.M Journal on
Computing, Vol.18, No.5, 1048-1055, 1989.
3)"Probabilistic Hyperedge Replacement Grammars" by M.Mosbah,
Theoretical Computer Science, Vol. 159, No.1, 81-102, 1996.
4)"Self-Organizing Data Structures" by Susanne Albers and
Jeffery Westbrook, "Online Algorithms: The State of the Art"
edited by Amos Fiat and Gerhard Woeginger, Springer LNCS
1442,p.31-51,1998.
5)"Randomized Splay Trees" by Martin Fürer, Proc. of the Tenth
Annual ACM-SIAM Symposium on Discrete Algorithms-SODA,
903-904,1999.
6)”Links between probabilistic automata and hidden Markov models:
Probability distributions, learning models and induction
Algorithms” by P.Dupont, F.Denis and Y.Esposito, Pattern
Recognition, Vol 38, 1349-1371, 2005.
7)”A Note on the Expressive Power of Probabilistic Context-Free
Grammars” by G.Infante-Lopez and M.DeRijke, J. Logic,
Language and Information, Vol 15, 219-231,2006.
8)”Consistency of Stochastic Context-Free Grammars” by R.Gecse
and A.Kovacs, Mathematical and Computer Modeling, Vol 52,
490-500, Elsevier, 2010.
9)”Maximum Likelihood Analysis of Algorithms and Data Structures”,
by U.Laube and M.E.Nebel, Theoretical Computer Science,
Vol.411, No.1, 188-212,2010.
10)”Smoothing and Compression with stochastic k-testable tree
Languages” by Rico-Juan,Calera-Rubio and Carrasco, Pattern
Recognition, Vol.38,1420-1430, Elsevier, 2010.
11)”Cross-Entropy and Estimation of Probabilistic Context-Free
Grammars” by A.Corazza and G.Satta, Proc. Human Language
Technology Conf, 335-342, New York, June 2006.
12)”Estimation of Consistent Probabilistic Context-Free
Grammars” by M.J.Nederhof and G.Satta, Proc. Human Language0
Technology Conf, 343-350, New York, June 2006.
13)”Stochastic k-testable Tree Languages and Applications” by
J.R.Rico-Juan,J.Calera-Rubio and R.C.Carrasco, Int.
Colloquium on Grammatical Inference-ICGI,199-212,2002.
14)”Conditions on Consistency of Probabilistic Tree Adjoining
Grammars” by A.Sarkar, J.Computing Research Repository,
Vol cs.cl/9809,1164-70,1998.
15)”Probabilistic Parsing” by M.J.Nederhof and G.Satta, Studies
In Computational Intelligence-SCI,Vol.113,229-258, Springer-
Verlag, 2008.
16)”Evaluation of a sophisticated SCFG design for RNA secondary
Structure prediction” by M.E.Nebel and A.Scheid, Theo. BioSci,
Vol.130,313-336,Springer,2011.
17)”Consistency of SCFG from probabilistic estimation based on
Growth transformations” by J.Sanchez and J.Benedi, IEEE
Transactions on Pattern Analysis and Machine Intelligence,
Vol.19,No.9,1052-55,1997.
18)”Splay trees, Davenport-Schinzel sequences and the deque
Conjecture” by Seth Pettie, ACM-SIAM Symposium on discrete
Algorithms-SODA, 1115-1124, 2008.
19)”Randomized Splay Trees: Theoretical and experimental results”
By S.Albers and M.Karpinski, Information Processing Letters,
Vol.81,213-221,2002.
20)”New Bounds on Optimal Binary Search Trees” by Dion Harmon,
Ph.D Thesis, Massachusetts Inst of Technology, June 2006.
21)”Multi-Splay Trees” by Chengwen Chris Wang, Ph.D Thesis,
Carnegie Mellon University, July 2006.
PROFESSIONAL ACTIVITES:
I have refereed papers for professional journals, such as,
The Journal of Information and Computation, S.I.A.M Journal
on Computing, I.E.E.E Transactions on Information Theory and
SOFTWARE Practice and Experience.
I have reviewed papers in the areas of Formal Languages/Grammars
And Data Structures for the American Mathematical Society.
I have reviewed text books and monographs for Addison-Wesley
and McGraw-Hill Publishing Co.
I have served as an external reviewer for tenure and
promotion at other universities.
Currently, I am the Vice-Chair of the Computers Section of the
Michigan Academy of Science, Arts and Letters.
SERVICE ACTIVITES:
I have served on many departmental committees, such as,
the Executive Committee, the Evaluation Committee, the
Curriculum Committee, the Graduate Committee, the DID Committee,
various Search Committees and so on.
I have served as the Seminar Scheduler for the Department of
Computer Science at E.M.U between 1988-97.
I was the representative of the Department of Computer Science on
The College Committee for Research and Sabbatical Leaves during
1989-92.
I have Served on the Grade Grievance board of the College of Arts
and Sciences at EMU
ORGANIZATIONAL MEMBERSHIPS:
1) Member of the Association for Computing Machinery(A.C.M)
2) Member of the Michigan Academy of Science, Arts and Letters
3) Member of the Aircraft Owners and Pilots Association(A.O.P.A)
MY HOBBIES AND OTHER ACTIVITIES:
I am a private pilot. I have flown single engine airplanes,such
as, Cessna 152,Cessna 172 and Piper Archer. I also enjoy
bicycling, downhill skiing and target shooting.