Erik Demaine's List of Events

Disclaimer Turn off help bubbles

Calendar for    
Search for keywords in sorted by    
           Note: Searching for nothing will return all events, sorted as you like.
Filter for events with dates no earlier than days, months, and years in the past.
Filter for events with dates no later than days, months, and years in the future.
Subfilter: include entries that match filters, not whole events.
Generate iCalendar

STOC 2016, 2015, 2014, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986, 1985, 1984, 1983, 1982, 1981, 1980, 1979, 1978, 1977, 1976, 1975, 1974, 1973, 1972, 1971, 1970, 1969


[map by MyWorld66, distributed under Creative Commons Attribution-ShareAlike 1.0 License]
[No map for MA; Massachusetts; Oregon]

STOC 2016: 48th ACM Symposium on Theory of Computing

Where: Boston, Massachusetts

STOC 2015: 47th ACM Symposium on Theory of Computing

Due: November 4, 2014 (3:59pm EST)
When: June 14–17, 2015
Where: Portland, Oregon
Accept: February 6, 2015
Final: March 19, 2015
URL: http://people.csail.mit.edu/ronitt/2015cfp.html [Wayback]
Parent: FCRC 2015

STOC 2014: 46th ACM Symposium on Theory of Computing

Due: November 11, 2013 (4:00pm EST)
When: May 31 – June 3, 2014
Where: New York, New York, USA
Accept: February 4, 2014
Final: March 19, 2014
URL: http://www.columbia.edu/~cs2035/stoc/stoc2014/ [Wayback]
Topics: algorithms, complexity
Paper
count:
322 submitted (100.0%)
91 accepted (28.3%)
Register
count:
372 total (100.0%)
171 students (46.0%)

STOC 2012: 44th ACM Symposium on Theory of Computing

Due: November 2, 2011 (4:59pm EST)
When: May 19–22, 2012
Where: New York, New York, USA
Accept: February 5, 2012
Final: March 23, 2012
URL: http://cs.nyu.edu/~stoc2012/ [Wayback]
Topics: algorithms, complexity
PC: Richard Cleve (Waterloo), Parikshit Gopalan (Microsoft Research SVC), Jason Hartline (Northwestern), Tom Hayes (New Mexico), Anna Karlin (UWashington), Sanjeev Khanna (Penn), Andrew McGregor (UMass), Rina Panigrahy (Microsoft Research SVC), Toniann Pitassi (chair; Toronto), Ran Raz (Weizmann), Charles Rackoff (Toronto), Satish Rao (Berkeley), Oded Regev (Tel Aviv & ENS Paris), Dana Ron (Tel Aviv), Guy Rothblum (Princeton and Microsoft Research SVC), Amin Saberi (Stanford), Rahul Santhanam (Edinburgh), Shubhangi Saraf (IAS), Daniel Spielman (Yale), Madhur Tulsiani (TTI Chicago), Suresh Venkatasubramanian (Utah), Avi Wigderson (IAS), David Williamson (Cornell)
OC: Yevgeniy Dodis (chair; NYU)

STOC 2011: 43rd ACM Symposium on Theory of Computing

Due: November 4, 2010 (4:59pm EST)
When: June 6–8, 2011
Where: San Jose, California, USA
Accept: February 3, 2011
Final: March 24, 2011
Topics: algorithms, complexity
Parent: FCRC 2011

STOC 2010: 42nd ACM Symposium on Theory of Computing

Due: November 5, 2009 (3:59 PST)
When: June 6–8, 2010
Where: Cambridge, Massachusetts, MA
Accept: February 9, 2010
Final: March 30, 2010
Topics: algorithms, complexity
After: Complexity 2010

STOC 2009: 41st ACM Symposium on Theory of Computing

