Paper Info
Title
Special Section On Foundations of Computer Science
Abstract
This special section comprises eight fully refereed papers whose extended abstracts were presented at the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007) in Providence, Rhode Island, October 21-23, 2007. The unrefereed conference versions of these papers were published by IEEE in the FOCS 2007 proceedings. The regular conference program consisted of 63 papers chosen from among 302 submissions. These were selected by a program committee consisting of Dimitris Achlioptas, Timothy Chan, Julia Chuzhoy, Faith Ellen, Piotr Indyk, Kamal Jain, T. S. Jayram, Robert Kleinberg, James R. Lee, Anna Lysyanskaya, Daniele Micciancio, Gary Miller, Moni Naor, Alexander Razborov, Yaoyun Shi, Alistair Sinclair (chair), Luca Trevisan, Chris Umans, and Uri Zwick. The papers invited to this special section were also selected with the input of the program committee. The eight papers in this section span a broad range of topics, including algorithmic game theory, communication complexity, hardness of approximation, metric embeddings, proof complexity, pseudorandomness, and quantum algorithms. Each paper underwent an extensive refereeing process; we thank both the authors and the anonymous referees for their efforts. In addition, we would like to thank Eva Tardos, who was SICOMP's editor-in-chief during the course of this project, and SIAM staff members Mitch Chernoff and Cherie Trebisky for their help in preparing this special section.
Year
DOI
Venue
2011
10.1137/SMJCAT000039000006002397000001
SIAM J. Comput.
Field
DocType
Volume
Discrete mathematics,Hardness of approximation,Computer science,Operations research,Algorithmic game theory,Proof complexity,Library science,Mathematics
Journal
39
Issue
ISSN
Citations 
6
0097-5397
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
James R. Lee100.68
Christopher Umans287955.36