| Publication | Date of Publication | Type |
|---|
| Brief Announcement: Local Problems in the SUPPORTED Model | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147528 | 2024-01-15 | Paper |
| Degree realization by bipartite multigraphs | 2024-01-11 | Paper |
| Weighted microscopic image reconstruction | 2024-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083391 | 2023-12-08 | Paper |
| Optimal Broadcast with Partial Knowledge | 2023-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059166 | 2023-11-02 | Paper |
| The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication | 2023-10-23 | Paper |
| The power of small coalitions under two-tier majority on regular graphs | 2023-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168446 | 2023-08-08 | Paper |
| Graph realizations: maximum degree in vertex neighborhoods | 2023-06-12 | Paper |
| Forcibly bipartite and acyclic (uni-)graphic sequences | 2023-05-15 | Paper |
| On vertex-weighted graph realizations | 2023-03-22 | Paper |
| Composed degree-distance realizations of graphs | 2023-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874474 | 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 | 2022-12-16 | Paper |
| Generating sparse 2—spanners | 2022-12-09 | Paper |
| Low-diameter graph decomposition is in NC | 2022-12-09 | Paper |
| The generalized microscopic image reconstruction problem | 2022-09-15 | Paper |
| Vertex-weighted graphs: realizable and unrealizable domains | 2022-07-13 | Paper |
| On vertex-weighted realizations of acyclic and general graphs | 2022-06-13 | Paper |
| Hotelling games in fault-prone settings | 2022-06-13 | Paper |
| Mixed preferential attachment model: homophily and minorities in social networks | 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 | 2022-03-22 | Paper |
| Nonuniform SINR+Voronoi diagrams are effectively uniform | 2021-07-22 | Paper |
| Compact and localized distributed data structures | 2020-12-04 | Paper |
| Efficiently Realizing Interval Sequences | 2020-12-04 | Paper |
| Assigning labels in an unknown anonymous network with a leader | 2020-12-03 | Paper |
| Sparse communication networks and efficient routing in the plane | 2020-12-03 | Paper |
| Crumbling walls: a class of practical and efficient quorum systems | 2020-12-02 | Paper |
| Fault tolerant approximate BFS structures with additive stretch | 2020-11-11 | Paper |
| Mixed fault tolerance in server assignment: combining reinforcement and backup | 2020-08-25 | Paper |
| Hotelling games with random tolerance intervals | 2020-06-30 | Paper |
| Message lower bounds via efficient network synchronization | 2020-02-06 | Paper |
| Vertex-weighted realizations of graphs | 2020-01-22 | Paper |
| Graph profile realizations and applications to social networks | 2019-10-15 | Paper |
| Distributed distance computation and routing with small messages | 2019-06-20 | Paper |
| Fault Tolerant Approximate BFS Structures | 2019-06-20 | Paper |
| Generalized Perron–Frobenius Theorem for Multiple Choice Matrices, and Applications | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743416 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743418 | 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 | 2019-01-30 | Paper |
| Fault-Tolerant Approximate BFS Structures | 2018-11-12 | Paper |
| Sparse Fault-Tolerant BFS Structures | 2018-11-05 | Paper |
| Dynamic routing schemes for graphs with low local density | 2018-11-05 | Paper |
| Label-guided graph exploration by a finite automaton | 2018-11-05 | Paper |
| Gathering Despite Mischief | 2018-10-30 | Paper |
| Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension | 2018-10-30 | Paper |
| Nonuniform SINR+Voroni diagrams are effectively uniform | 2018-08-24 | Paper |
| The Topology of Wireless Communication | 2018-08-02 | Paper |
| Local-on-Average Distributed Tasks | 2018-07-16 | Paper |
| Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach | 2018-07-16 | Paper |
| Improved approximation algorithms for weighted 2-path partitions | 2018-03-21 | Paper |
| The topology of wireless communication on a line | 2018-02-16 | Paper |
| Secluded connectivity problems | 2017-11-09 | Paper |
| Assortative Mixing Equilibria in Social Network Games | 2017-11-01 | Paper |
| Fault-local distributed mending (extended abstract) | 2017-09-29 | Paper |
| Crumbling walls | 2017-09-29 | Paper |
| Fast distributed construction of k-dominating sets and applications | 2017-09-29 | Paper |
| Fast network decomposition | 2017-08-21 | Paper |
| On the effect of the deployment setting on broadcasting in Euclidean radio networks | 2017-06-22 | Paper |
| Homophily and the Glass Ceiling Effect in Social Networks | 2017-05-19 | Paper |
| Sublinear bounds for randomized leader election | 2016-12-19 | Paper |
| Message Lower Bounds via Efficient Network Synchronization | 2016-12-01 | Paper |
| Feedback vertex set in hypercubes | 2016-06-16 | Paper |
| Discovery Through Gossip | 2016-06-10 | Paper |
| Distributed MST for constant diameter graphs | 2016-03-04 | Paper |
| Average probe complexity in quorum systems | 2016-03-04 | Paper |
| Efficient \(k\)-shot broadcasting in radio networks | 2016-02-12 | Paper |
| Nearly Optimal Local Broadcasting in the SINR Model with Feedback | 2016-01-08 | Paper |
| Improved Approximation Algorithms for Weighted 2-Path Partitions | 2015-11-19 | Paper |
| Core Size and Densification in Preferential Attachment Networks | 2015-11-04 | Paper |
| How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract) | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501786 | 2015-08-14 | Paper |
| On the Complexity of Universal Leader Election | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501267 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501371 | 2015-08-03 | Paper |
| Compact deterministic distributed dictionaries (extended abstract) | 2015-06-19 | Paper |
| Broadcast with partial knowledge (preliminary version) | 2015-06-19 | Paper |
| Efficient deadlock-free routing | 2015-06-19 | Paper |
| Fault tolerant additive and \((\mu, \alpha)\)-spanners | 2015-05-18 | Paper |
| Truth tellers and liars with fewer questions | 2015-04-29 | Paper |
| Proof labeling schemes | 2015-03-10 | Paper |
| Faster communication in known topology radio networks | 2015-03-10 | Paper |
| Feasibility and complexity of broadcasting with random transmission failures | 2015-03-10 | Paper |
| Sparse communication networks and efficient routing in the plane (extended abstract) | 2015-03-03 | Paper |
| Assigning labels in unknown anonymous networks (extended abstract) | 2015-03-03 | Paper |
| The wakeup problem in synchronous broadcast systems (extended abstract) | 2015-03-03 | Paper |
| On the complexity of universal leader election | 2015-03-02 | Paper |
| Efficient distributed source detection with limited bandwidth | 2015-03-02 | Paper |
| Forbidden-set distance labels for graphs of bounded doubling dimension | 2015-03-02 | Paper |
| (1 + εΒ) -spanner constructions for general graphs | 2015-02-27 | Paper |
| Randomized distributed decision | 2015-02-23 | Paper |
| Fault-tolerant spanners for general graphs | 2015-02-04 | Paper |
| The fault-tolerant capacitated \(K\)-center problem | 2015-01-06 | Paper |
| On the effect of the deployment setting on broadcasting in Euclidean radio networks | 2014-12-12 | Paper |
| On the locality of distributed sparse spanner construction | 2014-12-12 | Paper |
| Sublinear bounds for randomized leader election | 2014-12-02 | Paper |
| A near-linear-time algorithm for computing replacement paths in planar directed graphs | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921791 | 2014-10-13 | Paper |
| Testing the irreducibility of nonsquare Perron-Frobenius systems | 2014-08-28 | Paper |
| Local Distributed Decision | 2014-07-30 | Paper |
| SINR diagrams | 2014-07-23 | Paper |
| Robust fault tolerant uncapacitated facility location | 2014-07-07 | Paper |
| Distributed Computing on Core-Periphery Networks: Axiom-Based Design | 2014-07-01 | Paper |
| Distributed verification and hardness of distributed approximation | 2014-06-05 | Paper |
| The topology of wireless communication | 2014-06-05 | Paper |
| On approximating the \(d\)-girth of a graph | 2014-04-10 | Paper |
| Broadcasting in udg radio networks with unknown topology | 2014-03-13 | Paper |
| SINR Diagrams | 2014-02-17 | Paper |
| Towards a complexity theory for local distributed computing | 2014-02-17 | Paper |
| Tight bounds for distributed minimum-weight spanning tree verification | 2013-10-21 | Paper |
| Secluded connectivity problems | 2013-09-17 | Paper |
| Sparse Fault-Tolerant BFS Trees | 2013-09-17 | Paper |
| Time efficient \(k\)-shot broadcasting in known topology radio networks | 2013-07-04 | Paper |
| Compact separator decompositions in dynamic trees and applications to labeling schemes | 2013-07-04 | Paper |
| Proof labeling schemes | 2013-06-28 | Paper |
| Broadcasting in UDG radio networks with unknown topology | 2013-06-28 | Paper |
| Faster communication in known topology radio networks | 2013-06-20 | Paper |
| Distributed MST for constant diameter graphs | 2013-06-13 | Paper |
| Multipath Spanners via Fault-Tolerant Spanners | 2013-04-19 | Paper |
| A note on exact distance labeling | 2013-04-04 | Paper |
| Randomized distributed decision | 2013-03-13 | Paper |
| Relaxed spanners for directed disk graphs | 2013-03-05 | Paper |
| Distributed Verification and Hardness of Distributed Approximation | 2013-02-04 | Paper |
| \(f\)-sensitivity distance oracles and routing schemes | 2012-12-06 | Paper |
| Fault Tolerant Additive Spanners | 2012-11-06 | Paper |
| Distributed Algorithms for Network Diameter and Girth | 2012-11-01 | Paper |
| On the approximability of some degree-constrained subgraph problems | 2012-08-14 | Paper |
| Sparse reliable graph backbones | 2012-05-24 | Paper |
| Tight bounds for distributed minimum-weight spanning tree verification | 2012-01-23 | Paper |
| Robust Fault Tolerant uncapacitated facility location | 2012-01-23 | Paper |
| Relaxed Spanners for Directed Disk Graphs | 2012-01-23 | Paper |
| Fault Tolerant Spanners for General Graphs | 2011-04-04 | Paper |
| On Approximating the d-Girth of a Graph | 2011-02-15 | Paper |
| A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs | 2010-12-03 | Paper |
| Sparse Reliable Graph Backbones | 2010-09-07 | Paper |
| f-Sensitivity Distance Oracles and Routing Schemes | 2010-09-06 | Paper |
| A tight upper bound on the probabilistic embedding of series-parallel graphs | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579371 | 2010-08-06 | Paper |
| Constructing labeling schemes through universal matrices | 2010-05-28 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Equal-area locus-based convex polygon decomposition | 2010-04-06 | Paper |
| Time-Efficient Broadcast in Radio Networks | 2010-02-09 | Paper |
| Low-Port Tree Representations | 2010-01-21 | Paper |
| Local Computation of Nearly Additive Spanners | 2009-11-19 | Paper |
| Efficient k-Shot Broadcasting in Radio Networks | 2009-11-19 | Paper |
| Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs | 2009-11-06 | Paper |
| Computing the fault tolerance of multi-agent deployment | 2009-08-31 | Paper |
| Broadcasting with locally bounded byzantine faults | 2009-08-27 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Conflict-free coloring of unit disks | 2009-06-30 | Paper |
| Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems | 2009-06-24 | Paper |
| Labeling schemes for tree representation | 2009-05-13 | Paper |
| Distributed algorithms for partitioning a swarm of autonomous mobile robots | 2009-03-30 | Paper |
| Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements | 2009-03-16 | Paper |
| Local Algorithms for Autonomous Robot Systems | 2009-03-12 | Paper |
| Dynamic Routing Schemes for General Graphs | 2009-03-12 | Paper |
| Degree-Constrained Subgraph Problems: Hardness and Approximation Results | 2009-02-12 | Paper |
| Time-Efficient Broadcasting in Radio Networks | 2008-09-02 | Paper |
| Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time | 2008-09-02 | Paper |
| Energy and Time Efficient Broadcasting in Known Topology Radio Networks | 2008-09-02 | Paper |
| Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes | 2008-09-02 | Paper |
| Equal-Area Locus-Based Convex Polygon Decomposition | 2008-07-10 | Paper |
| Local spreading algorithms for autonomous robot systems | 2008-06-24 | Paper |
| Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems | 2008-05-16 | Paper |
| Constructing Labeling Schemes Through Universal Matrices | 2008-04-24 | Paper |
| Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks | 2008-04-17 | Paper |
| Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements | 2008-03-19 | Paper |
| Distributed Models and Algorithms for Mobile Robot Systems | 2008-03-07 | Paper |
| The hardness of approximating spanner problems | 2007-12-19 | Paper |
| Labeling schemes for weighted dynamic trees | 2007-12-10 | Paper |
| Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots | 2007-11-15 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Approximation algorithm for hotlink assignment in the greedy model | 2007-09-19 | Paper |
| Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems | 2007-05-02 | Paper |
| Average stretch analysis of compact routing schemes | 2007-04-13 | Paper |
| Feasibility and complexity of broadcasting with random transmission failures | 2007-02-26 | Paper |
| Asynchronous resource discovery in peer-to-peer networks | 2006-12-07 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| Average probe complexity in quorum systems | 2006-06-30 | Paper |
| Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots | 2006-06-01 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Graph exploration by a finite automaton | 2005-12-06 | Paper |
| Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds | 2005-10-28 | Paper |
| Informative labeling schemes for graphs | 2005-09-22 | Paper |
| Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems | 2005-09-16 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Polynomial time approximation schemes for base station coverage with minimum total radii | 2005-08-03 | Paper |
| Approximating \(k\)-spanner problems for \(k>2\) | 2005-06-30 | Paper |
| Virtual path layouts optimizing total hop count on ATM tree networks | 2005-05-04 | Paper |
| Distance labeling schemes for well-separated graph classes | 2005-02-23 | Paper |
| $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs | 2005-02-21 | Paper |
| Labeling Schemes for Flow and Connectivity | 2005-02-21 | Paper |
| Labeling schemes for dynamic tree networks | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829032 | 2004-11-29 | Paper |
| Distance labeling in graphs | 2004-11-12 | Paper |
| Deterministic resource discovery in distributed networks | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046481 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736829 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448760 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449189 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437485 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437490 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436056 | 2003-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708559 | 2003-06-18 | Paper |
| Compact routing schemes with low stretch factor | 2003-05-27 | Paper |
| Directed virtual path layouts in ATM networks | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796196 | 2003-03-02 | Paper |
| Faster exact solutions for some NP-hard problems. | 2003-01-21 | Paper |
| Distributed probabilistic polling and applications to proportionate agreement | 2003-01-14 | Paper |
| How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536394 | 2002-11-04 | Paper |
| Local majorities, coalitions and monopolies in graphs: A review | 2002-07-15 | Paper |
| Low complexity variants of the arrow distributed directory | 2002-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537738 | 2002-06-20 | Paper |
| The Compactness of Interval Routing for Almost All Graphs | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768294 | 2002-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766863 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754183 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728855 | 2001-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729093 | 2001-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721981 | 2001-07-11 | Paper |
| The Wakeup Problem in Synchronous Broadcast Systems | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501559 | 2001-06-13 | Paper |
| The dense \(k\)-subgraph problem | 2001-04-17 | Paper |
| A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517680 | 2001-03-11 | Paper |
| Generalized submodular cover problems and applications | 2000-12-12 | Paper |
| Distributed Computing: A Locality-Sensitive Approach | 2000-11-21 | Paper |
| Tight Fault Locality | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944965 | 2000-10-08 | Paper |
| Proximity-preserving labeling schemes | 2000-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252756 | 2000-04-26 | Paper |
| Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938786 | 2000-02-23 | Paper |
| Approximating the weight of shallow Steiner trees | 2000-02-07 | Paper |
| Edge-disjoint spanners of complete graphs and complete digraphs | 1999-12-20 | Paper |
| The Compactness of Interval Routing | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234101 | 1999-06-29 | Paper |
| Fault-Local Distributed Mending | 1999-06-21 | Paper |
| Approximate maxima finding of continuous functions under restricted budget | 1999-01-12 | Paper |
| Size bounds for dynamic monopolies | 1998-11-03 | Paper |
| Generating Low-Degree 2-Spanners | 1998-09-21 | Paper |
| Near-Linear Time Construction of Sparse Neighborhood Covers | 1998-09-21 | Paper |
| Optimal Broadcast with Partial Knowledge | 1998-09-21 | Paper |
| A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees | 1998-05-10 | Paper |
| Online tracking of mobile users | 1998-01-28 | Paper |
| Fast Distributed Construction of Smallk-Dominating Sets and Applications | 1998-01-01 | Paper |
| Randomized approximation of bounded multicovering problems | 1997-10-29 | Paper |
| The availability of crumbling wall quorum systems | 1997-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128918 | 1997-08-03 | Paper |
| Load Balancing in Quorum Systems | 1997-05-26 | Paper |
| Scheduling jobs using common resources | 1996-07-03 | Paper |
| The availability of quorum systems | 1996-02-26 | Paper |
| The complexity of reconfiguring network models | 1996-02-20 | Paper |
| Approximation Algorithms for Minimum-Time Broadcast | 1996-01-10 | Paper |
| Fast distributed network decompositions and covers | 1996-01-01 | Paper |
| Generating Sparse 2-Spanners | 1995-11-22 | Paper |
| On the maximum density of 0-1 matrices with no forbidden rectangles | 1995-07-27 | Paper |
| A note on optimal time broadcast in faulty hypercubes | 1995-07-06 | Paper |
| A Graph-Theoretic Game and Its Application to the k-Server Problem | 1995-07-03 | Paper |
| Greedy Packet Scheduling | 1995-03-27 | Paper |
| Traffic-light scheduling on the grid | 1994-12-11 | Paper |
| Computing with Noisy Information | 1994-11-29 | Paper |
| How to Allocate Network Centers | 1994-03-22 | Paper |
| Time-space tradeoffs for set operations | 1993-08-30 | Paper |
| Distance-dependent distributed directories | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037431 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010305 | 1992-09-27 | Paper |
| Routing with Polynomial Communication-Space Trade-Off | 1992-09-27 | Paper |
| Fault-tolerant critical section management in asynchronous environments | 1992-06-28 | Paper |
| Single round simulation on radio networks | 1992-06-28 | Paper |
| A lower bound for radio broadcast | 1992-06-25 | Paper |
| A trade-off between space and efficiency for routing tables | 1992-06-25 | Paper |
| Tight Bounds on Mimimum Broadcast Networks | 1991-01-01 | Paper |
| Randomized broadcast in networks | 1990-01-01 | Paper |
| Improved routing strategies with succinct tables | 1990-01-01 | Paper |
| A Time-Randomness Trade-Off for Oblivious Routing | 1990-01-01 | Paper |
| A trade-off between information and communication in broadcast protocols | 1990-01-01 | Paper |
| Renaming in an asynchronous environment | 1990-01-01 | Paper |
| Constructing disjoint paths on expander graphs | 1989-01-01 | Paper |
| Graph spanners | 1989-01-01 | Paper |
| The Token Distribution Problem | 1989-01-01 | Paper |
| An Optimal Synchronizer for the Hypercube | 1989-01-01 | Paper |
| Time bounds on fault‐tolerant broadcasting | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733694 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796744 | 1988-01-01 | Paper |
| Fault Tolerance in Networks of Bounded Degree | 1988-01-01 | Paper |
| The generalized packet routing problem | 1987-01-01 | Paper |
| On fault tolerant routings in general networks | 1987-01-01 | Paper |
| Concurrent program schemes and their logics | 1987-01-01 | Paper |
| Communication in concurrent dynamic logic | 1987-01-01 | Paper |
| Concurrent dynamic logic | 1987-01-01 | Paper |
| Process logic with regular formulas | 1985-01-01 | Paper |
| More on looping vs. repeating in dynamic logic | 1985-01-01 | Paper |
| A generalized closure and complement phenomenon | 1984-01-01 | Paper |
| On static logics, dynamic logics, and complexity classes | 1984-01-01 | Paper |
