Torsten Suel, Ph.D.
Associate Professor

Research Interest

• Design and Analysis of Algorithms
• Database Systems
• Parallel Computation
• Experimental Algorithmics

Profile

Torsten Suel received the Diplom degree in Computer Science from the Technical University of Braunschweig, Germany, in 1990 and the MS and PhD degrees from the University of Texas at Austin in 1992 and 1994, respectively. After postdoctoral positions at the NEC Research Institute and Bell Laboratories, he joined the Computer and Information Science Department at Polytechnic Institute of NYU in October 1998 as an Assistant Professor. His main research areas are algorithms, databases, and parallel computation. Broadly speaking, Dr. Suel's research is concerned with the various theoretical and practical aspects of algorithms and data structures, including the design and formal analysis of algorithms, the efficient implementation and experimental evaluation of algorithms, and the use of novel algorithmic techniques in various application areas. He is particularly interested in applications that involve very large data sets, such as those arising in the areas of databases, information retrieval, and large-scale parallel computing.

Selected Publication

• "Optimal Histograms with Quality Guarantees," with H. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, and K. Sevcik. 24th Annual International Conference on Very Large Data Bases (VLDB), August 1998.
• "Highly Portable and Efficient Implementations of Parallel Adaptive N-Body Methods," with D. Blackston. Supercomputing'97: High Performance Networking and Computing, November 1997.
• "On Probabilistic Networks for Selection, Merging, and Sorting," with F. T. Leighton and Y. Ma. Theory of Computing Systems 30 (1997), 559-582.
• "Lower Bounds for Shellsort," with C. G. Plaxton. Journal of Algorithms 23 (1997), 221-240.

Education

• Ph.D. University of Texas at Austin, 1994