Saturday November 17th, 2007 

- Talks take place at Elebash Recital Hall -

10:00am-10:10

NYCAC Opening Remarks

Aggelos Kiayias (University of Connecticut)

Melvin Fitting (CUNY)

10:10am-10:35am

Anyone but Him: The Complexity of Precluding an Alternative

Lane Hemaspaandra (University of Rochester)

10:35am-11:00am

A Computational Model for Easy-to-Decide Counting Problems

Aris Pagourtzis (National Technical University of Athens)

11:00am-11:30am

MORNING COFEE BREAK

11:30am-11:55am

Faster Integer Multiplication

Martin Furer (Penn State University)

11:55am-12:20pm

Swapping Quantifiers

Aggelos Kiayias (University of Connecticut)

12:20pm-2:15pm

LUNCH BREAK

2:15pm-2:40am

A Content Integrity Service for Long-term Digital Archives

Stuart Haber (Hewlett Packard)

2:40pm-3:05pm

On Zero-knowledge Proofs and Applications

Moti Yung (Google Inc. and Columbia University)

3:05pm-3:35pm

AFTERNOON COFEE BREAK

3:35pm-4:00pm

On the Complexity of Nash Equilibria and Other Fixed Points

Mihalis Yannakakis (Columbia University)

4:00pm-4:25pm

Quantum classes and their classical counterparts

Steve Homer (Boston University)

4:25pm-4:50pm

LATE AFTERNOON BREAK

4:50pm-5:15pm

How Far Are We from Proving Circuit Size Lower Bounds?

Eric Allender (Rutgers University)

5:15pm-5:40pm

Models for Internet Graphs

Milena Mihail (Georgia Tech)

5:40pm-6:00pm

ENDING REMARKS

Ernesto Graf (Karl’s Kuehne Gassenschau / ETH Zurich (’82))