[CSDM] [pvsnp-all] Mihalis Yannakakis celebration, Aug 27-29

Moses S. Charikar moses at CS.Princeton.EDU
Tue Jul 23 10:43:45 EDT 2013


We have an exciting program with an all star cast of speakers
assembled to celebrate Mihalis Yannakakis' 60th birthday at
Princeton, Aug 27-29. The program and details are here (also see below):
http://intractability.princeton.edu/blog/2013/01/mihalisfest-2013/

IMPORTANT:
If you want to avail of Princeton university hotel rates at the
Nassau Inn, you need to make a reservation in the next few days.
The cutoff is Wed July 31. After this, we cannot guarantee
availability of rooms at the reduced rate. The Nassau Inn
phone number is 1-800-862-7728. Use workshop Booking ID 17888.
The rate is available if you book over the phone and not online.

We have some travel/accommodation support for students and postdocs.
You need to apply via the website above, and your faculty reference
letter must arrive by Monday, July 29 in order to be considered.

Please forward this message to local mailing lists.
We look forward to seeing you there!

Cheers,
Moses


Tentative Program/Schedule:

Tuesday August 27

9:00-10:00 – Christos Papadimitriou, "Algorithms, Complexity, and Mihalis"
10:00-11:00 – Vijay Vazirani, "Dichotomies in Equilibrium Computation: Markets Provide a Surprise"
11:00-11:30 – coffee break
11:30-12:30 – Rajeev Alur, "Regular Functions"

12:30-2:00   Lunch

2:00-3:00 – Jeffrey Ullman, "Computation/Communication Tradeoffs for MapReduce"
3:00-4:00 – David Johnson, "Open and Closed Problems in NP-Completeness"
4:00-4:30 – coffee break
4:30-5:30 – Gerard Holzmann, "Proof or Consequences"
5:30-6:30 – drinks reception

Wednesday August 28

9:00-10:00 – Uriel Feige, "Exploring the Border between P and NP"
10:00-11:00 – Ronald de Wolf, "Exponential Lower Bounds for Polytopes in Combinatorial Optimization"
11:00-11:30 – coffee break
11:30-12:30 – Moshe Vardi, "The Rise and Fall of Linear Temporal Logic"

12:30-2:00   Lunch

2:00-3:00 – Phokion Kolaitis, "Aspects of Database Query Evaluation"
3:00-4:00 – Lisa Zhang, "Multi-Carrier Multi-Rate Utility Optimization in Heterogeneous Networks via CSMA-Based Algorithms"
4:00-4:30 – coffee break
4:30-5:30 – Kousha Etessami, "Probability, Recursion, Games, and Fixed Points"

Thursday August 29

9:00-10:00 – Sanjeev Arora, "Is Intractability a Barrier in Machine Learning?"
10:00-11:00 – Eva Tardos, "Games, Auctions, Learning, and the Price of Anarchy"
11:00-11:30 – coffee break
11:30-12:30 – David Lee, "Memory Efficient Routing Table Design and Fast IP Lookup for High-end Core Routers"

12:30-2:00   Lunch

2:00-3:00 – Georg Gottlob, "Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics"
3:00-4:00 – Ilias Diakonikolas, "Approximation in Multiobjective Optimization"
4:00-4:30 – coffee break
4:30-5:30 – Final Remarks (Mihalis)


_______________________________________________
pvsnp-all mailing list
pvsnp-all at lists.cs.princeton.edu
https://lists.cs.princeton.edu/mailman/listinfo/pvsnp-all


More information about the csdm mailing list