Berkeley CSUA MOTD:Entry 19603
Berkeley CSUA MOTD
 
WIKI | FAQ | Tech FAQ
http://csua.com/feed/
2025/04/03 [General] UID:1000 Activity:popular
4/3     

2000/10/30-11/1 [Computer/Theory] UID:19603 Activity:nil
10/31   http://www.geocities.com/st_busygin/clipat.html
        \_ so is this under peer review
2025/04/03 [General] UID:1000 Activity:popular
4/3     

You may also be interested in these entries...
2010/8/29-9/30 [Recreation/Humor, Politics/Foreign/Europe, Computer/Theory] UID:53940 Activity:nil
8/29    http://www.google.nl/trends?q=ramadan,+porno&ctab=0&geo=ma&date=all&sort=0
        Funny graph.  -- linkpusher
	...
2009/12/8-26 [Computer/Theory] UID:53581 Activity:nil
12/8    http://www-cs-faculty.stanford.edu/~knuth/musings.html
        SOUNDS EXCITING
        The next talk in the series will be entitled
        Spanning Trees and Aspects (The 15th Annual Christmas Tree Lecture)
        The spanning trees of a graph with n vertices are the sets of n-1 edges\
that connect the graph. In this lecture I'll discuss the remarkable relation bet\
	...
2008/12/18-2009/1/2 [Computer/Theory] UID:52270 Activity:nil
12/17   What is going on here? (graph of money supply)
        http://tinyurl.com/5on6w9
        \_ Fed keeps cutting interest rate, and printing money to give out
           to banks.  Banks don't need to lend out money, because the Fed
           keeps giving more to them.  So, more money supply without
           more circulation.
	...
Cache (132 bytes)
www.geocities.com/st_busygin/clipat.html
A program constructing a vertex-saturated graph from a given undirected graph is available here (patched on 05/12/02). References 1.