Ioannis Koutis
lowerbounds-survey/references.bib at master · dasarpmar/lowerbounds-survey · GitHub
PDF) Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Knochenmark Pflege ablassen dblp ioannis koutis Zeigen Winter Dies
PDF) Towards the effective parallel computation of matrix pseudospectra.
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
PDF) Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Spectral Algorithms for Temporal Graph Cuts
PDF) A Nearly-m log n Time Solver for SDD Linear Systems
PDF) HOPS: Probabilistic Subtree Mining for Small and Large Graphs
Kanat Tangwongsan's 46 research works in Philosophy and Social Science
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
Sebastian Forster (University of Salzburg)
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
Publications
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
PDF) Two Arc-Disjoint Paths in Eulerian Digraphs
