Computer Science

FOCS 2024 | Gödel’s Lost Letter and P=NP

Foundations of Computer Science 2024 is coming this fall: October 27-30, 2024 at Wolf Point Plaza, Chicago.

A Bit of History

The cover of the FOCS proceedings is:

It was designed by Alvy Ray Smith—many years ago.

See his comments here.

I was asked by my colleagues at the IBM Watson Research Center to design the cover of the 14th annual Switching and Automata Theory Symposium (SWAT), held in 1973. I did so one miserable night to escape the depression of an automobile failure in the worst part of the Bronx, in a rundown Esso station, in a snow storm. This design came to me, all at once, from thinking on the themes “cellular automata as models of living things”, “artificial intelligence”, and “self-reproducing machines”. However, it took me a month to execute the design, with Rapidograph, triangle, French curves, Exacto knife, and ellipse templates, in drafting ink on vellum – obviously before I discovered computer graphics.

FOCS 2024

The chair of the this FOCS is Santosh Vempala of Georgia Institute of Technology and the Program Committee is:

Daniel Alabi
Nima Anari
Maryam Aliakbarpour
Xiaotie Deng
Jelena Diakonikolas
Alina Ene
Funda Ergun
Vipul Goyal
Sean Hallgren
Russell Impagliazzo
Varun Kanade
Ravi Kannan
Bhavana Kanukurthi
Chi Lau
Le Gall
Nagoya Andrea
Yang P. Liu
Daniel Lokshtanov
Meena Mahajan
Yury Makarychev
Tal Malkin
Dana Moshkovitz
Anand Natarajan
Alantha Newman
Noam Nisan
Huy Nguyen
Rafail Ostrovsky
Ioannis Panageas
Will Perkins
Prasad Raghavendra
Victor Reis
Rahul Santhanam
Mohit Singh
Daniel Stefankovic
David Steurer
Xiaorui Sun
Ewin Tang
Kavitha Telikepalli
Vera Traub
Chris Umans
Vinod Vaikuntanathan
Adrian Vetta
Yusu Wang
Andre Wibisono
Mihalis Yannakakis
Huacheng Yu

Papers

Here are all the FOCS 2024 Accepted Papers. Below are just those accepted papers that are directly connected to Tech.

8. Online Combinatorial Allocations and Auctions with Few Samples by
Paul Duetting (Google); Thomas Kesselheim (University of Bonn); Brendan Lucier (Microsoft Research); Rebecca Reiffenhauser (University of Amsterdam); Sahil Singla (Georgia Tech)

12. First-Order Model Checking on Monadically Stable Graph Classes by
Jan Dreier (TU Wien); Ioannis Eleftheriadis (University of Cambridge); Nikolas Mahlmann (University of Bremen); Rose McCarty (Georgia Tech); Micha Pilipczuk, Szymon Toruczyk (University of Warsaw)

15. Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality by
Jan van den Brand (Georgia Tech); Li Chen (Carnegie Mellon University); Rasmus Kyng (ETH Zurich); Yang P. Liu (Institute for Advanced Study); Simon Meierhans (ETH Zurich); Maximilian Probst Gutenberg (ETH Zurich); Sushant Sachdeva (University of Toronto / Google)

48. Semi-Bandit Learning for Monotone Stochastic Optimization} by
Arpit Agarwal (Columbia University); Rohan Ghuge (Georgia Tech); Viswanath Nagarajan (University of Michigan)

81. Sampling, counting, and large deviations for triangle-free graphs near the critical density by Matthew Jenssen (King’s College London); Will Perkins (Georgia Tech); Aditya Potukuchi (York University); Michael Simkin (MIT)

90. Online Submodular Assignment Problem by Sherry Sarkar, Daniel Hathcock, Mik Zlatin (Carnegie Mellon University); Billy Jin (Cornell University); Kalen Patton (Georgia Tech)

Open Problems

Hope to see you all there. The conference should be wonderful as always.

Related Articles

Leave a Reply

Your email address will not be published. Required fields are marked *

Back to top button