Erik Demaine's List of Events

Disclaimer Unparsable date `  where: University of New York Graduate Center, New York, New York, USA   url: http://matthewpjohnson.org/fwcg2016/' at DateRange.pm line 63, line 2365. Unparsable date `  when: April 5-7, 2017' at DateRange.pm line 63, line 2948. Unparsable date `Dec 7, 2012' at DateRange.pm line 63, line 6712. Unparsable date `Jan 9, 2013' at DateRange.pm line 63, line 6712. Unparsable date `August 29--September 1, 2017' at DateRange.pm line 63, line 8527.
Calendar for
Search for keywords in sorted by
          Note: Searching for nothing will return all events, sorted as you like.

FOCS 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998

FOCS 2012: 53rd Annual IEEE Symposium on Foundations of Computer Science

Due: April 4, 2012 (5pm PDT)
When: October 20-23, 2012
Where: New Brunswick, New Jersey
Accept: June 24, 2012
Final: August 15, 2012
URL: http://theory.stanford.edu/~tim/focs12/
Topic: algorithms, complexity

FOCS 2011: 52nd Annual IEEE Symposium on Foundations of Computer Science

Due: April 13, 2011 (7pm PST)
When: October 23-25, 2011
Where: Palm Springs, California, USA
Accept: July 1, 2011
Final: August 15, 2011
URL: http://www.cs.ucla.edu/~rafail/FOCS11/
Topic: algorithms, complexity
PC: Nir Ailon (Technion), Eli Ben-Sasson (Technion), Serge Fehr (CWI Amsterdam), Juan A. Garay (AT&T Labs--Research), Russell Impagliazzo (IAS and University of California, San Diego), Sandy Irani (University of California, Irvine), Kamal Jain (Microsoft Research, Redmond), Stefano Leonardi (Sapienza University of Rome), Richard Lipton (Georgia Tech), Claire Mathieu (Brown University), Dieter van Melkebeek (University of Wisconsin, Madison), Muthu Muthukrishnan (Rutgers University), Ashwin Nayak (University of Waterloo and Perimeter Institute), Rafail Ostrovsky (chair; University of California, Los Angeles), Boaz Patt-Shamir (MIT and Tel Aviv University), Tim Roughgarden (Stanford University), Rocco Servedio (Columbia University), Adam Smith (Pennsylvania State University), Kunal Talwar (Microsoft Research, Silicon Valley), Chris Umans (Caltech), Chee Keng Yap (New York University), Lisa Zhang (Alcatel-Lucent Bell Labs)

FOCS 2010: 51st Annual IEEE Symposium on Foundations of Computer Science

Due: April 7, 2010 (7pm PST)
When: October 23-26, 2010
Where: Las Vegas, Nevada, USA
Accept: June 29, 2010
Final: August 7, 2010
URL: http://theory.stanford.edu/focs2010/
Topic: algorithms, complexity
PC: Scott Aaronson (Massachusetts Institute of Technology), Dorit Aharonov (Hebrew University), Eli Ben-Sasson (Technion), Julia Chuzhoy (Toyota Technological Institute at Chicago), Ryan O'Donnell (Carnegie Mellon University), Roberto Grossi (University of Pisa), Nick Harvey (University of Waterloo), Adam Kalai (Microsoft Research), Nicole Immorlica (Northwestern University), Yuval Ishai (Technion and University of California, Los Angeles), Lap Chi Lau (The Chinese University of Hong Kong), James Lee (University of Washington), Tal Malkin (Columbia University), Joe Mitchell (Stony Brook University), Dana Moshkovitz (Institute for Advanced Study), S. Muthukrishnan (Rutgers University), Christos Papadimitriou (University of California, Berkeley), Sofya Raskhodnikova (Penn State University), Steve Skiena (Stony Brook University), Mikkel Thorup (ATT Research), Luca Trevisan (chair; Stanford University and University of California, Berkeley), Eric Vigoda (Georgia Institute of Technology)

