activity
20112013
most citedIncremental Algorithms for Network Management and Analysis based on Closeness Centrality

16 citations · 27 across the 5 of their papers we have counts for

collaborators

5 papers

cs.DS201316 cited

Incremental Algorithms for Network Management and Analysis based on Closeness Centrality

Ahmet Erdem Sariyuce, Kamer Kaya, Erik Saule +1

Analyzing networks requires complex algorithms to extract meaningful information. Centrality metrics have shown to be correlated with the importance and loads of the nodes in netwo…

cs.PF20133 cited

Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi

Erik Saule, Kamer Kaya, Umit V. Catalyurek

Intel Xeon Phi is a recently released high-performance coprocessor which features 61 cores each supporting 4 hardware threads with 512-bit wide SIMD registers achieving a peak theo…

cs.DS20126 cited

Shattering and Compressing Networks for Centrality Analysis

Ahmet Erdem Sarıyüce, Erik Saule, Kamer Kaya +1

Who is more important in a network? Who controls the flow between the nodes or whose contribution is significant for connections? Centrality metrics play an important role while an…

cs.IR20121 cited

Diversifying Citation Recommendations

Onur Küçüktunç, Erik Saule, Kamer Kaya +1

Literature search is arguably one of the most important phases of the academic and non-academic research. The increase in the number of published papers each year makes manual sear…

cs.DC20111 cited

Load-Balancing Spatially Located Computations using Rectangular Partitions

Erik Saule, Erdeniz Ö. Baş, Ümit V. Çatalyürek

Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (represen…