Focs 2015

IEEE 56th Annual Symposium on Foundations of Computer Science ( FOCS ). IEEE sponsors: IEEE Computer Society. Papers presenting new and original research on theory of computation are sought. Typical but not exclusive topics of interest include: algorithms and data structures, computational complexity, . Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions. This event, which features a dozen speakers from across the spectrum of theoretical Computer Science, will .

On the cryptographic hardness of finding a nash equilibrium. Indistinguishability obfuscation from functional encryption. Boosting and differential privacy. Robust traceability from trace amounts. In: Symposium on Theory of Computing Conference, STOC, pp.

IACR Cryptology ePrint Archive p. The CS Theory group had two papers at the conference. Northwestern CS Theory and Economics Ph.

Manolis Pountourakis did a really fantastic job of presenting his paper Optimal Auctions vs. Pseudorandomness via the discrete Fourier transform. Sum-of-squares lower bounds for planted clique.

Raghu Meka, Aaron Potechin, Avi Wigderson. An average-case depth hierarchy theorem for Boolean circuits. Benjamin Rossman and Rocco Servedio. Invited to the Journal of the ACM.

One of the most challenging questions in computer science is whether there exist problems that are provably hard to solve. A variant of Ellipsoid method that works really well. This is most famously shown in an unsolved . Yin Tat Lee, Aaron Sidford.

Efficient Inverse Maintenance and Faster Algorithms for Linear Programming. Abstract: We consider the problem of estimating the number of triangles in a graph. Subjects: Data Structures and Algorithms (cs.DS). Self-Adjusting Binary Search Trees : What Makes Them Tick? Making the Most of Advice: New Correlation Breakers and Their Applications.

Gil Cohen, Leonard Schulman.

Needless to say, all that is said wrt STOC applies to FOCS as well.