Computer Science

Public Talks

Choose Type

• 
  All
• 
  Colloquium
• 
  Career Mentorship Colloquium
• 
  Directed Research Project
• 
  Area Exam
• 
  Dissertation Defense

All of these talks are open to the public, and will provide some insight into various research activities here and at other institutions.

Choose Year

June 2003
	13	Support for the Fast Prototyping of Coupled Models Tom Bulatewicz, University of Oregon
	05	Procedural Embedding of Contact-Constrained Joint Motion Eric Wills, University of Oregon
May 2003
	29	FOREST: A System for Developing and Evaluating Ecosystem Simulation Models Heather May, University of Oregon
	13	Determining Neural Network Control of Chemotaxis in C. elegans Nathan Dunn, University of Oregon
	01	Social Computing John Thomas, IBM T. J. Watson Research Center
April 2003
	24	Systematic SAT Solvers: Conjunctive Normal Form and Beyond Heidi Dixon, University of Oregon
	18	Gender Equity in Computer Science Education Joanne McGrath Cohoon, University of Virginia
	15	TILT: Compiling With Types For Optimization and Certification Leaf Petersen, Carnegie Mellon University
	10	Set systems and their representatives: Algorithms, complexity and applications Jan Kratochvil, Charles University, Prague
March 2003
	17	Scheduling Network Resources in Grid Computing Environments D. Martin Swany, University of California, Santa Barbara
	13	Optimal Bin Packing Richard E. Korf, Computer Science Department, University of California, Los Angeles
	06	Mining, mapping, modeling and crawling the Web Filippo Menczer, University of Iowa
February 2003
	20	Using Types to Enforce Architectural Design Jonathan Aldrich, University of Washington
	13	Types for Atomicity Cormac Flanagan, Systems Research Center, Hewlett Packard Laboratories
January 2003
	30	Why IPsec is Problematic for Applications other than VPN's Jonathan Trostle, Security Consultant
	23	What if Quantum computing becomes reality: Are we ready? Janusz Kowalik, University of Washington
December 2002
	12	SPINGenerator: a Tool for Automatic Construction of Promela Programs for Cryptographic Protocols Zebin Chen, University of Oregon
	06	Haptic Perception of Relative Magnitude in Sighted and Visually Disabled People Shasta Willson, University of Oregon
	02	Redesigning the Cluster Architecture (or How to Build an 8TF 1024 Node Cluster) Matt Sottile, Los Alamos National Laboratory
November 2002
	21	Primality is "Easy" Joe Buhler, Reed College
	14	On Models of Quantum Computation Emanual Knill, Los Alamos National Laboratory
	07	BluespecTM : A language for hardware design, simulation and synthesis Arvind, Massachusetts Institute of Technology
	06	Edge-disjoint odd cycles in planar graphs Daniel Kral, Charles University, Prague
October 2002
	31	The Stable Paths Problem as a Model of BGP Routing Timothy Griffin, AT&T Research
	30	Towards a systematic approach to networking research Lixia Zhang, Computer Science Department, University of California, Los Angeles
	23	Performance Database Framework Li Li, University of Oregon
	23	Investigating the Molloc Problem Chris GauthierDickey, University of Oregon
	21	Automatic Performance Analysis on Parallel Computers with SMP Nodes Felix Wolf, Research Centre Juelich, Germany
	18	A Performance Analysis and Visualization Framework for Large-Scale Parallel Applications Kai Li, University of Oregon
	16	Applying Insights from Visual Perception, Art and Illustration to the Design of More Effective Techniques for Representing Data Victoria Interrante, University of Minnesota, Twin Cities
	03	Departmental Introductions CIS Faculty, University of Oregon