Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		grigory.github.io Slides and Videos from DIMACS - The Big Data Theory
\|	\|	algorithmsoup.wordpress.com The World's Simplest Interesting Algorithm - Algorithm Soup	6.8 parsecs away Travel
\|	\|	In this post, I want to tell you about what I think might be the world's simplest interesting algorithm. The vertex cover problem. Given a graph $latex {G = (V, E)}&fg=000000$, we want to find the smallest set of vertices $latex {S \subseteq V}&fg=000000$ such that every edge $latex {e \in E}&fg=000000$ is covered by...	6.8 parsecs away Travel
\|	\|	www.ewansilver.com Yahoo! just cloning Google \| Ewan Silver	13.5 parsecs away Travel
\|	\|	Interesting to see another Google-like piece of infrastructure cloning coming out of Yahoo!. Zookeeper appears to be almost identical to Chubby, Googles distributed lock service. Hadoop = MapReduce...	13.5 parsecs away Travel
\|	\|	yufeizhao.wordpress.com The number of independent sets in an irregular graph \| Yufei Zhao	11.1 parsecs away Travel
\|	\|	I am excited to announce our new paper, The number of independent sets in an irregular graph, coauthored with these three amazing collaborators: Ashwin is a freshman at MIT, Mehtaab is a sophomore at MIT, and David is a junior at Harvard. The paper solves a conjecture made by Jeff Kahn in 2001 concerning the...	11.1 parsecs away Travel
\|	\|	siddhartha-gadgil.github.io Formalizing Gardam's disproof of Kaplansky's Unit Conjecture · Artificial Intelligence and Mathematics	45.7 parsecs away Travel
\|		[AI summary] The author details the process of using the Lean 4 programming language to formally verify Giles Gardam's disproof of the Kaplansky Unit Conjecture in mathematics.	45.7 parsecs away Travel