Abstract
The papers in this volume were presented at the 4th Innovations in Theoretical Computer Science (ITCS 2013) conference, sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). The conference was held in Berkeley, California, USA, January 9--12, 2013. The program committee consisted of Mark Braverman (Princeton University), Shuchi Chawla (University of Wisconsin), Julia Chuzhoy (TTI-Chicago), Yevgeniy Dodis (New York University), Andrew Drucker (MIT and IAS), Uriel Feige (Weizmann Institute), Ravi Kannan (Microsoft Research India), Robert Kleinberg (Chair, Cornell University), Eyal Kushilevitz (Technion), S. Muthukrishnan (Rutgers University), Ronitt Rubinfeld (MIT and Tel Aviv University), Atri Rudra (University at Buffalo), Adam Smith (Pennsylvania State University), Santosh Vempala (Georgia Tech), and Andrew Yao (Tsinghua University). The call for papers attracted 123 submissions worldwide. The program committee accepted 49 papers that cover a wide range of topics in theoretical computer science, including algorithms, complexity, cryptography, learning, data privacy, quantum computing, and relations between computing and the biological and social sciences. The program committee selected two papers for the Best Student Paper award: "Properties and Applications of Boolean Function Composition" by Avishay Tal, and "Time Hierarchies for Sampling Distributions" by Thomas Watson.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