FOCS 2009: 50th Annual IEEE Symposium on Foundations of Computer Science

Due: April 2, 2009 (18:59 EDT; papers); April 9, 2009 (18:59 EDT; paper descriptions)
When: October 24-27, 2009
Where: Renaissance Atlanta Hotel Downtown, Atlanta, Georgia, USA
Accept: June 25, 2009
Final: August 7, 2009
URL: http://www.cs.yale.edu/focs09/, http://www.cc.gatech.edu/focs2009/
Topic: algorithms, complexity
PC: Sanjeev Arora (Princeton University), Maria Florina Balcan (Microsoft Research), Boaz Barak (Princeton University), Mark Braverman (Microsoft Research), Amit Chakrabarti (Dartmouth College), Ken Clarkson (IBM Almaden Research Center), Alon Efrat (University of Arizona), Martin Fürer (Pennsylvania State University, visiting University of Zürich), Anna Gilbert (University of Michigan), Phil Klein (Brown University), Ming Li (University of Waterloo), Mihai Pătraşcu (IBM Almaden Research Center), Dana Ron (Tel-Aviv University), Tim Roughgarden (Stanford University), Daniel Spielman (Chair) (Yale University), Mario Szegedy (Rutgers University), Kunal Talwar (Microsoft Research), Eli Upfal (Brown University), Umesh Vazirani (University of California at Berkeley), Vijay Vazirani (Georgia Institute of Technology), Berthold Vöcking (RWTH Aachen University)

FOCS 2008: 49th Annual IEEE Symposium on Foundations of Computer Science

Due: April 11, 2008 (19:59 EDT; formerly April 20, 2008)
When: October 26-28, 2008
Where: Loews Hotel Philadelphia, Philadelphia, Pennsylvania, USA
Accept: June 25, 2008
Final: August 1, 2008
URL: http://www.cs.cmu.edu/~FOCS2008/
Topic: algorithms, complexity
Register count: 270

FOCS 2007: 48th Annual IEEE Symposium on Foundations of Computer Science

Due: April 20, 2007 (19:59 EDT)
When: October 21-23, 2007
Where: Renaissance Providence Hotel, Providence, Rhode Island, USA
Accept: July 1, 2007
Final: August 10, 2007
URL: http://focs2007.cs.brown.edu
Topic: algorithms, complexity
PC: Dimitris Achlioptas, Timothy Chan, Julia Chuzhoy, Faith Ellen, Piotr Indyk, Kamal Jain, T.S. Jayram, Robert Kleinberg, Adam Klivans, James R. Lee, Anna Lysyanskaya, Daniele Micciancio, Gary Miller, Moni Naor, Alexander Razborov, Yaoyun Shi, Alistair Sinclair (chair), Luca Trevisan, Christopher Umans, Uri Zwick
Register count: 250
Plenary: Terrance Tao, Dan Boneh, Daniel Spielman
Paper count: 302 (submitted), 66 (accepted)
OC: Philip Klein (cochair), Anna Lysyanskaya (cochair), Claire Mathieu (cochair)

FOCS 2006: 47th Annual IEEE Symposium on Foundations of Computer Science

Due: April 11, 2006 (16:59 EDT)
When: October 22-24, 2006
Where: Doubletree Hotel, Berkeley, California, USA
Accept: June 26, 2006
Final: August 5, 2006
URL: http://focs06.cs.princeton.edu/, http://www.stanford.edu/~saberi/focsprogram.html
Topic: algorithms, complexity
Register count: 220 (approximately)
PC: Rajeev Alur, Matthew Andrews, Sanjeev Arora (chair), Avrim Blum, Moses S. Charikar, Shuchi Chawla, Jeff Erickson, Lisa K. Fleischer, Lance Fortnow, Ravi Kannan, Sampath Kannan, Haim Kaplan, Anna Karlin, Joe Kilian, Guy Kindler, Ashwin Nayak, Christos Papadimitriou, Harald Raecke, Rajmohan Rajaraman, Dana Randall, Michael Saks, Daniel A. Spielman, Peter Winkler
Paper count: 243 (submitted), 71 (accepted)
Plenary: Richard Karp, Terry Sejnowski, Jon Kleinberg