Due: November 10, 2008 (abstracts); November 17, 2008 (papers)
When: May 31 – June 2, 2009
Where: Bethesda, Maryland, USA
Accept: February 6, 2009
URL: http://www.umiacs.umd.edu/conferences/stoc2009/ [Wayback]
Topics: algorithms, complexity
PC: Susanne Albers (Univ of Freiburg), Andris Ambainis (Univ of Latvia), Nikhil Bansal (IBM Research), Paul Beame (Univ of Washington), Andrej Bogdanov (Tsinghua Univ), Ran Canetti (Tel Aviv Univ), David Eppstein (UC Irvine), Dmitry Gavinsky (NEC labs), Leslie Ann Goldberg (Univ of Liverpool), Shafi Goldwasser (MIT), Nicole Immorlica (Northwestern Univ), Anna Karlin (Univ of Washington), Jonathan Katz (Univ of Maryland), Jonathan Kelner (MIT), Subhash Khot (New York Univ), Ravi Kumar (Yahoo! Research), Michael Mitzenmacher (chair; Harvard Univ), Kamesh Munagala (Duke Univ), Rasmus Pagh (IT Univ of Copenhagen), Anup Rao (Institute for Advanced Study), Rocco Servedio (Columbia Univ), Mikkel Thorup (AT&T Labs-Research), Chris Umans (California Inst of Technology), Lisa Zhang (Bell Laboratories)
OC: Jonathan Katz (Univ of Maryland), David Mount (Univ of Maryland), Aravind Srinivasan (chair, Univ of Maryland)

STOC 2008: 40th ACM Symposium on Theory of Computing

Due: November 19, 2007 (7:59pm EST)
When: May 17–20, 2008
Where: Victoria, British Columbia, Canada
Accept: February 4, 2008
Final: March 6, 2008
URL: http://www.csc.uvic.ca/~stoc2008/ [Wayback]; http://campus.acm.org/calendar/confpage.cfm?ConfID=2008-8396 [Wayback]
Topics: algorithms, complexity
PC: James Aspnes, Shai Ben-David, Shuchi Chawla, Bernard Chazelle, Steve Chien, Xiaotie Deng, Cynthia Dwork (Chair), Martin Dyer, Ronald Fagin, Joan Feigenbaum, Anupam Gupta, Venkatesan Guruswami, Konstantin Makarychev, Elchanan Mossel, Rafael Pass, Oded Regev, Omer Reingold, Ronitt Rubinfeld, David Shmoys, Luca Trevisan, Andrew Chi-Chih Yao
OC: Bruce Kapron, Valerie King, Venkatesh Srinivasan, Ulrike Stege

STOC 2007: 39th ACM Symposium on Theory of Computing

Due: November 20, 2006 (7:59pm EST)
When: June 11–13, 2007
Where: San Diego, California, USA
Accept: February 18, 2007
Final: March 23, 2007
Register: May 11, 2007 (early)
Hotel: May 9, 2007
URL: http://research.microsoft.com/research/theory/feige/homepagefiles/stoc07.htm [Wayback]; http://research.microsoft.com/research/theory/feige/homepagefiles/stoc2007accept.txt [Wayback]
Topics: algorithms, complexity
Parent: FCRC 2007
Siblings: COLT 2007, Complexity 2007, CRAW 2007, EC 2007, EXPERIMENTAL CS 2007, HOPL 2007, ISCA 2007, LCTES 2007, PADS 2007, PASTE 2007, PLAS 2007, PLDI 2007, SIGMETRICS 2007, SPAA 2007, SSRE 2007, VEE 2007
PC: Eric Allender, Andris Ambainis, Chandra Chekuri, Artur Czumaj, Yevgeniy Dodis, Uriel Feige (chair), Michel Goemans, Martin Grohe, Russell Impagliazzo, Valerie King, Robert Kleinberg, Vladlen Koltun, Robi Krauthgamer, Jiri Matousek, Milena Mihail, Ryan O'Donnell, Vijaya Ramachandran, Leonard Schulman, Maxim Sviridenko, Mikkel Thorup, Salil Vadhan, Santosh Vempala
OC: David Johnson (chair)
Paper
count:
312 submitted (100.0%)
78 accepted (25.0%)
5 withdrawn (1.6%)

