Research Bytes 1

Professors Micha Hofri, Kathi Fisler, Daniel Dougherty, and Stanley Selkow
Professors Computer Science Department, WPI

September 17, 2004
11 a.m. - 12 noon
Fuller Labs 320

Abstract

Professors Micha Hofri, Kathi Fisler, Daniel Dougherty, and Stanley Selkow will be giving 15 minutes presentations of their research areas. Everyone is invited to learn more about each professor's research area and the problems he or she is currently pursuing. Below are brief descriptions:

Professor Hofri: Maple is a wonderful research tool for analysts. In spite of its power it often behaves in surprising ways. The surprise means it does not perceive things the way we do. It makes sense to create new facilities and packages that will move its handling closer to the way we do. The required work is a blend of elementary mathematics, software engineering and probably, in a sense, AI.; At the PhD level I can offer several problems that involve asymptotics arising in analysis of algorithms. My interest is manly in the techniques needed to obtain the asymptotic estimates.
Professor Fisler: Exhaustively searching software for bugs.
Professor Dougherty: I am interested in Logic in Computer Science, specifically in applications of logic to programming languages and software engineering, verification, databases and the Semantic Web, and automated reasoning. I will describe some current projects and anticipated future research.
Professor Selkow: Infinite Stable Marriage: An important combinatorial problem with broad applications is the Stable Marriage Problem, which seeks a pairing of men and women subject to certain stability constraints. With Dan Dougherty, we are seeking solutions to this problem when we relax the constraint that the sets of men and women must be finite.

Host

Neil T. Heffernan
Refreshments will be served.

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