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

	vznvzn on Dan Romik on the Riemann zeta…
	Are Natural Mathemat… on An Invitation to a Conference:…
	Dan Romik on the Rie… on Dan Romik Studies the Riemann…
	Gil Kalai on Dan Romik Studies the Riemann…
	Matt Baker on Imre Bárány: Limit shape
	Itai Benjamini and J… on Hardness of Approximating Vert…
	Itai Benjamini and J… on Must-read book by Avi Wig…
	Gil Kalai on Hardness of Approximating Vert…
	Tools and Sensitivit… on Amazing: Hao Huang Proved the…
	La optimización de t… on A sensation in the morning new…
	Joseph Malkevitch on Imre Bárány: Limit shape
	Un matemático ruso d… on A sensation in the morning new…

Tag Archives: Leonard Schulman

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

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives