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

	vegafrank on Amazing: Karim Adiprasito prov…
	casaguhu on Lovasz’s Two Families…
	Jean Bourgain 1954… on Jean
	vegafrank on Amazing: Karim Adiprasito prov…
	Gil Kalai on Jean
	Predictions For 2019… on Amazing: Karim Adiprasito prov…
	(Eran Nevo) The g-Co… on Extremal Combinatorics IV:…
	(Eran Nevo) The g-Co… on (Eran Nevo) The g-Conjecture I…
	(Eran Nevo) The g-Co… on How the g-Conjecture Came…
	Gil Kalai on Amazing: Karim Adiprasito prov…
	Gil Kalai on Amazing: Karim Adiprasito prov…
	samuelfhopkins on Amazing: Karim Adiprasito prov…

Tag Archives: Leonard Schulman

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

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives