D a t e	S p e a k e r	H o s t
23 - 29  May  2 0 0 4
August 18 Wednesday Wean 7220 2:30 - 4:00 pm	Salil Vadhan, Harvard University Using Nondeterminism to Amplify Hardness	ALADDIN/Theory Seminar

12 - 18 Sept  2 0 0 4
September 15, Wednesday Wean 4623 12 AM-1 PM	Luis von Ahn Covert Two-Party Computation	Theory Lunch Seminar
September 17 Friday Wean 4623 3:30	Silvio Micali, MIT Collusion-free Protocols abstract	ALADDIN/Theory Seminar

19 - 25 Sept  2 0 0 4
September 19, Sunday Williamsburg, Virginia	Workshop on Meshing for Computational Biology in conjunction with IMR 2004	Aladdin workshops
September 22, Wednesday noon-1:00pm, NSH 1507	Maverick Woo A Brief History of History Independent Data Structures	Theory Lunch Seminar

26 Sept  - 2 Oct 2 0 0 4
october 1, Friday Wean 7220 3:30	Serafim Batzoglou, Stanford Algorithms for multiple sequence alignment of genomes and proteins (abs)	ALADDIN/Theory Seminar
September 29, Wednesday noon-1:00pm NSH 1507	Alex Slivkins Triangulation and Embedding Using Beacons	Theory Lunch Seminar

3 - 9 Oct 2 0 0 4
October 6, Wednesday noon-1:00pm, Wean 4623	Ryan Williams Better Lower Bounds for SAT and Related Problems	Theory Lunch Seminar
October 8, Friday	Richard Ladner, University of Washington Windows Scheduling (abstract)	ALADDIN/Theory Seminar

10 - 16 Oct 2 0 0 4
October 12, Tuesday 12:30-1:30 PM OSC 200	Abie Flaxman The diameter of randomly perturbed digraphs and some applications	ACO Seminar
October 13, Wednesday noon-1:00pm NSH 1507	Lea Kissner Private and Threshold Set-Intersection	Theory Lunch Seminar
October 15 Friday Wean 5409 3:30 pm	Gary Miller, Carnegie Mellon University Representing Topological Structures with Degeneracies	ALADDIN/Theory Seminar

17 - 23 Oct 2 0 0 4
October 19, Tuesday 12:30-1:30 PM OSC 200	Barbara Anthony Multicommodity Flow with Holding Costs	ACO Seminar
October 20, Wednesday noon-1:00pm NSH 1507	Taka Osogami Approximating probability distributions	Theory Lunch Seminar
October 21, Wednesday noon NSH 3305	Cynthia Dwork, Microsoft Research Towards Privacy in Public Databases (abs)	Data Privacy Lab ALADDIN Center
October 22 Friday 3:30 pm	Mid-Semester Break and CS Retreat (No Theory Seminar)

24 - 30 Oct 2 0 0 4
October 26, Tuesday 12:30-1:30 PM OSC 200	Kelley Burgin Hamilton Cycles in Random Lifts of Graphs	ACO Seminar
October 27, Wednesday noon-1:00pm NSH 1507	Brendan McMahan Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary	Theory Lunch Seminar
October 28 – 29, noon-1:00pm NSH 1507	Market Design Workshop	Aladdin workshops

31 Oct 2 0 0 4 - 6 Nov
November 2, Tuesday 12:30-1:30 PM OSC 200	Juan Vera A geometric preferential attachment model of networks	ACO Seminar
November 3, Wednesday noon-1:00pm NSH 1507	Abie Flaxman Online convex optimization: gradient descent without a gradient	Theory Lunch Seminar
November 5 Friday WeH 7220 3:30 pm	Evelina Toumpakari, Math Department, University of Chicago On the Abelian Sandpile Model (abstract)	ALADDIN/Theory Seminar

17 - 20 Nov 2 0 0 4
November 17, Wednesday noon-1:00pm NSH 1507	Srinath Sridhar On the reconstruction of evolutionary trees	Theory Lunch Seminar
November 19 Friday WeH 7220 3:30 pm	Uriel Feige, Weizmann Institute and Microsoft Research Improved Approximation Algorithms for Minimum-weight Vertex Separators (abstract)	ALADDIN/Theory Seminar

21 - 28 Nov 2 0 0 4
November 23, Tuesday 12:30-1:30 PM OSC 200	Mohit Singh Randomized Rounding for Spanning Trees	ACO Seminar

28 Nov - 4Dec 2 0 0 4
November 30, Tuesday 12:30-1:30 PM OSC 200	Paul Gartside Enumerating Brunnian Links	ACO Seminar
December 1, Wednesday noon-1:00pm NSH 1507	Maria-Florina Balcan A Theoretical Model for Learning from Labeled and Unlabeled Data	Theory Lunch Seminar
December 3, Friday WeH 7220 3:30 pm	Jon Kleinberg, Cornell University Cascading Behavior and Bursty Dynamics in Computational Models of Social Networks (abstract)	ALADDIN/Theory Seminar

5 - 11 Dec 2 0 0 4
December 1, Wednesday noon-1:00pm NSH 1507	Maria-Florina Balcan A Theoretical Model for Learning from Labeled and Unlabeled Data	Theory Lunch Seminar
December 10, Friday WeH 7220 3:30 pm	Harry Raecke, Post-Doctoral Fellow, Aladdin Center Oblivious Routing in Directed Graphs with Random Demands (abstract)	ALADDIN/Theory Seminar

12 - 18 Dec 2 0 0 4
December 15, Wednesday noon-1:00pm NSH 1507	Amy Ward Optimal Control of High Volume Assemble-to-Order Systems	Theory Lunch Seminar

9 - 15 Jan 2 0 0 5
January 12 Wednesday noon-1:00pm NSH 1507	Shuchi Chawla Algorithms for Path Planning	Theory Lunch Seminar

16 - 22 Jan 2 0 0 5
January 19 Wednesday noon-1:00pm NSH 1507	Shuheng Zhou On Hierarchical Routing in Doubling Metrics	Theory Lunch Seminar
January 21 Friday 3:30pm, 4625 Wean	Mohammad Taghi Hajiaghayi, CSAIL, Massachusetts Institute of Technology Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and (Local) Treewidth (abs)	ALADDIN/Theory Seminar

30 Jan - 2 Feb 2 0 0 5
February 1 Tuesday 2:00 pm, 7220 Wean	George Riley, Georgia Institute of Technology The Georgia Tech Network Simulator (abstract)	ALADDIN/Theory Seminar
February 2 Wednesday noon-1:00pm NSH 1507	Eyal Even-Dar Fast Convergence of Selfish Rerouting	Theory Lunch Seminar
February 3 Thursday 4:30-5:30 PM	Jerzy Wojciechowski Induced Cycles in Powers of Complete Graphs	ACO Seminar

6 - 12 Feb 2005
February 9 Wednesday noon-1:00pm NSH 1507	Chris Wang Dynamic Optimality and Multi-Splay Trees	Theory Lunch Seminar
February 11 Friday 3:30pm, 4625 Wean	Chandra Chekuri, Bell Labs Multicommodity flow, well-linked terminals, and routing problems abstract	ALADDIN/Theory Seminar

13 - 19 Feb 2005
February 16 Wednesday noon-1:00pm NSH 1507	Ryan Williams Reingold's Theorem: L = SL Or, How to find long paths while being very forgetful	Theory Lunch Seminar
February 18 Friday 12:30 - 1:30 pm Mellon Auditorium	William Pulleyblank, IBM Business Consulting Services BlueGene and Business Optimization (abstract)	ALADDIN/Theory Seminar

20 - 26 Feb 2005
February 21 Monday 10:30am, 5409 Wean Hall	Subhash Khot, Georgia Institute of Technology On Embeddability of Negative Type Metrics into L_1 (abstract)	ALADDIN/Theory Seminar
February 23, Wednesday Wean 4623 12 AM-1 PM	Ryan Williams Reingold's Theorem	Theory Lunch Seminar
February 25 Friday 10:30am - SENSQ 5317	Eva Tardos Network Games and the Price of Stability or Anarchy (abstract and biography)	CS Distinguished Lecturer Series, University of Pittsburgh
February 25 Friday 4:30 pm WEH 7500	A. Ganesh, Microsoft, U.K. Computer worms: models and countermeasures (abstract)	Probability in Science and Industry SEMINAR SERIES

27 February - 6 March 2005
March 4 Friday 3:30pm	Mikhail (Misha) Alekhovich, Institute for Advanced Study Hard satisfiable instances for DPLL algorithms and other weak models of computation (abstract)	ALADDIN/Theory Seminar

