PDF) A Nearly-m log n Time Solver for SDD Linear Systems
Sebastian Forster (University of Salzburg)
Publications
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Kanat Tangwongsan's 46 research works in Philosophy and Social Science
Sebastian Forster (University of Salzburg)
Ioannis Koutis's 53 research works in Medicine and Political Science
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
Spectral Algorithms for Temporal Graph Cuts
Ioannis Koutis's 53 research works in Medicine and Political Science
Gary Miller (computer scientist) - Wikiwand
Ioannis Koutis
Ioannis Koutis's 53 research works in Medicine and Political Science
Kanat Tangwongsan's 46 research works in Philosophy and Social Science
PDF) Locating highly connected clusters in large networks with HyperLogLog counters
Ioannis Koutis's 53 research works in Medicine and Political Science
Kanat Tangwongsan's 46 research works in Philosophy and Social Science
Ioannis Koutis's 53 research works in Medicine and Political Science
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Kanat Tangwongsan's 46 research works in Philosophy and Social Science
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
PDF) Towards the effective parallel computation of matrix pseudospectra.
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
