Abstract
This special section comprises eight fully refereed papers whose extended abstracts were presented at the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008) in Philadelphia, Pennsylvania, October 26-28, 2008. The unrefereed conference versions of these papers were published by IEEE in the FOCS 2008 proceedings. The regular conference program consisted of 79 papers chosen from among 276 submissions. These were selected by a program committee consisting of Scott Aaronson, Yossi Azar, Avrim Blum, Harry Buhrman, Artur Czumaj, Yevgeniy Dodis, David Eppstein, Jeff Erickson, Naveen Garg, Tom Hayes, Sampath Kannan, Jonathan Katz, Valerie King, Mohammad Mahdian, Yury Makarychev, Yishay Mansour, Rafail Ostrovsky, Toniann Pitassi, Harald Raecke, R. Ravi (chair), Madhu Sudan, and Emanuele Viola. 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, computational complexity, hardness of approximation, learning theory, 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 as this project began, and SIAM staff member Cherie Trebisky for their help in preparing this special section.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have