December 15, 2014
Zeev Dvir. Private Information Retrieval with 2-Servers and sub-polynomial communication
December 8, 2014
Omri Weinstein. Approximating the Best Nash Equilibrium in n^{o(log n)}-Time Breaks ETH.
December 1, 2014
CS Colloquium: Boaz Barak. Proofs for Algorithms, Algorithms from Proofs.
December 1, 2014
Seth Pettie. Randomized Symmetry Breaking and the Constructive Lovász Local Lemma
November 24, 2014
Jan Vondrak. Fast algorithms for optimization of submodular functions
November 20, 2014
CS Colloquium: Christopher Moore. Physics-inspired Algorithms and Phase Transitions in Community Detection.
November 17, 2014
CS Colloquium: Yael Tauman Kalai. Delegating Computation.
November 17, 2014
Gillat Kol. Exponential Separation of Information and Communication.
November 17, 2014
CRCS Lunch Seminar: Babis Tsourakakis. Algorithm Design for Large-Scale Datasets.
November 14, 2014
Avi Wigderson. Points, Lines and Ranks of design matrices
November 13-14, 2014
Ahlfors Lectures: Avi Wigderson. Randomness/Permanent and Determinant: Non-Identical Twins
November 10, 2014
CS Colloquium: Madhu Sudan. Communication Amid Uncertainty.
November 10, 2014
Chris Musco. Graph Sparsification in the Streaming Model.
November 6, 2014
CS Colloquium: Michael Kearns. Games, Networks, and People.
November 3, 2014
Pranjal Awasthi. Learning Halfspaces with Noise.
October 30, 2014
CS Colloquium: Richard Baraniuk. Learning Near-Isometric Linear Embeddings.
October 27, 2014
Sofya Raskhodnikova. Constant-Time Testing and Learning Algorithms for Image Properties.
October 24, 2014
EconCS Seminar: Rafael Frongillo. Risk Dynamics in Trade Networks.
October 16, 2014
CS Colloquium: Ankur Moitra. New Algorithms for Nonnegative Matrix Factorization and Beyond.
October 9, 2014
CS Colloquium: Ron Fagin. Applying Theory to Practice (and Practice to Theory).
October 8, 2014
CMSA Colloquium: Salil Vadhan. The Computational Complexity of Data Privacy.
October 6, 2014
Aaron Sidford. Path-Finding Methods for Linear Programming.
September 29, 2014
Applied Math Colloquium: Rachel Ward. Linear Dimensionality Reduction via Random Projections.
September 29, 2014
Eli Gafni. The Coordinated-Attack Problem Revisited.
September 29, 2014
CRCS Lunch Seminar: Or Sheffet. Utilitarian Models of Privacy Loss and Social Choice.
September 22, 2014
Emanuele Viola. Local Reductions.
September 15, 2014
CRCS Lunch Seminar: Itai Ishlagi. Unbalanced Matching Markets.
September 12, 2014
EconCS Seminar: Moshe Babaioff. Bertrand Networks.
May 16, 2014
Sjoerd Dirksen. A Unified Approach to Dimensionality Reduction with Subgaussian Matrices.
Tuesday, May 6, 2014
Venkat Guruswami. Polar codes: Reliable communication with complexity scaling polynomially in the gap to Shannon capacity.
Tuesday, April 22, 2014
Or Sheffet. The Entropy Soon-To-Be-Method.
April 8, 2014
Raef Bassily. Causal Erasure Channels.
April 3, 2014
CS Colloquium: David Soloveichik. Engineering Intelligent Molecular Systems.
March 25, 2014
Aleksandar Nikolov. Approximating Hereditary Discrepancy via Small Width Ellipsoids.
March 24, 2014
CRCS Lunch Seminar: David Xiao. Understanding Incentives for Privacy-Aware Individuals.
March 11, 2014
Michael Forbes. Hitting Sets for Multilinear Read-Once Algebraic Branching Programs, in any Order.
February 27, 2014
CS Colloquium: Raluca Ada Popa. Building Systems that Compute on Encrypted Data.
February 25, 2014
Mark Zhandry. Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation.
February 14, 2014
EconCS Seminar: Pavel Hubacek. Single Round Delegation with Sublinear Verification.
February 11, 2014
Justin Thaler. On Interactivity in Arthur-Merlin Communication and Stream Computation.
January 29, 2014
CRCS Lunch Seminar: Jon Ullman. Privacy and the Complexity of Simple Queries.
January 28, 2014
Vladimir Braverman. Approximating Large Frequency Moments with O(n^{1-2/k}) Bits.
