| Publication | Date of Publication | Type |
|---|
On the hardness of allocating frequencies for hybrid networks
| 2024-06-05 | Paper |
Near-optimal distributed edge coloring
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Communities, Random Walks, and Social Sybil Defense
Internet Mathematics | 2021-04-23 | Paper |
Some simple distributed algorithms for sparse networks
Distributed Computing | 2020-12-03 | Paper |
Randomized naming using wait-free shared variables
| 2020-12-02 | Paper |
Tracks from hell -- when finding a proof may be easier than checking it
Theoretical Computer Science | 2020-09-03 | Paper |
Tracks from hell -- when finding a proof may be easier than checking it
| 2020-08-11 | Paper |
How to schedule a cascade in an arbitrary graph
SIAM Journal on Computing | 2020-05-31 | Paper |
On the Distortion of Locality Sensitive Hashing
SIAM Journal on Computing | 2019-05-07 | Paper |
Rumor spreading and conductance
Journal of the ACM | 2018-12-06 | Paper |
Trainyard is NP-hard
Theoretical Computer Science | 2018-11-23 | Paper |
Distributed weighted vertex cover via maximal matchings
ACM Transactions on Algorithms | 2018-11-05 | Paper |
The distortion of locality sensitive hashing
| 2018-05-03 | Paper |
Fast randomized algorithms for distributed edge coloring (extended abstract)
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
Trainyard is NP-hard
| 2017-07-17 | Paper |
Approximate Max \(k\)-Cut with subgraph guarantee
Information Processing Letters | 2016-06-09 | Paper |
A faster distributed algorithm for computing maximal matchings deterministically
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing | 2015-09-11 | Paper |
scientific article; zbMATH DE number 6472602 (Why is no real title available?)
| 2015-08-14 | Paper |
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Expansion properties of (secure) wireless networks
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Models for the Compressible Web
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Rumour spreading and graph conductance
| 2014-05-22 | Paper |
Models for the Compressible Web
SIAM Journal on Computing | 2014-02-04 | Paper |
Rumor spreading in random evolving graphs
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Fast primal-dual distributed algorithms for scheduling and matching problems
Distributed Computing | 2013-06-28 | Paper |
On the importance of having an identity or, is consensus really universal?
Distributed Computing | 2013-06-07 | Paper |
Concentration of measure for the analysis of randomized algorithms.
| 2012-06-26 | Paper |
Rumor spreading in social networks
Theoretical Computer Science | 2011-06-07 | Paper |
Low degree connectivity of ad-hoc networks via percolation
Advances in Applied Probability | 2010-07-13 | Paper |
On Active Attacks on Sensor Network Key Distribution Schemes
Algorithmic Aspects of Wireless Sensor Networks | 2010-01-05 | Paper |
Concentration of Measure for the Analysis of Randomized Algorithms
| 2009-09-01 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Rumor Spreading in Social Networks
Automata, Languages and Programming | 2009-07-14 | Paper |
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
SIAM Journal on Computing | 2009-06-22 | Paper |
Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Cuts and Disjoint Paths in the Valley-Free Path Model
Internet Mathematics | 2008-04-29 | Paper |
Localized techniques for broadcasting in wireless sensor networks
Algorithmica | 2008-02-18 | Paper |
Fast Distributed Algorithms Via Primal-Dual (Extended Abstract)
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Journal of Computer and System Sciences | 2005-12-07 | Paper |
An experimental study of a simple, distributed edge-coloring algorithm
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
An experimental analysis of simple, distributed vertex coloring algorithms
Algorithmica | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2119716 (Why is no real title available?)
| 2004-11-29 | Paper |
Packing cuts in undirected graphs
Networks | 2004-08-20 | Paper |
scientific article; zbMATH DE number 2079403 (Why is no real title available?)
| 2004-07-28 | Paper |
Packing cycles in undirected graphs
Journal of Algorithms | 2004-03-14 | Paper |
scientific article; zbMATH DE number 1875440 (Why is no real title available?)
| 2003-03-02 | Paper |
On the distributed complexity of computing maximal matchings
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
scientific article; zbMATH DE number 1696671 (Why is no real title available?)
| 2002-01-28 | Paper |
scientific article; zbMATH DE number 1670531 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1555924 (Why is no real title available?)
| 2001-01-24 | Paper |
Fast Distributed Algorithms for Brooks–Vizing Colorings
Journal of Algorithms | 2000-11-05 | Paper |
scientific article; zbMATH DE number 1303589 (Why is no real title available?)
| 2000-06-21 | Paper |
scientific article; zbMATH DE number 1332666 (Why is no real title available?)
| 1999-09-08 | Paper |
scientific article; zbMATH DE number 1303560 (Why is no real title available?)
| 1999-06-17 | Paper |
Near-optimal, distributed edge colouring via the nibble method
Theoretical Computer Science | 1999-01-12 | Paper |
On the hardness of allocating frequencies for hybrid networks
Theoretical Computer Science | 1999-01-12 | Paper |
scientific article; zbMATH DE number 1175942 (Why is no real title available?)
| 1998-07-19 | Paper |
Nearly optimal distributed edge coloring in O(log log n) rounds
| 1997-07-15 | Paper |
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
SIAM Journal on Computing | 1997-05-26 | Paper |
Approximability of maximum splitting of k-sets and some other Apx-complete problems
Information Processing Letters | 1997-02-27 | Paper |
On the Complexity of Distributed Network Decomposition
Journal of Algorithms | 1996-05-06 | Paper |
The local nature of \(\Delta\)-coloring and its algorithmic applications
Combinatorica | 1996-04-16 | Paper |
Quantifiers and approximation
Theoretical Computer Science | 1993-05-16 | Paper |
Completeness in approximation classes
Information and Computation | 1991-01-01 | Paper |
Predicting deadlock in store‐and‐forward networks
Networks | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4090795 (Why is no real title available?)
| 1988-01-01 | Paper |
Inclusion relationships among permutation problems
Discrete Applied Mathematics | 1987-01-01 | Paper |
