A Polynomial-Time Algorithm for Global Value Numbering SAS 2004 Sumit Gulwani George C. Necula.
Quantum Computing and the Limits of the Efficiently Computable Scott Aaronson MIT.
Part III: Polyhedra d: Alexandrov to Sabitov Joseph ORourke Smith College.
Part III: Polyhedra a: Folding Polygons Joseph ORourke Smith College.
Analysis of Algorithms NP & NP-Complete Prof. Muhammad Saeed.
1 Approximability Results for Induced Matchings in Graphs David Manlove University of Glasgow Joint work with Billy Duckworth Michele Zito Macquarie University.
1 A Black-Box approach to machine learning Yoav Freund.
Checking -Calculus Structural Congruence is Graph Isomorphism Complete Victor Khomenko 1 and Roland Meyer 2 1 School of Computing Science, Newcastle.
January 12 Zero-Knowledge Proofs (2)Maaike Zwart, Suzanne van WijkMoL Research Project 0 Knowledge Proofs(2) Suzanne van Wijk & Maaike Zwart Zero.
AlgoPerm2012 - 13 Laurent Bulteau
Dynamic Programming Over Graphs of Bounded Treewidth
Vertex cover Problem
