2008 49th Annual IEEE Symposium on Foundations of Computer Science (Acyclic) Job Shops are Hard to Approximate Monaldo Mastrolilli and Ola Svensson IDSIA Lugano, Switzerland,

Source URL: theory.epfl.ch

A Preliminary version of this paper appeared in Proceedings of the 31st Annual IEEE Symposium on the Foundations of Computer Science, IEEERandomness in Interactive Proofs Mihir Bellare

Source URL: www.wisdom.weizmann.ac.il

T The Κ 50th Annual Symposium on Foundations of Computer Science, FOCSIEEE Computer Society, pp. 629–638, 2009.

Source URL: users.uoa.gr

2016 IEEE 57th Annual Symposium on Foundations of Computer Science Approximate Gaussian Elimination for Laplacians – Fast, Sparse, and Simple Rasmus Kyng, Sushant Sachdeva Department of Computer Science

Source URL: ieee-focs.org

Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.

Source URL: people.cs.uchicago.edu

• Theoretical computer science
• Lance Fortnow
• Probabilistic complexity theory
• Carsten Lund
• Computer science
• IP
• BPP
• Probabilistically checkable proof
• Symposium on Foundations of Computer Science
• Mathematics

Codes April 12, Sanjeev Arora, L´ aszl´ o Babai, Jacques Stern, and Z. (Elizabeth) Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear

Source URL: people.cs.uchicago.edu

• Babai
• Symposium on Foundations of Computer Science

O. Peter Buneman Curriculum Vitæ – Jan 2008 Work Address: LFCS, School of Informatics University of Edinburgh

Source URL: homepages.inf.ed.ac.uk

• Fellows of the Royal Society of Edinburgh
• Peter Buneman
• Wenfei Fan
• Dan Suciu
• SIGMOD
• Association for Computing Machinery
• Gerhard Weikum
• Symposium on Principles of Database Systems
• David Maier
• Laboratory for Foundations of Computer Science
• Malcolm Atkinson
• Serge Abiteboul

38th International Symposium on Mathematical Foundations of Computer Science August 26-30, 2013 in Vienna, Austria http://ist.ac.at/mfcs13/ CALL FOR PAPERS

Source URL: ist.ac.at

• U
• Computer science
• European Language Resources Association

SIGACCESS FY’14 Annual Report July 2013 – June 2014 Submitted by: Andrew Sears SIGACCESS continues to refine its activities to meet member needs. This report highlights SIGACCESS Awards as well as the SIG’s confere

Source URL: www.acm.org

• Theoretical computer science
• Edsger W. Dijkstra
• ACM SIGACT
• Association for Computing Machinery
• Symposium on Theory of Computing
• Symposium on Parallelism in Algorithms and Architectures
• Symposium on Principles of Distributed Computing
• Symposium on Computational Geometry
• ACM-W
• International Colloquium on Automata
• Languages and Programming
• Gdel Prize
• Symposium on Foundations of Computer Science

Publications - Avinatan Hassidim Journal Publications 1. Monotonicity and Implementability. Itai Ashlagi, Mark Braverman, Avinatan Hassidim and Dov Monderer. Econometrica September 2010, pages 1749–Quantum Sta

Source URL: www2.lns.mit.edu

• Theoretical computer science
• Quantum information science
• Emerging technologies
• Quantum algorithm for linear systems of equations
• Quantum information
• QIP
• Quantum computing
• Symposium on Foundations of Computer Science
• Uman