PDF) On Sampling from Multivariate Distributions
Gary Miller (computer scientist) - Wikipedia
PDF) Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Publications - Carnegie Mellon Database Group
PDF) The Resistance Perturbation Distance: A Metric for the Analysis of Dynamic Networks
PDF) Function Matching
PDF) Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
PDF) Towards the effective parallel computation of matrix pseudospectra.
PDF) Stable Transductive Learning
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams | ACM Transactions on Knowledge Discovery from Data
Ioannis Koutis's research works | University of Puerto Rico at Rio Piedras, San Juan (UPR-RP) and other places
Ioannis Koutis's research works | University of Puerto Rico at Rio Piedras, San Juan (UPR-RP) and other places
Sebastian Forster (University of Salzburg)
PDF) Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
PDF) Large Scale Spectral Clustering Using Approximate Commute Time Embedding
PDF) Finding effective support-tree preconditioned
PDF) On the Discrete Unit Disk Cover Problem
Publications
PDF) Parallel Computation of Pseudospectra using Transfer Functions on a MATLAB-MPI Cluster Platform
Publications - Carnegie Mellon Database Group
PDF) Locating highly connected clusters in large networks with HyperLogLog counters
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
PDF) A Nearly-m log n Time Solver for SDD Linear Systems
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
crosstex-dbgen/focs.xtx at master · el33th4x0r/crosstex-dbgen · GitHub
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
