- Many triangulated three-spheres!
- NatiFest is Coming
- More around Borsuk
- Analysis of Boolean Functions – Week 7
- Analysis of Boolean Functions week 5 and 6
- Real Analysis Introductory Mini-courses at Simons Institute
- Analysis of Boolean Functions – week 4
- Polymath 8 – a Success!
- Analysis of Boolean Functions – Week 3
Top Posts & Pages
- Polymath 8 - a Success!
- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- Analysis of Boolean Functions
- János Pach: Guth and Katz's Solution of Erdős's Distinct Distances Problem
- NatiFest is Coming
- Analysis of Boolean Functions - week 1
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Richard Stanley: How the Proof of the Upper Bound Theorem (for spheres) was Found
- Believing that the Earth is Round When it Matters
Category Archives: Computer Science and Optimization
Xavier Dahan and Jean-Pierre Tillich’s Octonion-based Ramanujan Graphs with High Girth. Update (February 2012): Non associative computations can be trickier than we expect. Unfortunately, the paper by Dahan and Tillich turned out to be incorrect. Update: There is more to … Continue reading
Oliver Friedmann, Thomas Dueholm Hansen, and Uri Zwick have managed to prove subexponential lower bounds of the form for the following two basic randomized pivot rules for the simplex algorithm! This is the first result of its kind and deciding … Continue reading
Workshop at IPAM: January 18 – 21, 2011 Here is the link to the IPAM conference.
The problem We are used to computer programs or models for computations that perform at time step , . Suppose that time is drunk, so instead of running these steps in their correct order, we apply at time step , where … Continue reading
The purpose of this post is to describe an old conjecture (or guesses, see this post) by Itai Benjamini, Oded Schramm and myself (taken from this paper) on noise stability of threshold functions. I will start by formulating the conjectures and … Continue reading
This post is authored by Michael Schapira. (It is the second in a series of two posts.) In thse two post, I outline work on Internet routing and sketch important areas for future work, both on routing itself and, more broadly, on mechanism … Continue reading
I gave in several places a talk entitled “Analytic and Probabilistic Properties of Boolean Functions.” This is a fairly large area so the talks can differ quite a bit. The lecture at the NYU CS theory seminar was described over a Chinese blog entitled … Continue reading
This post is authored by Michael Schapira. (It is the first in a series of two posts.) In this post, I’ll outline work on Internet routing and sketch important areas for future work, both on routing itself and, more broadly, on … Continue reading
I wrote a short paper entitled “when noise accumulates” that contains the main conceptual points (described rather formally) of my work regarding noisy quantum computers. Here is the paper. (Update: Here is a new version, Dec 2010.) The new exciting innovation in computer … Continue reading
Polymath4 is devoted to a question about derandomization: To find a deterministic polynomial time algorithm for finding a k-digit prime. So I (belatedly) devote this post to derandomization and, in particular, the following four problems. 1) Find a deterministic algorithm for primality 2) Find … Continue reading