STOC 2006: 38th ACM Symposium on Theory of Computing

Due: November 3, 2005 (5:59pm EST)
When: May 21–23, 2006
Where: Seattle, Washington, USA
Accept: January 31, 2006
Register: April 20, 2006 (early)
URL: http://www.cs.washington.edu/stoc06/ [Wayback]; http://portal.acm.org/toc.cfm?id=1132516 [Wayback]
Topics: algorithms, complexity
Plenary: Prabhakar Raghavan, Russell Impagliazzo
Paper
count:
288 submitted (100.0%)
78 accepted (27.1%)

STOC 2005: 37th ACM Symposium on Theory of Computing

Due: November 4, 2004 (5:59pm EST)
When: May 22–24, 2005
Where: Baltimore, Maryland, USA
URL: http://www.cs.jhu.edu/~stoc05/ [Wayback]; http://portal.acm.org/toc.cfm?id=1060590 [Wayback]
Topics: algorithms, complexity
Plenary: Lance Fortnow
Paper
count:
290 submitted (100.0%)
84 accepted (29.0%)

STOC 2004: 36th ACM Symposium on Theory of Computing

Due: November 5, 2003 (4:59pm EST)
When: June 13–15, 2004
Where: Chicago, Illinois, USA
Accept: February 4, 2004
Final: March 15, 2004
URL: http://www.cs.uchicago.edu/~stoc04/ [Wayback]; http://portal.acm.org/toc.cfm?id=1007352 [Wayback]
Topics: algorithms, complexity
Plenary: Andris Ambainis, Eva Tardos, Avi Wigderson
Paper
count:
271 submitted (100.0%)
70 accepted (25.8%)
1 withdrawn (0.4%)

STOC 2003: 35th ACM Symposium on Theory of Computing

Due: November 6, 2002 (11:59pm EDT)
When: June 9–11, 2003
Where: San Diego, California, USA
Accept: January 28, 2003
Final: March 12, 2003
URL: http://www.egr.unlv.edu/~bein/stoc03.html [Wayback]; http://portal.acm.org/toc.cfm?id=780542 [Wayback]
Topics: algorithms, complexity
Parent: FCRC 2003
Siblings: APL 2003, CRAW 2003, EC 2003, ISCA 2003, LCTES 2003, PADS 2003, PCK50, PLDI 2003, PODS 2003, PPoPP 2003, SAS 2003, SIGMETRICS 2003, SoCG 2003, SOFTVIS 2003, SPAA 2003
Paper
count:
270 submitted (100.0%)
80 accepted (29.6%)

STOC 2002: 34th ACM Symposium on Theory of Computing

Due: November 12, 2001 (5:59pm EST)
When: May 19–21, 2002
Where: Montreal, Quebec, Canada
Accept: January 20, 2002
Final: February 20, 2002
URL: http://omega.CRM.UMontreal.CA/STOC'02/ [Wayback]; http://sigact.acm.org/stoc02/ [Wayback]; http://portal.acm.org/toc.cfm?id=509907 [Wayback]
Topics: algorithms, complexity
Paper
count:
287 submitted (100.0%)
91 accepted (31.7%)

STOC 2001: 33rd Annual ACM Symposium on Theory of Computing

Due: October 31, 2000 (5:59pm EST)
When: July 6–8, 2001
Where: Crete, Greece
Accept: January 24, 2001
Final: March 22, 2001
URL: http://sigact.acm.org/stoc01/ [Wayback]; http://portal.acm.org/toc.cfm?id=380752 [Wayback]
Topics: algorithms, complexity
Paper
count:
230 submitted (100.0%)
83 accepted (36.1%)

STOC 2000: 32nd Annual ACM Symposium on Theory of Computing

Due: October 12, 1999 (5:59pm EST; electronic)
When: May 21–23, 2000
Where: Portland, Oregon, USA
Accept: January 6, 2000
Final: February 18, 2000
URL: http://sigact.acm.org/stoc00/ [Wayback]; http://portal.acm.org/toc.cfm?id=335305 [Wayback]
Note: Precedes RealWorld 2000
Topics: algorithms, complexity
Paper
count:
182 submitted (100.0%)
85 accepted (46.7%)
Register
count:
239 total

STOC 1999: 31st Annual ACM Symposium on Theory of Computing

When: May 1–4, 1999
Where: Atlanta, Georgia
URL: http://sigact.acm.org/stoc99/ [Wayback]; http://portal.acm.org/toc.cfm?id=301250 [Wayback]
Topics: algorithms, complexity
Parent: FCRC 1999
Siblings: Complexity 1999, CRAW 1999, IOPADS 1999, ISCA 1999, LCTES 1999, PADS 1999, PLDI 1999, PODC 1999, PPoPP 1999, SIGMETRICS 1999, WCSSS 1999, WOPA 1999, WSSMM 1999
Register
count:
285 total

STOC 1998: 30th Annual ACM Symposium on Theory of Computing

When: May 23–26, 1998
Where: Dallas, Texas, USA
URL: http://sigact.acm.org/stoc98/ [Wayback]; http://portal.acm.org/toc.cfm?id=276698 [Wayback]
Topics: algorithms, complexity
Paper
count:
169 submitted (100.0%)
75 accepted (44.4%)

STOC 1997: 29th Annual ACM Symposium on Theory of Computing

When: May 4–6, 1997
Where: El Paso, Texas, USA
URL: http://sigact.acm.org/stoc97/ [Wayback]; http://portal.acm.org/toc.cfm?id=258533 [Wayback]
Topics: algorithms, complexity
Paper
count:
211 submitted (100.0%)
75 accepted (35.5%)
Register
count:
201 total

STOC 1996: 28th Annual ACM Symposium on Theory of Computing

When: May 22–24, 1996
Where: Philadelphia, Pennsylvania, USA
URL: http://sigact.acm.org/stoc96/ [Wayback]; http://portal.acm.org/toc.cfm?id=237814 [Wayback]
Topics: algorithms, complexity
Parent: FCRC 1996
Siblings: Careers 1996, Complexity 1996, FLIC 1996, ICFP 1996, ICS 1996, IOPADS 1996, ISCA 1996, NIM 1996, PADS 1996, PLDI 1996, PODC 1996, SIGMETRICS 1996, SoCG 1996, SPDT 1996, WACG 1996, WOPA 1996
Paper
count:
201 submitted (100.0%)
74 accepted (36.8%)
Register
count:
362 total

STOC 1995: 27th Annual ACM Symposium on Theory of Computing

When: May 29 – June 1, 1995
Where: Las Vegas, Nevada, USA
URL: http://sigact.acm.org/stoc95/ [Wayback]; http://portal.acm.org/toc.cfm?id=225058 [Wayback]
Topics: algorithms, complexity
Register
count:
268 total

STOC 1994: 26th Annual ACM Symposium on Theory of Computing

When: May 23–25, 1994
Where: Montréal, Québec, Canada
URL: http://portal.acm.org/toc.cfm?id=195058 [Wayback]
Topics: algorithms, complexity
Register
count:
305 total

STOC 1993: 25th Annual ACM Symposium on Theory of Computing

When: May 16–18, 1993
Where: San Diego, California, USA
URL: http://portal.acm.org/toc.cfm?id=167088 [Wayback]
Topics: algorithms, complexity
Register
count:
470 total

STOC 1992: 24th Annual ACM Symposium on Theory of Computing

When: May 4–6, 1992
Where: Victoria, British Columbia, Canada
URL: http://portal.acm.org/toc.cfm?id=129712 [Wayback]
Topics: algorithms, complexity
Register
count:
341 total

STOC 1991: 23rd Annual ACM Symposium on Theory of Computing

