Wednesday, June 5, 2013

[DMANET] Workshop at CCI/Princeton, August 27-29, 2013: "Horizons in TCS: A Celebration of Mihalis Yannakakis's 60th Birthday."

**************************************************************

Call for Participation

**************************************************************

Workshop at the Center for Computational Intractability (CCI),
Princeton University, NJ:

Workshop Title:

"Horizons in Theoretical Computer Science:
A Celebration of Mihalis Yannakakis's 60th Birthday."

Dates: August 27-29, 2013.

Online registration is now open at the workshop's web page:

http://intractability.princeton.edu/blog/2013/01/mihalisfest-2013/

Registration is free but mandatory for all workshop participants.

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, TBA
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 Yannakakis)

Organizers:
----------
Rajeev Alur (U. Penn)
Kousha Etessami (U. Edinburgh)
Christos Papadimitriou (U. C. Berkeley)
Moshe Vardi (Rice U.)
Vijay Vazirani (Georgia Tech)
Avi Wigderson (IAS)


See the workshop's web page for more information:

http://intractability.princeton.edu/blog/2013/01/mihalisfest-2013/

**************************************************************

--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************