| Publication | Date of Publication | Type |
|---|
| Learning noisy perceptrons by a perceptron in polynomial time | 2026-05-21 | Paper |
A framework for adversarial streaming via differential privacy and difference estimators
Algorithmica | 2024-10-24 | Paper |
| A framework for adversarial streaming via differential privacy and difference estimators | 2024-09-25 | Paper |
| Generalized private selection and testing with high confidence | 2024-09-25 | Paper |
| Optimal differentially private learning of thresholds and quasi-concave optimization | 2024-05-08 | Paper |
scientific article; zbMATH DE number 7650377 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Restoration by path concatenation: fast recovery of MPLS paths
Distributed Computing | 2020-12-03 | Paper |
| scientific article; zbMATH DE number 7051297 (Why is no real title available?) | 2019-05-06 | Paper |
Stream sampling framework and application for frequency cap statistics
ACM Transactions on Algorithms | 2019-03-28 | Paper |
On optimizing multiplications of sparse matrices
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
On the tradeoff between stability and fit
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On the tradeoff between stability and fit
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Average distance queries through weighted samples in graphs and metric spaces: high scalability with tight statistical guarantees
(available as arXiv preprint) | 2017-08-31 | Paper |
Connection caching
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Exploiting regularities in web traffic patterns for cache replacement
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Polylog-time and near-linear work approximation scheme for undirected shortest paths (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Restoration by path concatenation, fast recovery of MPLS paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Estimation for monotone sampling
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
| scientific article; zbMATH DE number 6472646 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6472582 (Why is no real title available?) | 2015-08-14 | Paper |
| Efficient estimation algorithms for neighborhood variance and other moments | 2015-08-03 | Paper |
Algorithms and estimators for summarization of unaggregated data streams
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Summarizing data using bottom-k sketches
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Scheduling Subset Tests: One-Time, Continuous, and How They Relate
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
What you can do with coordinated samples
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Envy-free makespan approximation
SIAM Journal on Computing | 2012-05-30 | Paper |
Efficient stream sampling for variance-optimal estimation of subset sums
SIAM Journal on Computing | 2012-02-11 | Paper |
Labeling Dynamic XML Trees
SIAM Journal on Computing | 2010-11-04 | Paper |
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Processing top-k queries from samples
Computer Networks | 2008-10-08 | Paper |
Associative search in peer to peer networks: Harnessing latent semantics
Computer Networks | 2007-04-26 | Paper |
Spatially-decaying aggregation over a network
Journal of Computer and System Sciences | 2007-04-26 | Paper |
Maintaining time-decaying stream aggregates
Journal of Algorithms | 2006-10-05 | Paper |
A short walk in the blogistan
Computer Networks | 2006-06-30 | Paper |
Performance aspects of distributed caches using TTL-based consistency
Theoretical Computer Science | 2005-04-06 | Paper |
Balanced-Replication Algorithms for Distribution Trees
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2119758 (Why is no real title available?) | 2004-11-29 | Paper |
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2079406 (Why is no real title available?) | 2004-07-28 | Paper |
Reachability and Distance Queries via 2-Hop Labels
SIAM Journal on Computing | 2003-09-28 | Paper |
Connection caching: Model and algorithms.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
Proactive caching of DNS records: Addressing a performance bottleneck.
Computer Networks | 2003-08-13 | Paper |
| scientific article; zbMATH DE number 1947401 (Why is no real title available?) | 2003-07-08 | Paper |
Polylog-time and near-linear work approximation scheme for undirected shortest paths
Journal of the ACM | 2003-06-25 | Paper |
Competitive analysis of the LRFU paging algorithm
Algorithmica | 2002-12-01 | Paper |
| scientific article; zbMATH DE number 1830729 (Why is no real title available?) | 2002-11-18 | Paper |
Exploiting regularities in web traffic patterns for cache replacement
Algorithmica | 2002-06-17 | Paper |
| scientific article; zbMATH DE number 1754633 (Why is no real title available?) | 2002-06-12 | Paper |
Caching documents with variable sizes and fetching costs: an LP-based approach
Algorithmica | 2002-05-21 | Paper |
| Maximizing concave functions in fixed dimension | 2001-09-18 | Paper |
All-pairs small-stretch paths
Journal of Algorithms | 2001-07-23 | Paper |
Structure prediction and computation of sparse matrix products
Journal of Combinatorial Optimization | 2001-02-08 | Paper |
| scientific article; zbMATH DE number 1305498 (Why is no real title available?) | 1999-09-15 | Paper |
| scientific article; zbMATH DE number 1256703 (Why is no real title available?) | 1999-07-05 | Paper |
Approximating Matrix Multiplication for Pattern Recognition Tasks
Journal of Algorithms | 1999-03-30 | Paper |
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing | 1998-09-21 | Paper |
Size-estimation framework with applications to transitive closure and reachability
Journal of Computer and System Sciences | 1998-08-04 | Paper |
Using Selective Path-Doubling for Parallel Shortest-Path Computations
Journal of Algorithms | 1997-10-19 | Paper |
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
Journal of Algorithms | 1997-03-03 | Paper |
Approximate Max-Flow on Small Depth Networks
SIAM Journal on Computing | 1995-07-26 | Paper |
Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
SIAM Journal on Computing | 1995-04-06 | Paper |
New algorithms for generalized network flows
Mathematical Programming. Series A. Series B | 1994-10-10 | Paper |
Algorithms and complexity analysis for some flow problems
Algorithmica | 1994-09-11 | Paper |
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
Journal of the ACM | 1994-02-24 | Paper |
| scientific article; zbMATH DE number 432812 (Why is no real title available?) | 1993-10-20 | Paper |
| scientific article; zbMATH DE number 17635 (Why is no real title available?) | 1992-06-26 | Paper |
NP-completeness of graph decomposition problems
Journal of Complexity | 1992-06-26 | Paper |
