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

	JSE on Meeting Michael H. at Rio
	Quantum Future: Just… on Why Quantum Computers Cannot W…
	Anonymous on Amazing: Simpler and more gene…
	Generalizations of t… on Coloring Simple Polytopes and…
	CUT THE ❌crap❌ CONVE… on To Cheer You Up in Difficult T…
	RJLipton+KWRegan on What is mathematics (or at lea…
	Ferdinand Ihringer on Extremal Combinatorics VI: The…
	Jon Awbrey on What is mathematics (or at lea…
	Congrats Avi and Lac… on Cheerful News in Difficult Tim…
	Yiftach on Alef’s Corner
	Gil Kalai on Alef’s Corner
	Yiftach on Alef’s Corner

Tag Archives: Leonard Schulman

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

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives