- Proof By Lice!
- The seventeen camels riddle, and Noga Alon’s camel proof and algorithms
- Edmund Landau and the Early Days of the Hebrew University of Jerusalem
- Boolean Functions: Influence, Threshold, and Noise
- Laci Babai Visits Israel!
- Polymath10 conclusion
- Is Heads-Up Poker in P?
- The Median Game
- International mathematics graduate studies at the Hebrew University of Jerusalem
Top Posts & Pages
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- The seventeen camels riddle, and Noga Alon's camel proof and algorithms
- Proof By Lice!
- Updates and plans III.
- Amazing: Peter Keevash Constructed General Steiner Systems and Designs
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
- The Simplex, the Cyclic polytope, the Positroidron, the Amplituhedron, and Beyond
- Polymath10-post 4: Back to the drawing board?
- Jim Geelen, Bert Gerards, and Geoﬀ Whittle Solved Rota's Conjecture on Matroids
Category Archives: Computer Science and Optimization
Here is the written version of my address at the 7ECM last July in Berlin. Boolean functions, Influence, threshold, and Noise Trying to follow an example of a 1925 lecture by Landau (mentioned in the lecture), the writing style is very … Continue reading
I am sure that every one of the readers of this blog heard about Laci Babai’s quasi-polynomial algorithm for graph isomorphism and also the recent drama about it: A mistake pointed out by Harald Helfgott, a new sub-exponential but … Continue reading
Five years ago I wrote a post entitled Is Backgammon in P? It was based on conversations with Peter Bro Miltersen and Uri Zwick (shown together in the above picture) about the computational complexity of computing the values (and equilibrium … Continue reading
The US Elections and Nate Silver: Informtion Aggregation, Noise Sensitivity, HEX, and Quantum Elections.
Being again near general elections is an opportunity to look at some topics we talked about over the years. I am quite fond of (and a bit addicted to) Nate Silver’s site FiveThirtyEight. Silver’s models tell us what is the probability that … Continue reading
Live streaming for Avifest is available here. The program is here. Following the first two lectures I can witness that the technical quality of the broadcast is very good and the scientific quality of the lectures is superb. As this is … Continue reading
The Mathematics of Jiří Matoušek is a conference taking place this week at Prague in memory of Jirka Matoušek. Here are the slides of my planned talk on Maestro Jirka Matoušek. This post presents the opening slides for the conference … Continue reading
Ladies and gentlemen, a workshop in Princeton in honor of Avi Wigderson’s 60th birthday is coming on October. It will take place at Princeton on October 5-8 2016 right before FOCS 2016. Don’t miss the event ! Attendance is free but … Continue reading
Readers of the big-league ToC blogs have already heard about the breakthrough paper An average-case depth hierarchy theorem for Boolean circuits by Benjamin Rossman, Rocco Servedio, and Li-Yang Tan. Here are blog reports on Computational complexity, on the Shtetl Optimized, and of Godel … Continue reading
Muli, Dor and Subash, Jerusalem May 21 2015. Michel Talagrand Gregory Margulis Property testing In this post I will tell you about a new paper by Subhash Khot, Dor Minzer and Muli Safra entitled: On … Continue reading
Next Week in Jerusalem: Special Day on Quantum PCP, Quantum Codes, Simplicial Complexes and Locally Testable Codes
Special Quantum PCP and/or Quantum Codes: Simplicial Complexes and Locally Testable CodesDay בי”ס להנדסה ולמדעי המחשב 24 Jul 2014 – 09:30 to 17:00 room B-220, 2nd floor, Rothberg B Building On Thursday, the 24th of July we will host a SC-LTC (simplicial complexes … Continue reading