When: May 6–8, 1991
Where: New Orleans, Louisiana, USA
URL: http://portal.acm.org/toc.cfm?id=103418 [Wayback]
Topics: algorithms, complexity
Register
count:
343 total (100.0%)
121 students (35.3%)

STOC 1990: 22nd Annual ACM Symposium on Theory of Computing

When: May 14–16, 1990
Where: Baltimore, Maryland, USA
URL: http://portal.acm.org/toc.cfm?id=100216 [Wayback]
Topics: algorithms, complexity
Paper
count:
214 submitted (100.0%)
59 accepted (27.6%)
Register
count:
418 total (100.0%)
151 students (36.1%)

STOC 1989: 21st Annual ACM Symposium on Theory of Computing

When: May 15–17, 1989
Where: Seattle, Washington, USA
URL: http://portal.acm.org/toc.cfm?id=73007 [Wayback]
Topics: algorithms, complexity
Paper
count:
196 submitted (100.0%)
56 accepted (28.6%)
Register
count:
395 total (100.0%)
113 students (28.6%)

STOC 1988: 20th Annual ACM Symposium on Theory of Computing

When: May 2–4, 1988
Where: Chicago, Illinois, USA
URL: http://portal.acm.org/toc.cfm?id=62212 [Wayback]
Topics: algorithms, complexity
Paper
count:
192 submitted (100.0%)
53 accepted (27.6%)
Register
count:
385 total

STOC 1987: 19th Annual ACM Symposium on Theory of Computing

When: May 25–27, 1987
Where: New York, New York, USA
URL: http://portal.acm.org/toc.cfm?id=28395 [Wayback]
Topics: algorithms, complexity
Paper
count:
165 submitted (100.0%)
50 accepted (30.3%)
Register
count:
503 total (100.0%)
220 students (43.7%)

STOC 1986: 18th Annual ACM Symposium on Theory of Computing

When: May 28–30, 1986
Where: Berkeley, California, USA
URL: http://portal.acm.org/toc.cfm?id=12130 [Wayback]
Topics: algorithms, complexity
Paper
count:
175 submitted (100.0%)
47 accepted (26.9%)
Register
count:
430 total (100.0%)
430 students (100.0%)

STOC 1985: 17th Annual ACM Symposium on Theory of Computing

When: May 6–8, 1985
Where: Providence, Rhode Island, USA
URL: http://portal.acm.org/toc.cfm?id=22145 [Wayback]
Topics: algorithms, complexity
Register
count:
423 total (100.0%)
130 students (30.7%)

STOC 1984: 16th Annual ACM Symposium on Theory of Computing

When: April 30 – May 2, 1984
Where: Washington, D.C., USA
URL: http://portal.acm.org/toc.cfm?id=800057 [Wayback]
Topics: algorithms, complexity
Register
count:
388 total (100.0%)
133 students (34.3%)

STOC 1983: 15th Annual ACM Symposium on Theory of Computing

When: May 25–27, 1983
Where: Boston, Massachusetts, USA
URL: http://portal.acm.org/toc.cfm?id=800061 [Wayback]
Topics: algorithms, complexity
Register
count:
360 total (100.0%)
90 students (25.0%)

STOC 1982: 14th Annual ACM Symposium on Theory of Computing

When: May 5–7, 1982
Where: San Francisco, California, USA
URL: http://portal.acm.org/toc.cfm?id=800070 [Wayback]
Topics: algorithms, complexity
Register
count:
300 total

STOC 1981: 13th Annual ACM Symposium on Theory of Computing

When: May 11–13, 1989
Where: Milwaukee, Wisconsin, USA
URL: http://portal.acm.org/toc.cfm?id=800076 [Wayback]
Topics: algorithms, complexity
Register
count:
259 total

STOC 1980: 12th Annual ACM Symposium on Theory of Computing

When: April 28–30, 1980
Where: Los Angeles, California, USA
URL: http://portal.acm.org/toc.cfm?id=800141 [Wayback]
Topics: algorithms, complexity
Paper
count:
125 submitted (100.0%)
47 accepted (37.6%)
Register
count:
260 total

STOC 1979: 11th Annual ACM Symposium on Theory of Computing

When: April 30 – May 2, 1979
Where: Atlanta, Georgia, USA
URL: http://portal.acm.org/toc.cfm?id=800135 [Wayback]
Topics: algorithms, complexity
Paper
count:
111 submitted (100.0%)
37 accepted (33.3%)
Register
count:
175 total

STOC 1978: 10th Annual ACM Symposium on Theory of Computing

When: May 1–3, 1978
Where: San Diego, California, USA
URL: http://portal.acm.org/toc.cfm?id=800133 [Wayback]
Topics: algorithms, complexity
Paper
count:
120 submitted (100.0%)
38 accepted (31.7%)
Register
count:
175 total (100.0%)
40 students (22.9%)

STOC 1977: 9th Annual ACM Symposium on Theory of Computing

When: May 2–4, 1977
Where: Boulder, Colorado, USA
URL: http://portal.acm.org/toc.cfm?id=800105 [Wayback]
Topics: algorithms, complexity
Paper
count:
87 submitted (100.0%)
31 accepted (35.6%)
Register
count:
170 total

STOC 1976: 8th Annual ACM Symposium on Theory of Computing

When: May 3–5, 1976
Where: Hershey, Pennsylvania, USA
URL: http://portal.acm.org/toc.cfm?id=800113 [Wayback]
Topics: algorithms, complexity
Paper
count:
83 submitted (100.0%)
30 accepted (36.1%)
Register
count:
201 total

STOC 1975: 7th Annual ACM Symposium on Theory of Computing

When: May 5–7, 1975
Where: Albuquerque, New Mexico, USA
URL: http://portal.acm.org/toc.cfm?id=800116 [Wayback]
Topics: algorithms, complexity
Paper
count:
87 submitted (100.0%)
31 accepted (35.6%)
Register
count:
147 total

STOC 1974: 6th Annual ACM Symposium on Theory of Computing

When: April 30 – May 2, 1974
Where: Seattle, Washington, USA
URL: http://portal.acm.org/toc.cfm?id=800119 [Wayback]
Topics: algorithms, complexity
Paper
count:
95 submitted (100.0%)
35 accepted (36.8%)
Register
count:
165 total (100.0%)
20 students (12.1%)

STOC 1973: 5th Annual ACM Symposium on Theory of Computing

When: April 30 – May 2, 1973
Where: Austin, Texas, USA
URL: http://portal.acm.org/toc.cfm?id=800125 [Wayback]
Topics: algorithms, complexity
Register
count:
137 total

STOC 1972: 4th Annual ACM Symposium on Theory of Computing

When: May 1–3, 1972
Where: Denver, Colorado, USA
URL: http://portal.acm.org/toc.cfm?id=800152 [Wayback]
Topics: algorithms, complexity
Paper
count:
60 submitted (100.0%)
29 accepted (48.3%)

STOC 1971: 3rd Annual ACM Symposium on Theory of Computing

When: May 3–5, 1971
Where: Shaker Heights, Ohio, USA
URL: http://portal.acm.org/toc.cfm?id=800157 [Wayback]
Topics: algorithms, complexity
Paper
count:
50 submitted (100.0%)
23 accepted (46.0%)

STOC 1970: 2nd Annual ACM Symposium on Theory of Computing

When: May 4–6, 1970
Where: Northampton, Massachusetts, USA
URL: http://portal.acm.org/toc.cfm?id=800161 [Wayback]
Topics: algorithms, complexity
Paper
count:
70 submitted (100.0%)
27 accepted (38.6%)
Register
count:
150 total

STOC 1969: 1st Annual ACM Symposium on Theory of Computing

When: May 5–7, 1969
Where: Marina del Rey, California, USA
URL: http://portal.acm.org/toc.cfm?id=800169 [Wayback]
Topics: algorithms, complexity