| Publication | Date of Publication | Type |
|---|
Low-diameter graph decomposition is in NC
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
| Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance | 2022-04-22 | Paper |
| Associated data for D-SCRIPT, Cell Systems | 2021-07-27 | Dataset |
Diffusion state distances: multitemporal analysis, fast algorithms, and applications to biological networks
SIAM Journal on Mathematics of Data Science | 2021-07-06 | Paper |
Compact routing on power law graphs with additive stretch
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Computing the diffusion state distance on graphs via algebraic multigrid and random projections.
Numerical Linear Algebra with Applications | 2018-10-01 | Paper |
Fast network decomposition
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
Efficient asynchronous distributed symmetry breaking
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Compact roundtrip routing with topology-independent node names
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
| scientific article; zbMATH DE number 6472631 (Why is no real title available?) | 2015-08-14 | Paper |
Compact roundtrip routing in directed networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Compact roundtrip routing with topology-independent node names
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Compact Routing with Name Independence
SIAM Journal on Discrete Mathematics | 2007-09-06 | Paper |
Compact roundtrip routing in directed networks
Journal of Algorithms | 2004-10-04 | Paper |
| scientific article; zbMATH DE number 2102784 (Why is no real title available?) | 2004-09-24 | Paper |
The distinguishing number of the hypercube
Discrete Mathematics | 2004-08-06 | Paper |
Approximation algorithms for the class cover problem
Annals of Mathematics and Artificial Intelligence | 2004-05-27 | Paper |
Compact routing with minimum stretch
Journal of Algorithms | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1472096 (Why is no real title available?) | 2000-11-22 | Paper |
A generalized wilcoxon-mann-whitney statistic
Communications in Statistics: Theory and Methods | 2000-09-24 | Paper |
| scientific article; zbMATH DE number 1305414 (Why is no real title available?) | 2000-08-07 | Paper |
| scientific article; zbMATH DE number 1305501 (Why is no real title available?) | 1999-06-17 | Paper |
A formal framework for evaluating heuristic programs
Annals of Mathematics and Artificial Intelligence | 1998-10-13 | Paper |
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing | 1998-09-21 | Paper |
Randomized nonlinear projections uncover high-dimensional structure
Advances in Applied Mathematics | 1997-11-19 | Paper |
| Defective coloring revisited | 1997-11-16 | Paper |
The Offset Problem
Combinatorics, Probability and Computing | 1997-08-07 | Paper |
Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing | 1996-01-01 | Paper |
Scheduling with Concurrency-Based Constraints
Journal of Algorithms | 1995-04-09 | Paper |
| scientific article; zbMATH DE number 432814 (Why is no real title available?) | 1993-10-20 | Paper |
Concurrence probabilities for a locally slotted packet radio network by combinatorial methods
Performance Evaluation | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 4191077 (Why is no real title available?) | 1991-01-01 | Paper |
The VOROS: Lifting ROC curves to 3D
(available as arXiv preprint) | N/A | Paper |
