Graph Theory With Applications
Problem Reformulation and Search Patrick Prosser & Evgeny Selensky.
1 Parallelizing Irregular Applications through the Exploitation of Amorphous Data-parallelism Keshav Pingali (UT, Austin) Milind Kulkarni (Purdue) Mario.
1 Parallelizing Irregular Applications through the Exploitation of Amorphous Data-parallelism Keshav Pingali (UT, Austin) Mario Mendez-Lojo (UT, Austin)
Kernel Entropy Component Analysis in Remote Sensing Data Clustering.pdf
Algorithms in nature
Ch01
Strongly Well-covered Graphs Pinter
A Characterization of Certain Families of Graphs Moussi
On the robustness of dictatorships: spectral methods. Ehud Friedgut, Hebrew University, Jerusalem.
1 K-clustering in Wireless Ad Hoc Networks Fernandess and Malkhi Hebrew University of Jerusalem Presented by: Ashish Deopura.
Università degli Studi dell’Aquila Academic Year 2015/2016 Course: Distributed Systems (integrated within the NEDAS curriculum with ‘’Web Algorithms’’,
