Implementing Algorithms and Data Structures: An Educational and Research Perspective

Roberto Tamassia
Department of Computer Science
Brown University

Friday, September 25, 1998
11 a.m.
Fuller Labs 311

Anecdotal evidence shows that developing correct and efficient implementations of fundamental data structures and algorithms is a challenging task. We discuss educational and research issues in the implementation of algorithms and data structures. Topics include checkers, visualizers, the use of design patters in teaching an introductory data structures course, and the development of libraries of data structures and algorithms in C++ and Java.

Roberto Tamassia is a Professor in the Department of Computer Science at Brown University. He received the Ph.D. degree in electrical and computer engineering from the University of Illinois at Urbana-Champaign in 1988. His research interests include analysis and design of algorithms, computational geometry, graph drawing, and information visualization. He has coauthored two books and published numerous papers in the above areas. He is editor of various scientific journals and serves regularly on program committees of international conferences. His research has been funded by ARO, ARPA, NATO, NSF, and several industrial sponsors.

Maintained by webmaster@wpi.edu
Last modified: Sep 27, 2006, 16:05 EDT