14 - 20 March 2005
March 16 Wendesday Wean 4623 12 AM-1 PM	Mark Sandler	Theory Lunch Seminar

21 - 27 March 2005
Wednesday March 23 12:00 - 1:00 pm Wean Hall 4623	Harald Raecke, Carnegie Mellon University	Theory Lunch
Thursday March 24 4:30 pm Wean Hall 4623	Dan Spielman, MIT Lower-Stretch Spanning Trees abstract	Special ALADDIN/Theory Seminar
Friday March 25 3:30 pm Posner Hall 388	Klaus Truemper, University of Texas at Dallas Levels of Reasoning in Intelligent Systems and the Polynomial Hierarchy of Complexity Theory	Tepper School OR Seminar
Friday March 25 * 4:30 pm * Newell Simon Hall 3305	Dan Spielman, MIT Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems abstract	ALADDIN/Theory/ACO Seminar

28 March - 3 April 2005
Friday April 1 2:00 pm Room 145	Vijay Chandru, Computer Science & Automation, IISc, Founder & CEO, Strand Genomics In Silico Modeling for Decision Support in Drug Discovery and Development abstract	Tepper School OR Seminar
Wednesday March 1 12-1pm NSH 1507	Abie Flaxman Where the hard problems "really are" and worst-case average-case connections	Theory Lunch Seminar
March 31 Thursday 4:30-5:30 PM WEH 6423	Christopher Hanusa A Gessel-Viennot-Type Method for Cycle Systems	ACO Seminar
Friday April 1 3:30 pm * Wean Hall 7500 *	Leslie G. Valiant, Harvard University Memorization and Association on a Realistic Neural Model abstract	ALADDIN/Theory Seminar

3 - 9 April 2005
Monday April 4 3:00 pm 3305 NSH	Vladen Koltun, University of California, Berkeley Linear Programming and Arrangements abstract	Gary Miller ( Faculty Candidate Talk )
Wednesday April 6 2:00 pm NSH 1507	Virginia Vassilevska	Theory Lunch Seminars
Friday April 8 2:00 pm Posner Hall 343	Michel Goemans, MIT An Approximate Koenig's Theorem for Edge-Coloring Weighted Bipartite Graphs abstract	Tepper School OR Seminar

10 - 17 April 2005
Wednesday April 13 2:00 pm NSH 1507	Kirk Pruhs Speed Scaling to Manage Power	Tepper School OR Seminar

18 - 24 April 2005
Wednesday April 20 2:00 pm NSH 1507	Juan Vera Modeling the web: Preferential Attachment	Theory Lunch Seminars
Wednesday April 20 3:00 PM, NSH 3305	Sham Kakade, University of Pennsylvania Network Models and Algorithms for Strategic and Economic Reasoning	ALADDIN/Theory Seminar
April 21 Thursday 4:30-5:30 PM, WEH 6423	Abie Flaxman On the Average Case Performance of Some Greedy Approximation Algorithms for the Uncapacitated Facility Location Problem	ACO Seminar
April 22 Friday 3:30 pm 4625 WeH	Jason Hartline, Microsoft Derandomization of Auctions (abstract)	ALADDIN/Theory Seminar

25 April - 1May 2005
April 26 12:00pm-6:00pm Newell-Simon Hall 3305	Computational Molecular Biology Symposium	Department of Biological Sciences
Wednesday April 27 2:00 pm NSH 1507	Nina Balcan	Theory Lunch Seminars
Thursday, 28 April 10:00 AM, 3305 NSH	Subhash Khot, Georgia Institute of Technology Hardness of Approximation Results (abstract)	ALADDIN/Theory Seminar

1 - 7   M a y   2 0 0 5
Wednesday May 4 2:00 pm NSH 1507	Katrina Ligett	Theory Lunch Seminars

7 - 1 4   M a y   2 0 0 5
Wednesday May 11 NSH 3305	Lamps of ALADDIN Annual Project Review (No Theory Seminar)	ALADDIN Workshops

19 - 25 June  2 0 0 5
June 22th Wednesday 1:30pm Wean 5409	Shuchi Chawla Graph Algorithms for Planning and Partitioning	Theory Lunch Seminar
June 24th Friday 3:30pm 4625 Wean Hall	Piotr Indyk, MIT Embedding Metrics into the Plane (abstract)	ALADDIN/Theory Seminar

 

Seminars on Algorithms and Complexity
Archives