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

	Gil Kalai on How the g-Conjecture Came…
	Gil Kalai on (Eran Nevo) The g-Conjecture…
	JSE on Duncan Dauvergne and Bálint Vi…
	Dubcan Dauvergne and… on Ziegler´s Lecture on the …
	Dubcan Dauvergne and… on A Discrepancy Problem for Plan…
	Dubcan Dauvergne and… on Annotating Kimmo Eriksson…
	Dubcan Dauvergne and… on Happy Birthday Richard St…
	The beginnings of Sh… on Telling a Simple Polytope From…
	Vincent on Zur Luria on the n-Queens…
	Gil Kalai on Zur Luria on the n-Queens…
	Vincent on Zur Luria on the n-Queens…
	Blog post on new bou… on Zur Luria on the n-Queens…

Tag Archives: Leonard Schulman

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

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives