Category Archives: ALADDIN Center

MillerFest 2006

(Maverick’s note: There are just about a million events occurring on campus that weekend during CS50. See my next post.)

You’re Invited to Celebrate Gary Miller’s 60th Birthday at MillerFest 2006!

April 19-20, 2006
Carnegie Mellon University, Pittsburgh, PA

We are celebrating Gary Miller’s 60th birthday this spring with a banquet and workshop. The banquet will be held Wednesday evening, April 19th, at the Pittsburgh Athletic Association, with the workshop occurring on Carnegie Mellon’s campus the following day. The workshop will feature presentations related to Professor Miller’s research achievements, including computational number theory, randomized algorithms, parallel algorithms, and scientific computing.

For more information, please see the workshop web site:

http://www.aladdin.cs.cmu.edu/workshops/millerfest/

** REGISTRATION IS REQUIRED **

There is no fee to attend the workshop if you register by Monday, April 3rd. There is small fee to attend the banquet, which promises to be an enjoyable evening featuring reminiscences about the life and career of Professor Miller.

** HOTEL DEADLINE EXTENDED TO APRIL 3RD **

Out-of-town visitors should make their hotel reservations by Monday, April 3rd,* to take advantage of the pre-negotiated workshop rate of \$105 per night (\$119.70 including taxes) at the Holiday Inn near campus. To make your reservations, call the the Holiday Inn (100 Lytton Avenue, Pittsburgh, PA 15213) at 412-682-6200 and be sure to ask for the ALADDIN Workshop rate.

You may also be interested to know that MillerFest is being held in conjunction with CS50, which celebrates fifty years of computer science at Carnegie Mellon. Please see http://www.cs50.cs.cmu.edu/ for a complete schedule of CS50 events.

We look forward to seeing you at MillerFest!

Susan Hrishenko, ALADDIN Center Assistant Director
for MillerFest organizers Guy Blelloch, Alan Frieze, and Shanghua Teng

MillerFest 2006

You’re Invited to Celebrate Gary Miller’s 60th Birthday at MillerFest 2006!

April 19-20, 2006
Carnegie Mellon University, Pittsburgh, PA

We are celebrating Gary Miller’s 60th birthday this spring with a banquet and workshop. The banquet will be held Wednesday evening, April 19th, at the Pittsburgh Athletic Association, with the workshop occurring on Carnegie Mellon’s campus the following day. The workshop will feature presentations related to Professor Miller’s research achievements, including computational number theory, randomized algorithms, parallel algorithms, and scientific computing.

For more information, please see the workshop web site:

http://www.aladdin.cs.cmu.edu/workshops/millerfest/

Please register online as soon as possible since this will help us with planning. There is no fee to attend the workshop if you register by Monday, April 3rd. There is small fee to attend the banquet, which promises to be an enjoyable evening featuring reminiscences about the life and career of Professor Miller.

Out-of-town visitors should make their hotel reservations by Wednesday, March 29th, to take advantage of the pre-negotiated workshop rate of \$105 per night (\$119.70 including taxes) at the Holiday Inn near campus. To make your reservations, call the the Holiday Inn (100 Lytton Avenue, Pittsburgh, PA 15213) at 412-682-6200 and be sure to ask for the ALADDIN Workshop rate.

You may also be interested to know that MillerFest is being held in conjunction with CS50, which celebrates fifty years of computer science at Carnegie Mellon. Please see http://www.cs50.cs.cmu.edu/ for a complete schedule of CS50 events.

We look forward to seeing you at MillerFest!

Guy Blelloch, Alan Frieze, and Shanghua Teng

Flexible Network Design Workshop

ALADDIN WORKSHOP ON FLEXIBLE NETWORK DESIGN
November 4-5, 2005
Princeton University

Network Design with its many variants is one of the most active mathematical research areas involving researchers from Theoretical Science, Graph Theory, Operations Research, Discrete Optimization, Game Theory and Information Theory.

The goal of this workshop is to focus on this active area of applications of algorithms to understand current trends, identify understudied areas, and formulate new directions for further investigation. To this end, the workshop participants include an eclectic mix of experts from real-world network design and deployment, graph algorithms, network coding, algorithmic mechanism design applied to pricing problems in networks, and configuration and routing of networks.

REGISTRATION AND ADDITIONAL INFORMATION

There is no fee to attend this workshop, but advance registration is required. For more details about the workshop and to register online, please visit http://www.aladdin.cs.cmu.edu/workshops/netdes/index.html.

QUESTIONS?

For questions about registration, please contact Susan Hrishenko at Carnegie Mellon University, (email susan027@cs.cmu.edu or phone 412-268-7317). For questions about local arrangements, please contact Mitra Kelly at Princeton University (email mkelly@cs.princeton.edu or phone 609-258-4562).

FriezeFest 2005 and FOCS 2005

This will be a “long weekend” for many of us. :P

On Friday and Saturday, there will be FriezeFest. As of this morning, all the abstracts for FriezeFest are up. There is already some press coverage about FriezeFest on the Pittsburgh Post-Gazette.

On Saturday afternoon, there will be two FOCS Tutorials, colocated in the same building with FriezeFest. Subhash’s session is also listed on the FriezeFest schedule, so he may get an interesting mix of audience in the auditorium. As for Bernard’s, well, he may get some “competition” from FriezeFest, but then he’s going to get a hardwood floor ballroom. At CMU we hold a lot of music and dance events there. If there can be music before his session, would it be Jazz?

FOCS will be in downtown Pittsburgh from Sunday to Tuesday. The program has been published for some time. Of special note is the panel discussion at the business meeting on Sunday night. The topic will be “Exciting the public about (theoretical) Computer Science”. Does that mean we need more beverage or less beverage during the business meeting? :P

Incidentally, there is also a joint meeting of the National Association of Science Writers and Council for the Advancement of Science Writing in the same hotel with FOCS. Their theme will be about Science in Society and New Horizons in Science. Perhaps we can get some science writers to come over to the business meeting and get them excited about TCS?

Finally, there is an increased number of talks at CMU this week due to people flying in for FOCS. You can see the long list of events on the frontpage of this blog. Oops, Dorit Hochbaum is about speak in this week’s OR Seminar in roughly -5 minutes… Got to go.

Minutes from Town Meeting 2005

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.

Peekaboom Slashdotted

Luis officially launched Peekaboom a couple days back, but the even more “real” launch is actually today.

Here is the story on Pittsburgh Post-Gazette and this is the presentation Roy has made on it. Roy is a member of the Peekaboom team that Luis has assembled in REU.

Lamps of Aladdin 2005-05-11

LAMPS OF ALADDIN ANNUAL PROJECT REVIEW
Wednesday, May 11, 2005
10:00 am – 5:00 pm
Newell Simon Hall 3305

You are invited to attend any sessions of interest during this day-long workshop in which students will present their recent research results or outline ongoing work. The primary purpose of this review is to inform other students and faculty of research that is going on as part of ALADDIN and associated projects. The talks will be conference length (about 20 minutes) and aimed for a general theory audience. We plan to have enough time to include ample discussion.

Agenda and Abstracts: http://www.aladdin.cs.cmu.edu/workshops/lamps05/index.html
More Information: Susan Hrishenko, x8-7317, susan027 @ cs dot cmu dot edu

TENTATIVE SCHEDULE – Wednesday, May 11, 2005
Read more »