windowsontheory.org
Nikhil Srivastava | Windows On Theory
https://windowsontheory.org/author/knikct
Theory Seminar – MSR-Silicon Valley – RIP. Posts by Nikhil Srivastava. April 15, 2014. Restricted Invertiblity by Interlacing Polynomials. July 11, 2013. Discrepancy, Graphs, and the Kadison-Singer Problem. On TheoryFest 2017 – guest…. On TheoryFest 2017 – guest…. On STOC Festival Design: Improvin…. On Sanjeev Arora: Potential chang…. AviFest, AviStories…. On Avi Wigderson 60th celebr…. Proofs, beliefs and algorithms through the lens of Sum of Squares. TheoryFest 2017 – guest post by Sanjeev Arora.
mittheory.wordpress.com
G – Not so Great Ideas in Theoretical Computer Science
https://mittheory.wordpress.com/author/hoonoseme
Not so Great Ideas in Theoretical Computer Science. A student blog of MIT CSAIL Theory of Computation Group. Sublinear Day at MIT. On Friday, April 10th, MIT will be hosting the second Sublinear Algorithms Day. This event will bring together researchers in the northeast for a day of interaction and discussion. Additionally, for the first time this year, we will have a poster session! So what are you waiting for? Registration is available here. And we hope to see you at the event! March 2, 2015. Tells us ...
windowsontheory.org
Maximizing Submodular Functions (Part 2) | Windows On Theory
https://windowsontheory.org/2012/03/26/maximizing-submodular-functions-part-2
Theory Seminar – MSR-Silicon Valley – RIP. Maximizing Submodular Functions (Part 2). March 26, 2012. Continuing on my last post. Today I will talk about recent work by Niv Buchbinder. That gives a simple 1/2 approximation to the (unconstrained) submodular maximization problem, matching the hardness. Do see the paper (which should be available in a couple of weeks) for full details. Apologies in advance for any errors. Starting with everything and throwing out elements while we improve? Steps, we have.
cs.uwaterloo.ca
Eric Blais
https://cs.uwaterloo.ca/~eblais
David R. Cheriton School of Computer Science. Complexity of computational problems ( CS 489. This class provides an introduction to the topic of establishing the absolute limits of algorithms in various computational models. In particular, we will explore how to prove lower bounds on the amount of time and space required to solve computational problems with randomized algorithms, parallel algorithms, and approximation algorithms. Concentration inequalities in computer science ( CS 860. My research is in ...
windowsontheory.org
ICM Survey: Sum-of-squares proofs and the quest toward optimal algorithms | Windows On Theory
https://windowsontheory.org/2014/04/21/icm-survey-sum-of-squares-proofs-and-the-quest-toward-optimal-algorithms
Theory Seminar – MSR-Silicon Valley – RIP. ICM Survey: Sum-of-squares proofs and the quest toward optimal algorithms. April 21, 2014. I have just posted online a new survey “Sum-of-Squares proofs and the quest toward optimal algorithms”. Co-authored with David Steurer. The survey discusses two topics I have blogged about before – Khot’s Unique Games Conjecture. UGC) and the Sum-of-Squares (SOS) method. 8211; and the connections between them. Both are related to the notion of. On input of length. Time The...
windowsontheory.org
Boaz Barak | Windows On Theory
https://windowsontheory.org/author/hardeasy
Theory Seminar – MSR-Silicon Valley – RIP. Posts by Boaz Barak. July 7, 2016. TheoryFest 2017 – guest post by Sanjeev Arora. June 22, 2016. Area Laws, Reed Muller Codes and Tolstoy. June 16, 2016. Avi Wigderson 60th celebration. June 8, 2016. Politics on technical blogs. June 5, 2016. Yet another post on a.p. free set bounds. May 30, 2016. University funds spent on study of Unicorns. May 24, 2016. Laquo; Older Entries. On TheoryFest 2017 – guest…. On TheoryFest 2017 – guest…. AviFest, AviStories….
SOCIAL ENGAGEMENT