The Computer Science Colloquium




 

Schedule - Spring 2006

January 26 Edward Hirsch and Alexander Kulikov
(Russian Academy of Sciences, St. Petersburg)
Title: Efficient Approaches to Proving Upper Bounds for NP-hard Problems
February 2 Benjamin Fine
(Fairfield University)
Title: Public Key Cryptosystems Using Linear Groups
February 9 Ivan Kazantsev
(UPenn)
Title: Linear Structures in Tomography and Image Processing
February 16 Ralph Kopperman
(CCNY)
Title: On storage of topological information
February 23 Murray Cantor
(IBM)
Title: Embracing Variance
March 2 Noemie Elhadad
(CCNY)
Title: User-Sensitive Text Summarization
March 9 Radu Grosu
(Stoney Brook)
Title: Safety-Liveness Semantics for UML 2.0 Sequence Diagrams
March 16 Sergei Artemov
(Graduate Center CUNY)
Title: Computer-Aided Proofs
March 23 Anatol Slissenko
(University Paris 12)
Title: Models of bounded complexity in describing decidable classes in predicate logic with time
March 30 Simon R. Arridge
(University College London)
Title: Medical Imaging using Near Infrared Light
April 6 Gabor T. Herman
(CUNY Graduate Center)
Title: Using computational methods to visualize the unseen
April 27 Stephen Cook
(University of Toronto)
Title: Computational Complexity and Proofs of Combinatorial Principles
May 4 TBA  
May 11 TBA  

365 Fifth Ave, New York City 10016 | Room 4319 | Phone: 212.817.8190 | Fax: 212.817.1510 | compsci@gc.cuny.edu