Tag Archives: Leonard Schulman

Cohen, Haeupler, and Schulman: Explicit Binary Tree-Codes & Cancellations

Posted on April 24, 2018 by Gil Kalai

The high-dimensional conference in Jerusalem is running with many exciting talks (and they are videotaped), and today in Tel Aviv there is a conference on Optimization and Discrete Geometry : Theory and Practice. Today in Jerusalem, Leonard Schulman talked (video available!) … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Open problems | Tagged Bernhard Haeupler, Gil Cohen, Leonard Schulman, Tree-codes | 1 Comment

	An Improved Bound fo… on Nathan Rubin Improved the Boun…
	Gil Kalai on Aaronson and Arkhipov’s…
	Gil Kalai on Aaronson and Arkhipov’s…
	ICM2018 First Report… on A Few Mathematical Snapshots f…
	ICM2018 First Report… on Mabruk Elon, India, and M…
	Summer conferences i… on Building Bridges II, and Rio I…
	Gil Kalai on Aaronson and Arkhipov’s…
	Gil Kalai on Aaronson and Arkhipov’s…
	Gil Kalai on Octonions to the Rescue
	Austin on Test Your Intuition 35: What i…
	Christian Blatter on Test Your Intuition 35: What i…
	Building Bridges II,… on The Thompson Group

Tag Archives: Leonard Schulman

Cohen, Haeupler, and Schulman: Explicit Binary Tree-Codes & Cancellations

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives