Slide 1 RandomEdge can be mildly exponential on abstract cubes Jiri Matousek Charles University Prague Tibor Szabó ETH Zürich Slide 2 Linear Programming Given a convex…

Slide 1 1 The Random Trip Mobility Model Milan Vojnovic (Microsoft Research) Computer Lab Seminar, University of Cambridge, UK, Nov 2004 with Jean-Yves Le Boudec (EPFL) part…

Slide 1 Yet another algorithm for dense max cut - go greedy Claire Mathieu Warren Schudy (presenting) Brown University Computer Science SODA 2008 Slide 2 Max cut Splitting…

Slide 1 1 RANDOM GRAPHS IN CRYPTOGRAPHY Adi Shamir The Weizmann Institute Israel May 15, 2007 7th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics…

Slide 1 Expander graphs – applications and combinatorial constructions Avi Wigderson IAS, Princeton [Hoory, Linial, W. 2006] “Expander graphs and applications” Bulletin…

Slide 1 “Solving the Independent Set Problem using the Exhausted Search Algorithm in parallel.” Parallel Computing I Slide 2 Understanding Concepts Independent Set Problem…

Noam Berger Joint work with C. Borgs, J.T. Chayes and A. Saberi On the Spread of Viruses on the Internet The Internet Graph Faloutsos, Faloutsos and Faloutsos ‘99 The Sex…

3.1 Basic Definitions and Applications Undirected Graphs Undirected graph. G = (V, E) V = nodes. E = edges between pairs of nodes. Captures pairwise relationship between…

Graphs over Time Densification Laws, Shrinking Diameters and Possible Explanations Jurij Leskovec, CMU Jon Kleinberg, Cornell Christos Faloutsos, CMU Introduction What can…

Noam Berger Joint work with C. Borgs, J.T. Chayes and A. Saberi On the Spread of Viruses on the Internet The Internet Graph Faloutsos, Faloutsos and Faloutsos ‘99 The Sex…