NDLI: Special Section on the Fifty-First Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010)

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Trevisan, Luca Malkin, Tal Lau, Lap Chi O'Donnell, Ryan
Copyright Year	2014
Abstract	This special section contains five selected papers from the 50th Annual Symposium on Foundations of Computer Science (FOCS 2010) sponsored by the IEEE Technical Committee on Mathematical Foundations of Computing. The conference was held in Las Vegas, Nevada, October 23-26, 2010. The conference program consisted of 81 papers, which the program committee selected from 270 submissions. The program committee was composed of Scott Aaronson, Dorit Aharonov, Eli Ben-Sasson, Julia Chuzhoy, Ryan O'Donnell, Roberto Grossi, Nick Harvey, Adam Kalai, Nicole Immorlica, Yuval Ishai, Lap Chi Lau, James Lee, Tal Malkin, Joe Mitchell, Dana Moshkovitz, S. Muthukrishnan, Christos Papadimitriou, Sofya Raskhodnikova, Steve Skiena, Mikkel Thorup, Luca Trevisan, and Eric Vigoda. Each of the five papers appearing in this issue was subject to the standard refereeing process of the SIAM Journal on Computing. In The Monotone Complexity of $k$-Clique on Random Graphs," Ben Rossman proves that monotone circuits that solve the $k$-clique problem in random graphs must have size $\omega(n^{k/4})$, establishing the first average-case monotone lower bound. Andreas Björklund, in the paper Determinant Sums for Undirected Hamiltonicity," develops the first improvement to the $\tilde O(2^n)$ dynamic programming algorithm for Hamiltonian circuit: Björklund's algorithm runs in time $\tilde O(1.657^n)$. The paper Distance Oracles Beyond the Thorup--Zwick Bound" by Mihai Pătraşcu and Liam Roditty presents the first improvement in ten years for the problem of compactly representing an approximation to all-pairs shortest path distances in a graph. Shaddin Dughmi and Tim Roughgarden show how to convert any approximation algorithm for a certain class of problems into a truthful mechanism in the paper Black-Box Randomized Reductions in Algorithmic Mechanism Design." Ioannis Koutis, Gary Miller, and Richard Peng, in the paper Approaching Optimality for Solving SDD Linear Systems," present a new nearly linear time algorithm for the problem of solving systems of linear equations that are symmetric and diagonally dominant. We wish to thank Madhu Sudan and Leonard Schulman, the former and current Editors-in-Chief of SICOMP, for being very generous with their time as they helped us in this project. We also wish to thank Heather Blythe of SIAM and the anonymous referees.
Starting Page	255
Ending Page	255
Page Count	1
File Format	PDF
ISSN	00975397
DOI	10.1137/140973608
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	1 (Special Section on the Fifty-First Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010))
Volume Number	43
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2014-01-01
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in