CS 2003-2004 Faculty Information - Department of Computer ...
CS 2003-2004 Faculty Information - Department of Computer ...
CS 2003-2004 Faculty Information - Department of Computer ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
42<br />
<strong>CS</strong> <strong>2003</strong>-<strong>2004</strong> <strong>Faculty</strong> <strong>Information</strong><br />
Bio-sketch:<br />
Before coming to Purdue, Wojciech Szpankowski was assistant pr<strong>of</strong>essor at the Technical University <strong>of</strong> Gdansk, and in<br />
1984 he was assistant pr<strong>of</strong>essor at the McGill University, Montreal. During 1992-93, he was pr<strong>of</strong>esseur invité at INRIA,<br />
Rocquencourt, France. His research interests cover analysis <strong>of</strong> algorithms, data compression, information theory, analytic<br />
combinatorics, random structures, networking, stability problems in distributed systems, modeling <strong>of</strong> computer<br />
systems and computer communication networks, queueing theory, and operations research. His recent work is devoted<br />
to the probabilistic analysis <strong>of</strong> algorithms on words, analytic information theory, and designing efficient multimedia<br />
data compression schemes based on approximate pattern matching.<br />
He is a recipient <strong>of</strong> the Humboldt Fellowship. He has been a guest editor for special issues in IEEE Transactions on<br />
Automatic Control, Theoretical <strong>Computer</strong> Science, Random Structures & Algorithms,and Algorithmica. Currently, he is<br />
editing a special issue on “Analysis <strong>of</strong> Algorithms” in Algorithmica. He serves on the editorial boards <strong>of</strong> Theoretical<br />
<strong>Computer</strong> Science, Discrete Mathematics and Theoretical <strong>Computer</strong> Science, and the book series Advances in the Theory<br />
<strong>of</strong> Computation and Computational Mathematics.<br />
Selected Publications:<br />
P. Jacquet and W. Szpankowski, “A Combinatorial Problem Arising in <strong>Information</strong> Theory: Precise Minimax<br />
Redundancy for Markov Sources,” Proceedings <strong>of</strong> the 2nd Colloquium on Mathematics and <strong>Computer</strong> Science:<br />
Algorithms, Trees, Combinatorics and Probabilities, pp. 311-328, Birkhauser, 2002.<br />
P. Flajolet and W. Szpankowski, “Analytic Variations on Redundancy Rates <strong>of</strong> Renewal Processes,” IEEE Transactions<br />
on <strong>Information</strong> Theory, Volume 48, pp. 2911-2921, 2002.<br />
C. Knessl and W. Szpankowski, “Height <strong>of</strong> a Binary Search Tree: The Limiting Distribution Perspective,” Theoretical<br />
<strong>Computer</strong> Science, volume 289, pp. 649-703, 2002.<br />
T. N. Vijaykumar<br />
Education:<br />
BE (Hons), Electrical and Electronics Engineering, Birla Institute <strong>of</strong> Technology and Science, 1990<br />
M.Sc.(Tech), <strong>Computer</strong> Science, Birla Institute <strong>of</strong> Technology and Science, 1992<br />
MS, <strong>Computer</strong> Science, University <strong>of</strong> Wisconsin, 1997<br />
PhD, <strong>Computer</strong> Science, University <strong>of</strong> Wisconsin, 1997<br />
Positions:<br />
Assistant Pr<strong>of</strong>essor <strong>of</strong> Electrical and <strong>Computer</strong> Engineering<br />
Assistant Pr<strong>of</strong>essor <strong>of</strong> <strong>Computer</strong> Science (Courtesy)<br />
Jan Vitek<br />
Education:<br />
BS, <strong>Computer</strong> Science, University <strong>of</strong> Geneva, 1989<br />
MS, <strong>Computer</strong> Science, University <strong>of</strong> Victoria, 1995<br />
PhD, <strong>Computer</strong> Science, University <strong>of</strong> Geneva, 1999<br />
Position:<br />
Assistant Pr<strong>of</strong>essor <strong>of</strong> <strong>Computer</strong> Science