| Publication | Date of Publication | Type |
|---|
Approximate realizations for outerplanaric degree sequences
Journal of Computer and System Sciences | 2024-12-27 | Paper |
Graph realization of distance sets
Theoretical Computer Science | 2024-11-06 | Paper |
| Graph realization of distance sets | 2024-08-06 | Paper |
| On the role of the high-low partition in realizing a degree sequence by a bipartite graph | 2024-08-06 | Paper |
| Approximate maxima finding of continuous functions under restricted budget (extended abstract) | 2024-06-05 | Paper |
| On realizing a single degree sequence by a bipartite graph | 2024-05-27 | Paper |
Brief Announcement: Local Problems in the SUPPORTED Model
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7788600 (Why is no real title available?) | 2024-01-15 | Paper |
Degree realization by bipartite multigraphs
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Weighted microscopic image reconstruction
Discrete Applied Mathematics | 2024-01-09 | Paper |
scientific article; zbMATH DE number 7774278 (Why is no real title available?)
(available as arXiv preprint) | 2023-12-08 | Paper |
Optimal Broadcast with Partial Knowledge
Distributed Algorithms | 2023-12-01 | Paper |
| Singularly optimal randomized leader election | 2023-11-02 | Paper |
scientific article; zbMATH DE number 7759278 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication
ACM Transactions on Algorithms | 2023-10-23 | Paper |
The power of small coalitions under two-tier majority on regular graphs
Discrete Applied Mathematics | 2023-09-14 | Paper |
scientific article; zbMATH DE number 7724205 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
Graph realizations: maximum degree in vertex neighborhoods
Discrete Mathematics | 2023-06-12 | Paper |
Forcibly bipartite and acyclic (uni-)graphic sequences
Discrete Mathematics | 2023-05-15 | Paper |
| On vertex-weighted graph realizations | 2023-03-22 | Paper |
Composed degree-distance realizations of graphs
Algorithmica | 2023-03-09 | Paper |
| scientific article; zbMATH DE number 7651149 (Why is no real title available?) | 2023-02-07 | Paper |
| The Generalized Microscopic Image Reconstruction Problem | 2023-02-03 | Paper |
| Efficiently Realizing Interval Sequences | 2023-02-03 | Paper |
Load balancing in quorum systems
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Low-diameter graph decomposition is in NC
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Generating sparse 2—spanners
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
The generalized microscopic image reconstruction problem
Discrete Applied Mathematics | 2022-09-15 | Paper |
| Vertex-weighted graphs: realizable and unrealizable domains | 2022-07-13 | Paper |
On vertex-weighted realizations of acyclic and general graphs
Theoretical Computer Science | 2022-06-13 | Paper |
Hotelling games in fault-prone settings
Theoretical Computer Science | 2022-06-13 | Paper |
Mixed preferential attachment model: homophily and minorities in social networks
Physica A | 2022-05-19 | Paper |
| Weighted microscopic image reconstruction | 2022-03-24 | Paper |
| Relaxed and approximate graph realizations | 2022-03-22 | Paper |
Composed degree-distance realizations of graphs
Lecture Notes in Computer Science | 2022-03-22 | Paper |
Nonuniform SINR+Voronoi diagrams are effectively uniform
Theoretical Computer Science | 2021-07-22 | Paper |
Compact and localized distributed data structures
Distributed Computing | 2020-12-04 | Paper |
Efficiently realizing interval sequences
SIAM Journal on Discrete Mathematics | 2020-12-04 | Paper |
Assigning labels in an unknown anonymous network with a leader
Distributed Computing | 2020-12-03 | Paper |
Sparse communication networks and efficient routing in the plane
Distributed Computing | 2020-12-03 | Paper |
Crumbling walls: a class of practical and efficient quorum systems
Distributed Computing | 2020-12-02 | Paper |
Fault tolerant approximate BFS structures with additive stretch
Algorithmica | 2020-11-11 | Paper |
Mixed fault tolerance in server assignment: combining reinforcement and backup
Theoretical Computer Science | 2020-08-25 | Paper |
Hotelling games with random tolerance intervals
(available as arXiv preprint) | 2020-06-30 | Paper |
Message lower bounds via efficient network synchronization
Theoretical Computer Science | 2020-02-06 | Paper |
Vertex-weighted realizations of graphs
Theoretical Computer Science | 2020-01-22 | Paper |
| Graph profile realizations and applications to social networks | 2019-10-15 | Paper |
Distributed distance computation and routing with small messages
Distributed Computing | 2019-06-20 | Paper |
Fault Tolerant Approximate BFS Structures
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Generalized Perron-Frobenius theorem for multiple choice matrices, and applications
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Gathering despite mischief | 2019-05-10 | Paper |
SINR diagram with interference cancellation
(available as arXiv preprint) | 2019-05-10 | Paper |
| SINR diagram with interference cancellation | 2019-05-10 | Paper |
| Realizability of graph specifications: characterizations and algorithms | 2019-01-30 | Paper |
Mixed fault tolerance in server assignment: combining reinforcement and backup
Structural Information and Communication Complexity | 2019-01-30 | Paper |
Fault-tolerant approximate BFS structures
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Label-guided graph exploration by a finite automaton
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Sparse Fault-Tolerant BFS Structures
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Gathering despite mischief
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Forbidden-set distance labels for graphs of bounded doubling dimension
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| Nonuniform SINR+Voroni diagrams are effectively uniform | 2018-08-24 | Paper |
The topology of wireless communication
Journal of the ACM | 2018-08-02 | Paper |
Dynamic \((1 + \epsilon)\)-approximate matchings: a density-sensitive approach
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Local-on-average distributed tasks
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved approximation algorithms for weighted 2-path partitions
Discrete Applied Mathematics | 2018-03-21 | Paper |
The topology of wireless communication on a line
Theoretical Computer Science | 2018-02-16 | Paper |
Secluded connectivity problems
Algorithmica | 2017-11-09 | Paper |
Assortative mixing equilibria in social network games
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering | 2017-11-01 | Paper |
Fault-local distributed mending (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 | 2017-09-29 | Paper |
Fast distributed construction of k-dominating sets and applications
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 | 2017-09-29 | Paper |
Crumbling walls
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 | 2017-09-29 | Paper |
Fast network decomposition
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
On the effect of the deployment setting on broadcasting in Euclidean radio networks
Distributed Computing | 2017-06-22 | Paper |
Homophily and the glass ceiling effect in social networks
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Sublinear bounds for randomized leader election
Lecture Notes in Computer Science | 2016-12-19 | Paper |
Message Lower Bounds via Efficient Network Synchronization
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Feedback vertex set in hypercubes
Information Processing Letters | 2016-06-16 | Paper |
Discovery through gossip
Random Structures & Algorithms | 2016-06-10 | Paper |
Distributed MST for constant diameter graphs
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Average probe complexity in quorum systems
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Efficient \(k\)-shot broadcasting in radio networks
Discrete Applied Mathematics | 2016-02-12 | Paper |
Nearly optimal local broadcasting in the SINR model with feedback
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Improved approximation algorithms for weighted 2-path partitions
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Core size and densification in preferential attachment networks
Automata, Languages, and Programming | 2015-11-04 | Paper |
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
| scientific article; zbMATH DE number 6472583 (Why is no real title available?) | 2015-08-14 | Paper |
On the Complexity of Universal Leader Election
Journal of the ACM | 2015-08-14 | Paper |
| Fault-tolerant gathering algorithms for autonomous mobile robots | 2015-08-03 | Paper |
| Approximating minimum MAX-stretch spanning trees on unweighted graphs | 2015-08-03 | Paper |
Efficient deadlock-free routing
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Compact deterministic distributed dictionaries (extended abstract)
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Broadcast with partial knowledge (preliminary version)
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Fault tolerant additive and \((\mu, \alpha)\)-spanners
Theoretical Computer Science | 2015-05-18 | Paper |
Truth tellers and liars with fewer questions
Discrete Mathematics | 2015-04-29 | Paper |
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Proof labeling schemes
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Sparse communication networks and efficient routing in the plane (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Assigning labels in unknown anonymous networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Efficient distributed source detection with limited bandwidth
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Forbidden-set distance labels for graphs of bounded doubling dimension
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
On the complexity of universal leader election
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
(1 + εΒ) -spanner constructions for general graphs
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Randomized distributed decision
Distributed Computing | 2015-02-23 | Paper |
Fault-tolerant spanners for general graphs
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
The fault-tolerant capacitated \(K\)-center problem
Theoretical Computer Science | 2015-01-06 | Paper |
On the effect of the deployment setting on broadcasting in Euclidean radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Sublinear bounds for randomized leader election
Theoretical Computer Science | 2014-12-02 | Paper |
A near-linear-time algorithm for computing replacement paths in planar directed graphs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Improved recommendation systems | 2014-10-13 | Paper |
Testing the irreducibility of nonsquare Perron-Frobenius systems
Information Processing Letters | 2014-08-28 | Paper |
Local Distributed Decision
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
SINR diagrams, towards algorithmically usable SINR models of wireless networks
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Robust fault tolerant uncapacitated facility location
Theoretical Computer Science | 2014-07-07 | Paper |
Distributed computing on core-periphery networks: axiom-based design
Automata, Languages, and Programming | 2014-07-01 | Paper |
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
The topology of wireless communication
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
On approximating the \(d\)-girth of a graph
Discrete Applied Mathematics | 2014-04-10 | Paper |
Broadcasting in UDG radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Towards a complexity theory for local distributed computing
Journal of the ACM | 2014-02-17 | Paper |
SINR diagrams, convexity and its applications in wireless networks
Journal of the ACM | 2014-02-17 | Paper |
Tight bounds for distributed minimum-weight spanning tree verification
Theory of Computing Systems | 2013-10-21 | Paper |
Sparse fault-tolerant BFS trees
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Secluded connectivity problems
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Time efficient \(k\)-shot broadcasting in known topology radio networks
Distributed Computing | 2013-07-04 | Paper |
Compact separator decompositions in dynamic trees and applications to labeling schemes
Distributed Computing | 2013-07-04 | Paper |
Proof labeling schemes
Distributed Computing | 2013-06-28 | Paper |
Broadcasting in UDG radio networks with unknown topology
Distributed Computing | 2013-06-28 | Paper |
Faster communication in known topology radio networks
Distributed Computing | 2013-06-20 | Paper |
Distributed MST for constant diameter graphs
Distributed Computing | 2013-06-13 | Paper |
Multipath spanners via fault-tolerant spanners
Lecture Notes in Computer Science | 2013-04-19 | Paper |
A note on exact distance labeling
Information Processing Letters | 2013-04-04 | Paper |
Randomized distributed decision
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Relaxed spanners for directed disk graphs
Algorithmica | 2013-03-05 | Paper |
Distributed verification and hardness of distributed approximation
SIAM Journal on Computing | 2013-02-04 | Paper |
\(f\)-sensitivity distance oracles and routing schemes
Algorithmica | 2012-12-06 | Paper |
Fault tolerant additive spanners
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Distributed algorithms for network diameter and girth
Automata, Languages, and Programming | 2012-11-01 | Paper |
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics | 2012-08-14 | Paper |
Sparse reliable graph backbones
Information and Computation | 2012-05-24 | Paper |
| Robust fault tolerant uncapacitated facility location | 2012-01-23 | Paper |
| Tight bounds for distributed MST verification | 2012-01-23 | Paper |
| Relaxed Spanners for Directed Disk Graphs | 2012-01-23 | Paper |
Fault tolerant spanners for general graphs
SIAM Journal on Computing | 2011-04-04 | Paper |
On Approximating the d-Girth of a Graph
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
A tight upper bound on the probabilistic embedding of series-parallel graphs
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Sparse reliable graph backbones
Automata, Languages and Programming | 2010-09-07 | Paper |
\(f\)-sensitivity distance oracles and routing schemes
Algorithms – ESA 2010 | 2010-09-06 | Paper |
A tight upper bound on the probabilistic embedding of series-parallel graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764782 (Why is no real title available?) | 2010-08-06 | Paper |
Constructing labeling schemes through universal matrices
Algorithmica | 2010-05-28 | Paper |
Approximation algorithm for hotlink assignments in web directories.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Equal-area locus-based convex polygon decomposition
Theoretical Computer Science | 2010-04-06 | Paper |
Time-efficient broadcast in radio networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Low-port tree representations
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Efficient k-Shot Broadcasting in Radio Networks
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Local Computation of Nearly Additive Spanners
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
SIAM Journal on Computing | 2009-11-06 | Paper |
Computing the fault tolerance of multi-agent deployment
Artificial Intelligence | 2009-08-31 | Paper |
Broadcasting with locally bounded byzantine faults
Information Processing Letters | 2009-08-27 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Conflict-free coloring of unit disks
Discrete Applied Mathematics | 2009-06-30 | Paper |
Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
Journal of Discrete Algorithms | 2009-06-24 | Paper |
Labeling schemes for tree representation
Algorithmica | 2009-05-13 | Paper |
Distributed algorithms for partitioning a swarm of autonomous mobile robots
Theoretical Computer Science | 2009-03-30 | Paper |
Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
SIAM Journal on Computing | 2009-03-16 | Paper |
Dynamic Routing Schemes for General Graphs
Automata, Languages and Programming | 2009-03-12 | Paper |
Local Algorithms for Autonomous Robot Systems
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Approximation and Online Algorithms | 2009-02-12 | Paper |
Time-Efficient Broadcasting in Radio Networks
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Energy and Time Efficient Broadcasting in Known Topology Radio Networks
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Equal-Area Locus-Based Convex Polygon Decomposition
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Local spreading algorithms for autonomous robot systems
Theoretical Computer Science | 2008-06-24 | Paper |
Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
Journal of Discrete Algorithms | 2008-05-16 | Paper |
Constructing Labeling Schemes Through Universal Matrices
Algorithms and Computation | 2008-04-24 | Paper |
Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks
Combinatorial and Algorithmic Aspects of Networking | 2008-04-17 | Paper |
Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
STACS 2006 | 2008-03-19 | Paper |
Distributed Models and Algorithms for Mobile Robot Systems
Lecture Notes in Computer Science | 2008-03-07 | Paper |
The hardness of approximating spanner problems
Theory of Computing Systems | 2007-12-19 | Paper |
Labeling schemes for weighted dynamic trees
Information and Computation | 2007-12-10 | Paper |
Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots
Structural Information and Communication Complexity | 2007-11-15 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Approximation algorithm for hotlink assignment in the greedy model
Theoretical Computer Science | 2007-09-19 | Paper |
Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Average stretch analysis of compact routing schemes
Discrete Applied Mathematics | 2007-04-13 | Paper |
Feasibility and complexity of broadcasting with random transmission failures
Theoretical Computer Science | 2007-02-26 | Paper |
Asynchronous resource discovery in peer-to-peer networks
Computer Networks | 2006-12-07 | Paper |
Distributed Computing – IWDC 2005
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Distributed Computing – IWDC 2005
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Average probe complexity in quorum systems
Journal of Computer and System Sciences | 2006-06-30 | Paper |
Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
SIAM Journal on Computing | 2006-06-01 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Graph exploration by a finite automaton
Theoretical Computer Science | 2005-12-06 | Paper |
Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
SIAM Journal on Computing | 2005-10-28 | Paper |
Informative labeling schemes for graphs
Theoretical Computer Science | 2005-09-22 | Paper |
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
SIAM Journal on Computing | 2005-09-16 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Polynomial time approximation schemes for base station coverage with minimum total radii
Computer Networks | 2005-08-03 | Paper |
Approximating \(k\)-spanner problems for \(k>2\)
Theoretical Computer Science | 2005-06-30 | Paper |
Virtual path layouts optimizing total hop count on ATM tree networks
Journal of Discrete Algorithms | 2005-05-04 | Paper |
Distance labeling schemes for well-separated graph classes
Discrete Applied Mathematics | 2005-02-23 | Paper |
Labeling Schemes for Flow and Connectivity
SIAM Journal on Computing | 2005-02-21 | Paper |
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
SIAM Journal on Computing | 2005-02-21 | Paper |
Labeling schemes for dynamic tree networks
Theory of Computing Systems | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2119757 (Why is no real title available?) | 2004-11-29 | Paper |
Distance labeling in graphs
Journal of Algorithms | 2004-11-12 | Paper |
Deterministic resource discovery in distributed networks
Theory of Computing Systems | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2089212 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086375 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2044937 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 2038724 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 2011838 (Why is no real title available?) | 2003-12-02 | Paper |
| scientific article; zbMATH DE number 2011833 (Why is no real title available?) | 2003-12-02 | Paper |
| scientific article; zbMATH DE number 2006657 (Why is no real title available?) | 2003-11-23 | Paper |
| scientific article; zbMATH DE number 1929927 (Why is no real title available?) | 2003-06-18 | Paper |
Compact routing schemes with low stretch factor
Journal of Algorithms | 2003-05-27 | Paper |
Directed virtual path layouts in ATM networks
Theoretical Computer Science | 2003-05-14 | Paper |
| scientific article; zbMATH DE number 1875437 (Why is no real title available?) | 2003-03-02 | Paper |
Faster exact solutions for some NP-hard problems.
Theoretical Computer Science | 2003-01-21 | Paper |
Distributed probabilistic polling and applications to proportionate agreement
Information and Computation | 2003-01-14 | Paper |
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1759444 (Why is no real title available?) | 2002-11-04 | Paper |
Local majorities, coalitions and monopolies in graphs: A review
Theoretical Computer Science | 2002-07-15 | Paper |
Low complexity variants of the arrow distributed directory
Journal of Computer and System Sciences | 2002-07-04 | Paper |
| scientific article; zbMATH DE number 1757950 (Why is no real title available?) | 2002-06-20 | Paper |
The compactness of interval routing for almost all graphs
SIAM Journal on Computing | 2002-04-23 | Paper |
| Distance labeling in graphs (extended abstract) | 2002-03-14 | Paper |
| scientific article; zbMATH DE number 1696667 (Why is no real title available?) | 2002-01-28 | Paper |
| scientific article; zbMATH DE number 1670859 (Why is no real title available?) | 2001-12-09 | Paper |
| scientific article; zbMATH DE number 1629828 (Why is no real title available?) | 2001-11-01 | Paper |
| scientific article; zbMATH DE number 1629974 (Why is no real title available?) | 2001-10-23 | Paper |
| scientific article; zbMATH DE number 1617261 (Why is no real title available?) | 2001-07-11 | Paper |
The wakeup problem in synchronous broadcast systems
SIAM Journal on Discrete Mathematics | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1500540 (Why is no real title available?) | 2001-06-13 | Paper |
The dense \(k\)-subgraph problem
Algorithmica | 2001-04-17 | Paper |
A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction
SIAM Journal on Computing | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1532274 (Why is no real title available?) | 2001-03-11 | Paper |
Generalized submodular cover problems and applications
Theoretical Computer Science | 2000-12-12 | Paper |
| Distributed Computing: A Locality-Sensitive Approach | 2000-11-21 | Paper |
Tight Fault Locality
SIAM Journal on Computing | 2000-10-18 | Paper |
| Proximity-preserving labeling schemes | 2000-10-08 | Paper |
| scientific article; zbMATH DE number 1420896 (Why is no real title available?) | 2000-10-08 | Paper |
| scientific article; zbMATH DE number 1306903 (Why is no real title available?) | 2000-04-26 | Paper |
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
SIAM Journal on Computing | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1405801 (Why is no real title available?) | 2000-02-23 | Paper |
Approximating the weight of shallow Steiner trees
Discrete Applied Mathematics | 2000-02-07 | Paper |
Edge-disjoint spanners of complete graphs and complete digraphs
Discrete Mathematics | 1999-12-20 | Paper |
The Compactness of Interval Routing
SIAM Journal on Discrete Mathematics | 1999-11-23 | Paper |
| scientific article; zbMATH DE number 1263229 (Why is no real title available?) | 1999-06-29 | Paper |
Fault-Local Distributed Mending
Journal of Algorithms | 1999-06-21 | Paper |
Approximate maxima finding of continuous functions under restricted budget
Theoretical Computer Science | 1999-01-12 | Paper |
Size bounds for dynamic monopolies
Discrete Applied Mathematics | 1998-11-03 | Paper |
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing | 1998-09-21 | Paper |
Generating Low-Degree 2-Spanners
SIAM Journal on Computing | 1998-09-21 | Paper |
Optimal Broadcast with Partial Knowledge
SIAM Journal on Computing | 1998-09-21 | Paper |
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
SIAM Journal on Computing | 1998-05-10 | Paper |
Online tracking of mobile users
Journal of the ACM | 1998-01-28 | Paper |
Fast Distributed Construction of Smallk-Dominating Sets and Applications
Journal of Algorithms | 1998-01-01 | Paper |
Randomized approximation of bounded multicovering problems
Algorithmica | 1997-10-29 | Paper |
The availability of crumbling wall quorum systems
Discrete Applied Mathematics | 1997-10-09 | Paper |
| scientific article; zbMATH DE number 1003288 (Why is no real title available?) | 1997-08-03 | Paper |
Load Balancing in Quorum Systems
SIAM Journal on Discrete Mathematics | 1997-05-26 | Paper |
Scheduling jobs using common resources
Information and Computation | 1996-07-03 | Paper |
The availability of quorum systems
Information and Computation | 1996-02-26 | Paper |
The complexity of reconfiguring network models
Information and Computation | 1996-02-20 | Paper |
Approximation Algorithms for Minimum-Time Broadcast
SIAM Journal on Discrete Mathematics | 1996-01-10 | Paper |
Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing | 1996-01-01 | Paper |
Generating Sparse 2-Spanners
Journal of Algorithms | 1995-11-22 | Paper |
On the maximum density of 0-1 matrices with no forbidden rectangles
Discrete Mathematics | 1995-07-27 | Paper |
A note on optimal time broadcast in faulty hypercubes
Journal of Parallel and Distributed Computing | 1995-07-06 | Paper |
A Graph-Theoretic Game and Its Application to the k-Server Problem
SIAM Journal on Computing | 1995-07-03 | Paper |
Greedy Packet Scheduling
SIAM Journal on Computing | 1995-03-27 | Paper |
Traffic-light scheduling on the grid
Discrete Applied Mathematics | 1994-12-11 | Paper |
Computing with Noisy Information
SIAM Journal on Computing | 1994-11-29 | Paper |
How to Allocate Network Centers
Journal of Algorithms | 1994-03-22 | Paper |
Time-space tradeoffs for set operations
Theoretical Computer Science | 1993-08-30 | Paper |
Distance-dependent distributed directories
Information and Computation | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177560 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 65694 (Why is no real title available?) | 1992-09-27 | Paper |
Routing with Polynomial Communication-Space Trade-Off
SIAM Journal on Discrete Mathematics | 1992-09-27 | Paper |
Single round simulation on radio networks
Journal of Algorithms | 1992-06-28 | Paper |
Fault-tolerant critical section management in asynchronous environments
Information and Computation | 1992-06-28 | Paper |
A lower bound for radio broadcast
Journal of Computer and System Sciences | 1992-06-25 | Paper |
A trade-off between space and efficiency for routing tables
Journal of the ACM | 1992-06-25 | Paper |
Tight Bounds on Mimimum Broadcast Networks
SIAM Journal on Discrete Mathematics | 1991-01-01 | Paper |
A trade-off between information and communication in broadcast protocols
Journal of the ACM | 1990-01-01 | Paper |
Renaming in an asynchronous environment
Journal of the ACM | 1990-01-01 | Paper |
Improved routing strategies with succinct tables
Journal of Algorithms | 1990-01-01 | Paper |
Randomized broadcast in networks
Random Structures & Algorithms | 1990-01-01 | Paper |
A Time-Randomness Trade-Off for Oblivious Routing
SIAM Journal on Computing | 1990-01-01 | Paper |
Time bounds on fault‐tolerant broadcasting
Networks | 1989-01-01 | Paper |
An Optimal Synchronizer for the Hypercube
SIAM Journal on Computing | 1989-01-01 | Paper |
Graph spanners
Journal of Graph Theory | 1989-01-01 | Paper |
The Token Distribution Problem
SIAM Journal on Computing | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4119974 (Why is no real title available?) | 1989-01-01 | Paper |
Constructing disjoint paths on expander graphs
Combinatorica | 1989-01-01 | Paper |
Fault Tolerance in Networks of Bounded Degree
SIAM Journal on Computing | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4062584 (Why is no real title available?) | 1988-01-01 | Paper |
Communication in concurrent dynamic logic
Journal of Computer and System Sciences | 1987-01-01 | Paper |
Concurrent dynamic logic
Journal of the ACM | 1987-01-01 | Paper |
The generalized packet routing problem
Theoretical Computer Science | 1987-01-01 | Paper |
On fault tolerant routings in general networks
Information and Computation | 1987-01-01 | Paper |
Concurrent program schemes and their logics
Theoretical Computer Science | 1987-01-01 | Paper |
More on looping vs. repeating in dynamic logic
Information Processing Letters | 1985-01-01 | Paper |
Process logic with regular formulas
Theoretical Computer Science | 1985-01-01 | Paper |
A generalized closure and complement phenomenon
Discrete Mathematics | 1984-01-01 | Paper |
On static logics, dynamic logics, and complexity classes
Information and Control | 1984-01-01 | Paper |