FOCS 2005: 46th Annual IEEE Symposium on Foundations of Computer Science

Due: April 8, 2005 (16:59 EDT)
When: October 23-25, 2005 (conference); October 22, 2005 (tutorials)
Where: Omni William Penn Hotel, Pittsburgh, Pensylvania, USA
Accept: June 24, 2005
Final: August 5, 2005
URL: http://www.cs.cornell.edu/Research/focs05/, http://www.cs.cmu.edu/~FOCS05/
Note: Preceded by Frieze Fest.
Topic: algorithms, complexity
Plenary: Subhash Khot, Bernard Chazelle, Mihalis Yannakakis
Paper count: 276 (submitted), 62 (accepted)

FOCS 2004: 45th Annual IEEE Symposium on Foundations of Computer Science

Due: April 9, 2004 (4:59pm EDT)
When: October 17-19, 2004
Where: Rome, Italy
Accept: June 25, 2004
Final: July 30, 2004
URL: http://www.cs.brown.edu/~aris/focs04/
Topic: algorithms, complexity
Paper count: 272 (submitted), 64 (accepted)

FOCS 2003: 44th Annual IEEE Symposium on Foundations of Computer Science

Due: April 7, 2003
When: October 11-14, 2003
Where: Cambridge, Massachusetts, USA
Accept: June 25, 2003
Final: July 24, 2003
Register: September 19, 2003 (early)
URL: http://theory.lcs.mit.edu/FOCS03
Topic: algorithms, complexity
Plenary: Avrim Blum, Dana Randall, Eli Upfal

FOCS 2002: 43rd Annual IEEE Symposium on Foundations of Computer Science

Due: April 25, 2002 (16:59 EST)
When: November 16-19, 2002
Where: Vancouver, British Columbia, Canada
Accept: July 2, 2002
Final: August 20, 2002
URL: http://www.mitacs.math.ca/focs02/, http://www.cs.princeton.edu/focs02
Topic: algorithms, complexity
Plenary: Oded Goldreich, Éva Tardos, Salil Vadhan

FOCS 2001: 42nd Annual IEEE Symposium on Foundations of Computer Science

Due: April 27, 2001 (17:59 EDT)
When: October 14-17, 2001
Where: Las Vegas, Nevada, USA
Accept: July 6, 2001
Final: August 10, 2001
URL: http://theory.stanford.edu/focs2001
Topic: algorithms, complexity
Plenary: Christos Papadimitriou, Piotr Indyk, Madhu Sudan

FOCS 2000: 41st Annual Symposium on Foundations of Computer Science

Due: April 28, 2000 (17:59 EDT)
When: November 12-14, 2000
Where: Redondo Beach, California, USA
Accept: July 3, 2000
Final: August 31, 2000
Register: October 19, 2000 (early; extended)
URL: http://www.cs.cmu.edu/~FOCS2000/
Tags: attended, paper, presented
Topic: algorithms, complexity
Plenary: Jeffrey D. Ullman

FOCS 1999: 40th Annual Symposium on Foundations of Computer Science

Due: April 23, 1999
When: October 17-19, 1999
Where: New York City, New York, USA
Accept: July 1, 1999
Final: August 6, 1999
Hotel: September 15, 1999
Register: September 15, 1999 (early)
URL: http://www.cs.washington.edu/focs99
Tags: attended
Topic: algorithms, complexity

FOCS 1998: 39th Annual Symposium on Foundations of Computer Science

Due: May 4, 1998 (16:59 EST)
When: November 8-11, 1998
Where: Palo Alto, California, USA
Accept: July 1, 1998
Final: August 17, 1998
URL: http://Theory.Stanford.EDU/~focs98/
Tags: attended
Topic: algorithms, complexity