[DMANET] The New York Colloquium on Algorithms and Complexity - Friday, November 15th

We are pleased to invite you to NYCAC 6

Friday, November 15, 2013, New York City
The Graduate Center, CUNY
Room 4102 (Science Center)

NYCAC, the New York Colloquium on Algorithms and Complexity is an annual event. Its purpose is to give the opportunity to graduate students in New York to observe talks of researchers from all areas of the theory of Algorithms and Computational Complexity.

The website for this year's NYCAC, where you can register and find information is http://www.sci.brooklyn.cuny.edu/~zachos/nycac6/

The schedule of talks:

8:30 Registration and coffee
8:50 Charalampos (Babis) Papamanthou: Trustworthy Computing with Untrusted Resources
9:30 Rosario Gennaro: A Survey of Verifiable Delegation of Computations
10:10 Valia Mitsou: The Computational Complexity of the Game Set and its Theoretical Applications.
10:50 Break
11:05 Eric Allende: Revisiting some Questions about the Structure of Complete Sets
11:45 Kenneth W. Regan: Analyzing Quantum Circuits Via Polynomials
12:25 Wen-Ju Cheng: Random Walks and Log Space Complexity
13:00 Break
13:45 Costantinos Daskalakis: Reductions from Mechanism to Algorithm Design
14:25 Steve Homer: Trading Mutual Information for Efficient Computation
14:55 Dimitris Paparas: The Complexity of Non-Monotone Markets
15:30 END

We hope to see you there.
On behalf of the organizers,
Antonis Achilleos
**********************************************************
*
* 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/
*
**********************************************************