CS Theory town hall meeting
Introductions
Danny Sleator
Manuel Blum
Rick Statman – computability theory, resources in math dept, Alan Frieze, Tom Bohman, Oleg Pikhurko
Gary Miller – Sparse systems, class on numerical methods and spectral stuff
David Abraham – 2 sided matching markets
Abraham Flaxman – algorithms and uncertainty, take minutes, last year grad student, lets pool resources
Steven Rudich
Daniel Golovin – approx algorithms, uncertainty in input but not average case
Adam Weirman – 5ht year with Mor Harchol-Balter, scheduling and queues
Mugizi Rwebangira – learning labeled, unlabeled
David Offner – approximation algorithm, graph algorithms, and pure combinatorics
Pall Melsted – Graphs algorithms
Barbara Anthony – robust optimization
Don Sheehy – computational geom, 1st year
Roy Liu – masters student with Manuel and Luis
Michelle Goodstein – applied algorithms
Luis von Ahn – trying to graduate, makes stuff up
Mike Mass — 1st year combinatorial and graph algorithms
Hector – visiting Luis heading to TTI
Srinath Sridhar – comp biology, evolutionary trees, data structures
Mohit Singh – approx
Vineet Goyal – approx, robust optimization and approximation
Mike Rochash – programming languages and applications
Dan Blandford – compressed data structures
Konstantin Andreev – 6th year with Bruce Maggs
Guy Blelloch – graph compression, data structures
Stefano Leondari – visiting for year, approx online game theory complex networks
Dan Licada – logic and pl with bob harper
Phil Gibbons – Intel lab, has algorithm questions come out of systems work, and needs runners for pretty good race Friday
Avrim Blum – machine learning approximation algorithms online algorithms.
ACO students from math and Tepper are here. Now there is a new official way for cs students to get involved in ACO– CS with minor in ACO. Take 3 semesters of courses from math and Tepper and go to ACO seminar. No application necessary.
FOCS conference here this fall. Avrim and Anupam are local chairs, they will need help. Especially reviews of local restaurants, 20 bucks per review (max 1 per person).
Anupam Gupta – approximation algorithm, metric embeddings, course this semester on approximation algorithms. Will put up a wiki for FOCS restaurants. Has other tasks for people to help with for FOCS, i.e. Registration,
Maverick Woo – 6th year, data structures, dynamic connectivity, worst case stuff, and graph theory, like preconditioners. Runs the theory group web server.
Hubert Chen – 4th year graph algorithms and metric embeddings algorithms
Katrina Ligett – taking over organizing theory lunch, which will be 12-1 on Wednesday in NSH 1507. weekly talk, usually by a student, fairly informal.
Seminars
Seminars – Theory Lunch Wednesdays 12-1, Theory Seminar Friday 3:30-4:30, ACO Seminar Thursday 4-5, Fri 2-3:30 OR seminar.
Should we schedule the OR and Theory seminars so that people do not have to run from one side of campus to the other?
Theory Announce mailing list, email Katrina to get added.
Scribes for theory lunch?
Other places are doing it. Quick thing, posted publicly or otherwise.
Maybe we should just record the questions and answers and post that.
Danny: is that for us or for pr? It could be good for pr.
Anupam: maybe the open questions and concluding comments would be valuable.
Stefano: A 1 page annotated bibliography
or maybe suggest a paper or two.
Blog
Maverick has started a blog, http://magic.aladdin.cs.cmu.edu, which has talks and abstracts and stuff.
Feedback from talks
Should we implement some system to provide feedback to speakers. Maybe an open ended form modeled on the speaking requirement form to give the speaker feedback. Suggestions to Katrina.
Wiki for a huge annotated bibliography
Daniel thinks is would be nice to have a knowledge base, especially for new students to get info on areas. This has already been planned, the Aladdin center’s algorithm depot. But not implemented. Maybe a wiki would work.
Share resources
If you know of other stuff that everyone should know, tell Katrina or post on wiki.
