Matroids
Coalescing Register Allocation CS153: Compilers Greg Morrisett.
SENSOR NETWORKS ECE 654 Irene Ioannou. Sensor networks communication architecture.
Approximating Distances in Graphs Uri Zwick Tel Aviv University Otwarte wykłady dla doktorantów informatyki Instytut Informatyki Uniwersytetu Warszawskiego.
1 Hierarchical Image-Motion Segmentation using Swendsen-Wang Cuts Adrian Barbu Siemens Corporate Research Princeton, NJ Acknowledgements: S.C. Zhu, Y.N.
1 Identifying Bug Signatures Using Discriminative Graph Mining Hong Cheng 1, David Lo 2, Yang Zhou 1, Xiaoyin Wang 3, and Xifeng Yan 4 1 Chinese University.
Testing of ‘massively parametrized problems’ - Ilan Newman Haifa University Based on joint work with: Sourav Chakraborty, Eldar Fischer, Shirley Halevi,
Boston University Computer Science On The Marginal Utility of Network Topology Measurements John Byers with Paul Barford (now at Wisconsin), Azer Bestavros,
1 Graph Algorithms Minimum Spanning Trees (MST) Union - Find Dana Shapira.
1 Approximate Distance Oracles Mikkel Thorup AT&T Research Uri Zwick Tel Aviv University.
Subgraph Containment Search Dayu Yuan The Pennsylvania State University 1© Dayu Yuan9/7/2015.
Lecture 5: Topology Control
