| Publication | Date of Publication | Type |
|---|
| Sliding into the future: investigating sliding windows in temporal graphs (invited talk) | 2024-12-03 | Paper |
| Random input helps searching predecessors | 2024-10-31 | Paper |
| The complexity of growing a graph | 2024-10-29 | Paper |
| New clocks, optimal line formation and self-replication population protocols | 2024-10-08 | Paper |
| The complexity of computing optimum labelings for temporal connectivity | 2024-10-08 | Paper |
| Approximate and randomized algorithms for computing a second Hamiltonian cycle | 2024-10-07 | Paper |
| The complexity of computing optimum labelings for temporal connectivity | 2024-08-06 | Paper |
| Which is the worst-case Nash equilibrium? | 2024-06-08 | Paper |
| The contest game for crowdsourcing reviews | 2024-05-29 | Paper |
| Fault tolerant network constructors | 2024-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147529 | 2024-01-15 | Paper |
| Near-optimal dominating sets in dense random graphs in polynomial expected time | 2024-01-05 | Paper |
| Efficient parallel algorithms for some tree layout problems | 2023-12-12 | Paper |
| Distributed protocols against mobile eavesdroppers | 2023-12-01 | Paper |
| Selected combinatorial problems through the prism of random intersection graphs models | 2023-10-04 | Paper |
| MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems | 2023-09-27 | Paper |
| A spectral algorithm for finding maximum cliques in dense random intersection graphs | 2023-08-14 | Paper |
| The Complexity of Transitively Orienting Temporal Graphs | 2023-08-08 | Paper |
| The complexity of growing a graph | 2023-08-04 | Paper |
| Simple and fast approximate counting and leader election in populations | 2023-08-02 | Paper |
| On the structural and combinatorial properties in 2-swap word permutation graphs | 2023-07-04 | Paper |
| Fault tolerant network constructors | 2023-05-19 | Paper |
| Crystal structure prediction via oblivious local search | 2023-02-07 | Paper |
| Threshold-based network structural dynamics | 2023-01-30 | Paper |
| Scheduling algorithms for strict multithreaded computations | 2023-01-25 | Paper |
| Efficient parallel algorithms for shortest paths in planar graphs | 2022-12-09 | Paper |
| Cover Time in Edge-Uniform Stochastically-Evolving Graphs | 2022-11-04 | Paper |
| The Dynamics and Stability of Probabilistic Population Processes | 2022-11-04 | Paper |
| On convergence and threshold properties of discrete Lotka-Volterra population protocols | 2022-08-26 | Paper |
| Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems | 2022-08-18 | Paper |
| How fast can we reach a target vertex in stochastic temporal graphs | 2022-07-21 | Paper |
| Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089192 | 2022-07-18 | Paper |
| Beyond Rings: Gathering in 1-Interval Connected Graphs | 2022-07-08 | Paper |
| On Verifying and Maintaining Connectivity of Interval Temporal Networks | 2022-07-04 | Paper |
| Simple and fast approximate counting and leader election in populations | 2022-05-17 | Paper |
| Distributed computation and reconfiguration in actively dynamic networks | 2022-04-01 | Paper |
| Threshold-based network structural dynamics | 2022-03-22 | Paper |
| How many cooks spoil the soup? | 2022-02-15 | Paper |
| Approximating the existential theory of the reals | 2022-01-31 | Paper |
| Maximum cliques in graphs with small intersection number and random intersection graphs | 2021-12-20 | Paper |
| Maria Serna and her years in Patras | 2021-12-20 | Paper |
| An extension of the Moran process using type-specific connection graphs | 2021-11-25 | Paper |
| Connected subgraph defense games | 2021-11-19 | Paper |
| The Price of Stability of Weighted Congestion Games | 2021-07-28 | Paper |
| Temporal Vertex Cover with a Sliding Time Window | 2021-07-28 | Paper |
| The temporal explorer who returns to the base | 2021-06-30 | Paper |
| The price of defense | 2021-04-19 | Paper |
| Distributed Computation and Reconfiguration in Actively Dynamic Networks | 2021-03-15 | Paper |
| Computing exact solutions of consensus halving and the Borsuk-Ulam theorem | 2021-02-02 | Paper |
| Lipschitz continuity and approximate equilibria | 2020-10-12 | Paper |
| How fast can we reach a target vertex in stochastic temporal graphs? | 2020-09-07 | Paper |
| Approximating the existential theory of the reals | 2020-06-18 | Paper |
| On the Transformation Capability of Feasible Mechanisms for Programmable Matter | 2020-05-27 | Paper |
| Binary Search in Graphs Revisited | 2020-05-26 | Paper |
| An extension of the Moran process using type-specific connection graphs | 2020-02-12 | Paper |
| The temporal explorer who returns to the base | 2020-02-06 | Paper |
| Connected subgraph defense games | 2020-02-04 | Paper |
| The Match-Maker: Constant-Space Distributed Majority via Random Walks | 2020-01-14 | Paper |
| Cover time in edge-uniform stochastically-evolving graphs | 2020-01-13 | Paper |
| Temporal vertex cover with a sliding time window | 2019-11-29 | Paper |
| The Price of Stability of Weighted Congestion Games | 2019-11-08 | Paper |
| Temporal flows in temporal networks | 2019-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743450 | 2019-05-10 | Paper |
| Binary search in graphs revisited | 2019-05-07 | Paper |
| On the transformation capability of feasible mechanisms for programmable matter | 2019-05-03 | Paper |
| Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing | 2019-04-29 | Paper |
| Temporal network optimization subject to connectivity constraints | 2019-04-25 | Paper |
| Brief announcement: fast approximate counting and leader election in populations | 2019-01-30 | Paper |
| Strategic contention resolution in multiple channels | 2019-01-15 | Paper |
| Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time | 2019-01-10 | Paper |
| Short paper: strategic contention resolution in multiple channels with limited feedback | 2018-11-08 | Paper |
| Atomic congestion games among coalitions | 2018-11-05 | Paper |
| Strategic Contention Resolution in Multiple Channels | 2018-10-10 | Paper |
| Connectivity Preserving Network Transformers | 2018-10-04 | Paper |
| Strong bounds for evolution in networks | 2018-09-07 | Paper |
| Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks | 2018-08-20 | Paper |
| Deterministic Population Protocols for Exact Majority and Plurality. | 2018-07-18 | Paper |
| Stably Computing Order Statistics with Arithmetic Population Protocols | 2018-03-21 | Paper |
| Strategic Contention Resolution with Limited Feedback | 2018-03-02 | Paper |
| A 3-player protocol preventing persistence in strategic contention with limited feedback | 2018-02-13 | Paper |
| Expander properties in random regular graphs with edge faults | 2017-12-04 | Paper |
| Random bimatrix games are asymptotically easy to solve (a simple proof) | 2017-11-07 | Paper |
| The complexity of optimal design of temporally connected graphs | 2017-10-12 | Paper |
| Resolving Braess's paradox in random networks | 2017-10-09 | Paper |
| On the fixation probability of superstars | 2017-09-29 | Paper |
| Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract) | 2017-09-29 | Paper |
| Temporal flows in temporal networks | 2017-07-21 | Paper |
| Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values | 2017-07-21 | Paper |
| Connectivity preserving network transformers | 2017-05-18 | Paper |
| Network Constructors: A Model for Programmable Matter | 2017-04-04 | Paper |
| On the chromatic number of non-sparse random intersection graphs | 2017-03-31 | Paper |
| Determining majority in networks with local interactions and very small local memory | 2017-03-29 | Paper |
| Computing approximate Nash equilibria in polymatrix games | 2017-03-03 | Paper |
| How Many Cooks Spoil the Soup? | 2016-12-01 | Paper |
| Lipschitz Continuity and Approximate Equilibria | 2016-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2990267 | 2016-07-29 | Paper |
| Simple and efficient local codes for distributed stable network construction | 2016-07-05 | Paper |
| Traveling salesman problems in temporal graphs | 2016-05-18 | Paper |
| Algorithms and almost tight results for 3-colorability of small diameter graphs | 2016-03-23 | Paper |
| On Temporally Connected Graphs of Small Cost | 2016-02-26 | Paper |
| On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations | 2016-01-27 | Paper |
| Rationality Authority for Provable Rational Behavior | 2016-01-27 | Paper |
| Causality, influence, and computation in possibly disconnected synchronous dynamic networks | 2015-12-18 | Paper |
| On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols | 2015-10-27 | Paper |
| Simple and efficient local codes for distributed stable network construction | 2015-09-03 | Paper |
| On the structure of equilibria in basic network formation | 2015-06-10 | Paper |
| CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS | 2015-04-29 | Paper |
| The price of selfish routing | 2015-02-27 | Paper |
| Resolving Braess’s Paradox in Random Networks | 2015-01-12 | Paper |
| Computing Approximate Nash Equilibria in Polymatrix Games | 2015-01-07 | Paper |
| Approximating fixation probabilities in the generalized Moran process | 2014-11-19 | Paper |
| Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs | 2014-11-04 | Paper |
| Computational models for networks of tiny artifacts: a survey | 2014-10-24 | Paper |
| Selfish splittable flows and NP-completeness | 2014-10-24 | Paper |
| Innovative approaches for security of small artefacts | 2014-10-24 | Paper |
| Robust and scalable middleware for selfish-computer systems | 2014-10-24 | Paper |
| Traveling Salesman Problems in Temporal Graphs | 2014-10-14 | Paper |
| A note on proofs of existence of Nash equilibria in finite strategic games, of two players | 2014-10-07 | Paper |
| Book review of: N. Nisan (ed.), T. Roughgarden (ed.), É. Tardos (ed.), V. Vazirani (ed.), Algorithmic game theory. Foreword by C. H. Papadimitriou | 2014-10-07 | Paper |
| Naming and Counting in Anonymous Unknown Dynamic Networks | 2014-09-30 | Paper |
| Determining Majority in Networks with Local Interactions and Very Small Local Memory | 2014-07-01 | Paper |
| On the derivation of a closed-form expression for the solutions of a subclass of generalized Abel differential equations | 2014-06-30 | Paper |
| Game authority for robust andscalable distributed selfish-computer systems | 2014-03-13 | Paper |
| On the hardness of network design for bottleneck routing games | 2014-01-22 | Paper |
| The computational power of simple protocols for self-awareness on graphs | 2014-01-13 | Paper |
| Design, analysis and performance evaluation of group key establishment in wireless sensor networks | 2013-12-06 | Paper |
| On the Structure of Equilibria in Basic Network Formation | 2013-08-16 | Paper |
| Temporal Network Optimization Subject to Connectivity Constraints | 2013-08-07 | Paper |
| A Guided Tour in Random Intersection Graphs | 2013-08-07 | Paper |
| Strong Bounds for Evolution in Networks | 2013-08-07 | Paper |
| Potential Functions in Strategic Games | 2013-06-14 | Paper |
| Playing a Game to Bound the Chromatic Number | 2013-05-28 | Paper |
| Natural models for evolution on networks | 2013-04-17 | Paper |
| On the Hardness of Network Design for Bottleneck Routing Games | 2013-03-13 | Paper |
| The impact of social ignorance on weighted congestion games | 2012-12-06 | Paper |
| Maximum cliques in graphs with small intersection number and random intersection graphs | 2012-09-25 | Paper |
| Efficient methods for selfish network design | 2012-08-09 | Paper |
| On mutual concavity and strategically-zero-sum bimatrix games | 2012-06-25 | Paper |
| Passively mobile communicating machines that use restricted space | 2011-12-07 | Paper |
| On the independence number and Hamiltonicity of uniform random intersection graphs | 2011-12-07 | Paper |
| Selected Combinatorial Properties of Random Intersection Graphs | 2011-11-11 | Paper |
| Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof) | 2011-10-28 | Paper |
| On the performance of approximate equilibria in congestion games | 2011-08-16 | Paper |
| Mediated population protocols | 2011-05-10 | Paper |
| Population Protocols and Related Models | 2011-04-05 | Paper |
| Probabilistic Data Propagation in Wireless Sensor Networks | 2011-04-05 | Paper |
| Sharp thresholds for Hamiltonicity in random intersection graphs | 2010-10-11 | Paper |
| Exploiting concavity in bimatrix games: new polynomially tractable subclasses | 2010-09-10 | Paper |
| All symmetric predicates in NSPACE\((n^{2})\) are stably computable by the mediated population protocol model | 2010-09-03 | Paper |
| Atomic congestion games: fast, myopic and concurrent | 2010-08-13 | Paper |
| An optimization approach for approximate Nash equilibria | 2010-07-09 | Paper |
| Cost-balancing tolls for atomic network congestion games | 2010-07-09 | Paper |
| Game authority for robust and scalable distributed selfish-computer systems | 2010-06-07 | Paper |
| Well supported approximate equilibria in bimatrix games | 2010-05-28 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| Weighted random sampling with a reservoir | 2009-12-18 | Paper |
| Expander properties and the cover time of random intersection graphs | 2009-11-06 | Paper |
| On the Performance of Approximate Equilibria in Congestion Games | 2009-10-29 | Paper |
| Paradigms for Fast Parallel Approximability | 2009-10-21 | Paper |
| Colouring Non-sparse Random Intersection Graphs | 2009-10-16 | Paper |
| Recent Advances in Population Protocols | 2009-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3397628 | 2009-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396596 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396550 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395947 | 2009-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395990 | 2009-09-15 | Paper |
| The structure and complexity of Nash equilibria for a selfish routing game | 2009-08-21 | Paper |
| The survival of the weakest in networks | 2009-08-06 | Paper |
| Efficient Methods for Selfish Network Design | 2009-07-14 | Paper |
| Mediated Population Protocols | 2009-07-14 | Paper |
| Polynomial algorithms for approximating Nash equilibria of bimatrix games | 2009-04-29 | Paper |
| On the support size of stable strategies in random games | 2009-03-17 | Paper |
| The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions | 2009-03-17 | Paper |
| Atomic Congestion Games Among Coalitions | 2009-03-12 | Paper |
| Probabilistic Techniques in Algorithmic Game Theory | 2009-03-05 | Paper |
| On the Support Size of Stable Strategies in Random Games | 2009-03-05 | Paper |
| Computing on a partially eponymous ring | 2009-03-02 | Paper |
| A Game Theoretic Approach for Efficient Graph Coloring | 2009-01-29 | Paper |
| The Dynamics of Probabilistic Population Protocols | 2008-11-20 | Paper |
| Random sampling of colourings of sparse random graphs with a constant number of colours | 2008-11-18 | Paper |
| Large independent sets in general random intersection graphs | 2008-11-12 | Paper |
| Selfish Load Balancing Under Partial Knowledge | 2008-09-17 | Paper |
| Expander Properties and the Cover Time of Random Intersection Graphs | 2008-09-17 | Paper |
| Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach | 2008-09-17 | Paper |
| Cost sharing mechanisms for fair pricing of resource usage | 2008-09-12 | Paper |
| The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs | 2008-09-04 | Paper |
| Efficient sensor network design for continuous monitoring of moving objects | 2008-08-14 | Paper |
| A network game with attackers and a defender | 2008-07-01 | Paper |
| Algorithms for pure Nash equilibria in weighted congestion games | 2008-06-20 | Paper |
| Approximate Equilibria for Strategic Two Person Games | 2008-05-02 | Paper |
| Atomic Congestion Games: Fast, Myopic and Concurrent | 2008-05-02 | Paper |
| Optimal Algorithms for Detecting Network Stability | 2008-03-25 | Paper |
| The Survival of the Weakest in Networks | 2008-02-21 | Paper |
| Full and Local Information in Distributed Decision Making | 2008-02-20 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games | 2007-11-28 | Paper |
| The Price of Defense | 2007-09-05 | Paper |
| The increase of the instability of networks due to quasi-static link capacities | 2007-09-03 | Paper |
| The price of selfish routing | 2007-07-19 | Paper |
| Direct routing: Algorithms and complexity | 2007-06-21 | Paper |
| Performance and stability bounds for dynamic networks | 2007-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433910 | 2007-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433948 | 2007-04-23 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| The infection time of graphs | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies | 2006-10-31 | Paper |
| Information Security | 2006-10-20 | Paper |
| Approximation schemes for scheduling and covering on unrelated machines | 2006-09-14 | Paper |
| The chromatic and clique numbers of random scaled sector graphs | 2006-03-20 | Paper |
| The impact of network structure on the stability of greedy protocols | 2006-02-08 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Selfish unsplittable flows | 2006-01-09 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Structure and complexity of extreme Nash equilibria | 2005-10-26 | Paper |
| Radiocoloring in planar graphs: Complexity and approximations | 2005-09-22 | Paper |
| Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control | 2005-09-16 | Paper |
| Algorithmic Aspects of Wireless Sensor Networks | 2005-08-25 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Space efficient hash tables with worst case constant access time | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668736 | 2005-04-15 | Paper |
| The cost of concurrent, low-contention Read \& Modify \& Write | 2005-04-06 | Paper |
| Approximate equilibria and ball fusion | 2005-02-11 | Paper |
| Attack propagation in networks | 2004-09-22 | Paper |
| A hierarchical adaptive distributed algorithm for load balancing | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813181 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737150 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473907 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437116 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437513 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436058 | 2003-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426342 | 2003-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418656 | 2003-08-11 | Paper |
| Distributed communication algorithms for ad hoc mobile networks. | 2003-08-07 | Paper |
| Competitive video on demand schedulers for popular movies | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417680 | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415065 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414500 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708560 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788605 | 2003-06-02 | Paper |
| An efficient deterministic parallel algorithm for two processors precedence constraint scheduling | 2003-05-14 | Paper |
| Competitive call control in mobile networks | 2003-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791664 | 2003-01-30 | Paper |
| On the robustness of interconnections in random graphs: a symbolic approach. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785581 | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152424 | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536423 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550766 | 2002-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537074 | 2002-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536928 | 2002-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536372 | 2002-11-04 | Paper |
| The Lagrangian search method | 2002-10-10 | Paper |
| Minimum congestion redundant assignments to tolerate random faults | 2002-05-21 | Paper |
| Combinatorial randomized rounding: Boosting randomized rounding with combinatorial arguments | 2002-05-12 | Paper |
| STEPS: Supporting traditional education procedures --- A TCP/IP multimedia networks-based model | 2002-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527190 | 2001-04-26 | Paper |
| Robust parallel computations through randomization | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525710 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250787 | 2000-11-22 | Paper |
| BSP versus LogP | 2000-09-05 | Paper |
| Efficient scheduling of strict multithreaded computations | 2000-09-04 | Paper |
| Tentative and definite distributed computations: An optimistic approach to network synchronization | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934338 | 2000-04-26 | Paper |
| Optimal high-performance parallel text retrieval via fat-trees | 2000-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263466 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247263 | 1999-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232883 | 1999-03-16 | Paper |
| Paradigms for Fast Parallel Approximability | 1999-02-28 | Paper |
| On the random generation and counting of matchings in dense graphs | 1998-08-13 | Paper |
| Parallel algorithms for the minimum cut and the minimum length tree layout problems | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375813 | 1998-06-11 | Paper |
| The fourth moment in Luby's distribution | 1997-02-28 | Paper |
| Simple atomic snapshots: A linear complexity solution with unbounded time-stamps | 1997-02-27 | Paper |
| Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems | 1997-02-27 | Paper |
| Performance modeling of distributed timestamp ordering: Perfect and imperfect clocks | 1997-02-27 | Paper |
| Tail bounds for occupancy and the satisfiability threshold conjecture | 1996-03-18 | Paper |
| Parallel Complexity of the Connected Subgraph Problem | 1993-09-01 | Paper |
| Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays | 1993-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694726 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036582 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035662 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035248 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028098 | 1993-03-28 | Paper |
| Efficient parallel algorithms for shortest paths in planar digraphs | 1992-12-14 | Paper |
| Expected parallel time and sequential space complexity of graph and digraph problems | 1992-06-28 | Paper |
| The complexity of the reliable connectivity problem | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975935 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484351 | 1989-01-01 | Paper |
| Efficient distributed algorithms by using the archimedean time assumption | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796746 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787481 | 1988-01-01 | Paper |
| Optimal parallel randomized algorithms for sparse addition and identification | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3820005 | 1988-01-01 | Paper |
| The parallel complexity of deadlock detection | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3791189 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727386 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742711 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4727428 | 1986-01-01 | Paper |
| k-connectivity in random undirected graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3735079 | 1985-01-01 | Paper |
| Unbounded Speed Variability in Distributed Communications Systems | 1985-01-01 | Paper |
| Strong NP-hardness of moving many discs | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3702501 | 1984-01-01 | Paper |
| Real-Time Synchronization of Interprocess Communications | 1984-01-01 | Paper |
| On the existence of $\delta$-temporal cliques in random simple temporal graphs | N/A | Paper |
