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

	Joseph Malkevitch on Ricky and Branko
	Ricky and Branko \| C… on How the g-Conjecture Came…
	Ricky and Branko \| C… on Budapest, Seattle, New Ha…
	Ricky and Branko \| C… on Coloring Simple Polytopes and…
	Ricky and Branko \| C… on The World of Michael Burt: Whe…
	Ricky and Branko \| C… on My Copy of Branko Grünbaum…
	Ricky and Branko \| C… on Academic Degrees and Sex
	Ricky and Branko \| C… on Many triangulated three-sphere…
	Ricky and Branko \| C… on A Discrepancy Problem for Plan…
	VVN Rao on The Quantum Debate is Over! (a…
	Gil Kalai on Telling a Simple Polytope From…
	Gil Kalai on The Quantum Debate is Over! (a…

Tag Archives: Leonard Schulman

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

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives