| Publication | Date of Publication | Type |
|---|
| Want to gather? No need to chatter! | 2025-01-14 | Paper |
| Graph exploration by a deterministic memoryless automaton with pebbles | 2024-08-09 | Paper |
| System diagnosis with smallest risk of error | 2024-06-05 | Paper |
| Approximate maxima finding of continuous functions under restricted budget (extended abstract) | 2024-06-05 | Paper |
| Deterministic treasure hunt and rendezvous in arbitrary connected graphs | 2024-03-13 | Paper |
| Deterministic rendezvous in infinite trees | 2024-01-02 | Paper |
| Impact of knowledge on the cost of treasure hunt in trees | 2023-12-12 | Paper |
| Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. | 2023-12-08 | Paper |
| Four shades of deterministic leader election in anonymous networks | 2023-11-21 | Paper |
| Deterministic Leader Election in Anonymous Radio Networks | 2023-10-31 | Paper |
| Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs | 2023-10-23 | Paper |
| Almost universal anonymous rendezvous in the plane | 2023-10-06 | Paper |
| Deterministic size discovery and topology recognition in radio networks with short labels | 2023-05-19 | Paper |
| Fast deterministic simulation of computations on faulty parallel machines | 2023-05-08 | Paper |
| Power consumption in packet radio networks | 2022-11-09 | Paper |
| Reliable minimum finding comparator networks | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091040 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075773 | 2022-05-11 | Paper |
| Optimal adaptive broadcasting with a bounded fraction of faulty nodes (extended abstract) | 2021-12-20 | Paper |
| Advice complexity of treasure hunt in geometric terrains | 2021-11-25 | Paper |
| Finding the size and the diameter of a radio network using short labels | 2021-04-08 | Paper |
| Want to Gather? No Need to Chatter! | 2021-03-15 | Paper |
| Short labeling schemes for topology recognition in wireless tree networks | 2021-03-09 | Paper |
| Building a nest by an automaton | 2021-02-01 | Paper |
| Assigning labels in an unknown anonymous network with a leader | 2020-12-03 | Paper |
| Deterministic broadcasting in ad hoc radio networks | 2020-12-03 | Paper |
| Deterministic treasure hunt in the plane with angular hints | 2020-10-21 | Paper |
| Deterministic Graph Exploration with Advice | 2020-05-27 | Paper |
| Deciding and verifying network properties locally with few output bits | 2020-04-23 | Paper |
| Global synchronization and consensus using beeps in a fault-prone multiple access channel | 2020-01-16 | Paper |
| Anonymous Meeting in Networks | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743418 | 2019-05-10 | Paper |
| Sparse networks supporting efficient reliable broadcasting | 2019-03-29 | Paper |
| Deterministic Graph Exploration with Advice | 2019-03-28 | Paper |
| Explorable families of graphs | 2019-01-30 | Paper |
| Impact of knowledge on election time in anonymous networks | 2019-01-11 | Paper |
| Time vs. Information Tradeoffs for Leader Election in Anonymous Trees | 2018-11-05 | Paper |
| Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports | 2018-10-30 | Paper |
| Gathering Despite Mischief | 2018-10-30 | Paper |
| Reaching a target in the plane with no information | 2018-10-19 | Paper |
| Deterministic gathering with crash faults | 2018-10-04 | Paper |
| Deterministic distributed construction of \(T\)-dominating sets in time \(T\) | 2018-09-25 | Paper |
| Deterministic Meeting of Sniffing Agents in the Plane* | 2018-07-18 | Paper |
| Time vs. Information Tradeoffs for Leader Election in Anonymous Trees | 2018-07-16 | Paper |
| Optimal diagnosis of heterogeneous systems with random faults | 2018-07-09 | Paper |
| Use of information, memory and randomization in asynchronous gathering | 2018-04-18 | Paper |
| Short labeling schemes for topology recognition in wireless tree networks | 2018-04-12 | Paper |
| On deterministic rendezvous at a node of agents with arbitrary velocities | 2018-03-16 | Paper |
| Deterministic Rendezvous with Detection Using Beeps | 2017-04-26 | Paper |
| Exploration of Faulty Hamiltonian Graphs | 2017-03-28 | Paper |
| Deterministic Meeting of Sniffing Agents in the Plane | 2016-12-01 | Paper |
| Asynchronous Broadcasting with Bivalent Beeps | 2016-12-01 | Paper |
| Rendezvous in networks in spite of delay faults | 2016-07-05 | Paper |
| Communication Complexity of Consensus in Anonymous Message Passing Systems | 2016-05-11 | Paper |
| Anonymous meeting in networks | 2016-03-29 | Paper |
| Convergecast and broadcast by power-aware mobile agents | 2016-03-23 | Paper |
| Topology recognition with advice | 2016-03-10 | Paper |
| Deterministic Rendezvous with Detection Using Beeps | 2016-03-10 | Paper |
| Time versus cost tradeoffs for deterministic rendezvous in networks | 2016-03-01 | Paper |
| Topology recognition and leader election in colored networks | 2016-02-26 | Paper |
| Fast rendezvous with advice | 2015-12-11 | Paper |
| Knowledge, level of symmetry, and time of leader election | 2015-09-29 | Paper |
| Broadcasting in undirected ad hoc radio networks | 2015-09-04 | Paper |
| Time versus cost tradeoffs for deterministic rendezvous in networks | 2015-09-03 | Paper |
| Deterministic polynomial approach in the plane | 2015-07-08 | Paper |
| How to meet asynchronously at polynomial cost | 2015-06-24 | Paper |
| MINIMIZING CONGESTION OF LAYOUTS FOR ATM NETWORKS WITH FAULTY LINKS | 2015-04-29 | Paper |
| Feasibility and complexity of broadcasting with random transmission failures | 2015-03-10 | Paper |
| Oracle size | 2015-03-10 | 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 |
| How to meet asynchronously at polynomial cost | 2015-03-02 | Paper |
| How to meet when you forget | 2015-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934641 | 2014-12-18 | Paper |
| Delays Induce an Exponential Memory Gap for Rendezvous in Trees | 2014-12-05 | Paper |
| EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN | 2014-11-14 | Paper |
| Tree exploration with logarithmic memory | 2014-09-09 | Paper |
| How to meet asynchronously (almost) everywhere | 2014-09-09 | Paper |
| Leader election for anonymous asynchronous agents in arbitrary networks | 2014-07-11 | Paper |
| Time versus space trade-offs for rendezvous in trees | 2014-07-11 | Paper |
| Fault-Tolerant Rendezvous in Networks | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417602 | 2014-05-22 | Paper |
| Broadcasting in udg radio networks with unknown topology | 2014-03-13 | Paper |
| Price of asynchrony in mobile agents computing | 2014-02-11 | Paper |
| Leader election in ad hoc radio networks: a keen ear helps | 2014-01-27 | Paper |
| Gathering asynchronous oblivious agents with local vision in regular bipartite graphs | 2014-01-13 | Paper |
| Worst-case optimal exploration of terrains with obstacles | 2013-11-29 | Paper |
| Deterministic Polynomial Approach in the Plane | 2013-08-07 | Paper |
| Learning a Ring Cheaply and Fast | 2013-08-07 | Paper |
| Distributed tree comparison with nodes of limited memory | 2013-08-06 | Paper |
| Computing without communicating: ring exploration by asynchronous oblivious robots | 2013-08-05 | Paper |
| Broadcasting in UDG radio networks with missing and inaccurate information | 2013-06-28 | Paper |
| Broadcasting in UDG radio networks with unknown topology | 2013-06-28 | Paper |
| Distributed computing with advice: information sensitivity of graph coloring | 2013-06-28 | Paper |
| Optimal deterministic broadcasting in known topology radio networks | 2013-06-20 | Paper |
| Activating anonymous ad hoc radio networks | 2013-06-20 | Paper |
| Broadcasting in undirected ad hoc radio networks | 2013-06-07 | Paper |
| Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains | 2013-04-15 | Paper |
| How many oblivious robots can explore a line | 2013-04-04 | Paper |
| Collecting Information by Power-Aware Mobile Agents | 2013-03-13 | Paper |
| How to meet when you forget: log-space rendezvous in arbitrary graphs | 2013-02-04 | Paper |
| Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports | 2012-11-01 | Paper |
| Knowledge, level of symmetry, and time of leader election | 2012-09-25 | Paper |
| Choosing the best among peers | 2012-08-08 | Paper |
| Deterministic network exploration by a single agent with Byzantine tokens | 2012-07-25 | Paper |
| Drawing maps with advice | 2012-07-13 | Paper |
| Decidability Classes for Mobile Agents Computing | 2012-06-29 | Paper |
| How much memory is needed for leader election | 2012-02-06 | Paper |
| Fault-tolerant strategies in the iterated prisoner's dilemma | 2012-01-18 | Paper |
| Asynchronous deterministic rendezvous in bounded terrains | 2011-12-07 | Paper |
| Efficient Distributed Communication in Ad-Hoc Radio Networks | 2011-07-07 | Paper |
| Trade-offs between the size of advice and broadcasting time in trees | 2011-07-01 | Paper |
| Optimality and competitiveness of exploring polygons by mobile robots | 2011-01-13 | Paper |
| The diameter and connectivity of networks with random dependent faults | 2010-11-24 | Paper |
| How Much Memory Is Needed for Leader Election | 2010-09-10 | Paper |
| Drawing Maps with Advice | 2010-09-10 | Paper |
| Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains | 2010-09-03 | Paper |
| Optimal Exploration of Terrains with Obstacles | 2010-06-22 | Paper |
| Asynchronous Deterministic Rendezvous in Bounded Terrains | 2010-06-17 | Paper |
| Distributed Tree Comparison with Nodes of Limited Memory | 2010-06-17 | Paper |
| Acknowledged broadcasting in ad hoc radio networks | 2010-06-09 | Paper |
| Communication algorithms with advice | 2010-05-25 | Paper |
| Fast radio broadcasting with advice | 2010-04-06 | Paper |
| Remembering without memory: tree exploration by asynchronous oblivious robots | 2010-04-06 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Consensus and Mutual Exclusion in a Multiple Access Channel | 2009-11-19 | Paper |
| Optimality and Competitiveness of Exploring Polygons by Mobile Robots | 2009-10-29 | Paper |
| Why Do We Believe Theorems? | 2009-10-15 | Paper |
| Fault-tolerant sequential scan | 2009-09-18 | Paper |
| Broadcasting with locally bounded byzantine faults | 2009-08-27 | Paper |
| Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps | 2009-07-14 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Gathering few fat mobile robots in the plane | 2009-03-02 | Paper |
| Tree exploration with advice | 2008-12-03 | Paper |
| Deterministic Rendezvous in Trees with Little Memory | 2008-11-20 | Paper |
| Broadcasting in UDG Radio Networks with Missing and Inaccurate Information | 2008-11-20 | Paper |
| Impact of memory size on graph exploration capability | 2008-09-29 | Paper |
| Communication in Networks with Random Dependent Faults | 2008-09-17 | Paper |
| Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots | 2008-07-10 | Paper |
| Fast Radio Broadcasting with Advice | 2008-07-10 | Paper |
| Fast Adaptive Diagnosis with a Minimum Number of Tests | 2008-05-27 | Paper |
| Broadcasting in geometric radio networks | 2008-05-16 | Paper |
| Gathering Asynchronous Oblivious Mobile Robots in a Ring | 2008-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5450114 | 2008-03-19 | Paper |
| Gathering asynchronous oblivious mobile robots in a ring | 2008-03-05 | Paper |
| Searching for a Black Hole in Synchronous Tree Networks | 2008-01-18 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Distributed Computing with Advice: Information Sensitivity of Graph Coloring | 2007-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5310248 | 2007-09-21 | Paper |
| Tree Exploration with an Oracle | 2007-09-05 | Paper |
| Labeling trees with a condition at distance two | 2007-05-29 | Paper |
| Efficient exploration of faulty trees | 2007-03-12 | Paper |
| Feasibility and complexity of broadcasting with random transmission failures | 2007-02-26 | Paper |
| Collective tree exploration | 2007-02-15 | Paper |
| FAST BROADCASTING WITH BYZANTINE FAULTS | 2007-02-08 | Paper |
| Randomized Algorithms for Determining the Majority on Graphs | 2007-02-07 | Paper |
| Better adaptive diagnosis of hypercubes | 2007-01-09 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Deterministic M2M multicast in radio networks | 2006-10-20 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Deterministic rendezvous in graphs | 2006-10-16 | Paper |
| Labeling trees with a condition at distance two | 2006-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480656 | 2006-08-03 | Paper |
| Optimal decision strategies in Byzantine environments | 2006-05-22 | Paper |
| Asynchronous deterministic rendezvous in graphs | 2006-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3370007 | 2006-02-06 | Paper |
| Broadcasting in unlabeled hypercubes with a linear number of messages. | 2006-01-17 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
| Graph exploration by a finite automaton | 2005-12-06 | Paper |
| LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES | 2005-10-19 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. | 2005-04-27 | Paper |
| Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism | 2005-04-06 | Paper |
| Faster Deterministic Broadcasting in Ad Hoc Radio Networks | 2005-02-28 | Paper |
| Time of Deterministic Broadcasting in Radio Networks with Local Knowledge | 2005-02-21 | Paper |
| Optimal graph exploration without good maps | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828987 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4825703 | 2004-11-05 | Paper |
| Tree exploration with little memory | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808650 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472476 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472512 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432962 | 2003-10-29 | Paper |
| Deterministic broadcasting time with partial knowledge of the network. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418601 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418641 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411373 | 2003-07-08 | Paper |
| The impact of information on broadcasting time in linear radio networks. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766680 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4328855 | 2002-07-22 | Paper |
| Faster broadcasting in unknown radio networks | 2002-07-14 | Paper |
| Deterministic radio broadcasting at low cost | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768357 | 2002-03-24 | Paper |
| Searching games with errors -- fifty years of coping with liars | 2002-03-03 | Paper |
| Optimal adaptive fault diagnosis for simple multiprocessor systems | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762502 | 2002-01-09 | Paper |
| Efficient communication in unknown networks | 2001-10-14 | Paper |
| Fault-Tolerant Broadcasting in Radio Networks | 2001-07-29 | Paper |
| The Wakeup Problem in Synchronous Broadcast Systems | 2001-06-21 | Paper |
| Impact of topographic information on graph exploration efficiency | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4507860 | 2000-10-10 | Paper |
| Optimal broadcasting in faulty trees | 2000-08-27 | Paper |
| Power consumption in packet radio networks | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952711 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938771 | 2000-03-27 | Paper |
| An optimal algorithm for broadcasting multiple messages in trees | 2000-03-19 | Paper |
| Exploring Unknown Undirected Graphs | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250197 | 1999-06-17 | Paper |
| Minimum-time multidrop broadcast | 1999-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4235434 | 1999-03-22 | Paper |
| Reliable Fault Diagnosis with Few Tests | 1999-02-02 | Paper |
| Approximate maxima finding of continuous functions under restricted budget | 1999-01-12 | Paper |
| System diagnosis with smallest risk of error | 1999-01-12 | Paper |
| Broadcasting with linearly bounded transmission faults | 1998-11-19 | Paper |
| Perfect broadcasting in unlabeled networks | 1998-11-03 | Paper |
| Time and Cost Trade-Offs in Gossiping | 1998-09-21 | Paper |
| Hop-Congestion Trade-Offs for High-Speed Networks | 1997-09-29 | Paper |
| Fault-tolerant broadcasting and gossiping in communication networks | 1997-07-06 | Paper |
| Reliable Broadcasting in Hypercubes with Random Link and Node Failures | 1997-05-22 | Paper |
| Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures | 1997-05-20 | Paper |
| Anonymous wireless rings | 1997-02-28 | Paper |
| Reliable computations on faulty EREW PRAM | 1997-02-27 | Paper |
| Adaptive broadcasting with faulty nodes | 1997-02-27 | Paper |
| Broadcasting with universal lists | 1996-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4895545 | 1996-10-14 | Paper |
| Efficient Gossiping by Packets in Networks with Random Faults | 1996-06-05 | Paper |
| Token transfer in a faulty network | 1996-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764627 | 1995-05-04 | Paper |
| Almost Safe Group Testing with Few Tests | 1995-01-25 | Paper |
| Reliable distributed diagnosis for multiprocessor systems with random faults | 1995-01-11 | Paper |
| Fast diagnosis of multiprocessor systems with random faults | 1995-01-02 | Paper |
| Fast gossiping with short unreliable messages | 1994-12-11 | Paper |
| Finding a target subnetwork in sparse networks with random faults | 1994-09-25 | Paper |
| Optimal coteries and voting schemes | 1994-08-03 | Paper |
| Searching with local constraints on error patterns | 1994-07-19 | Paper |
| Sorting on a Mesh-Connected Computer with Delaying Links | 1994-05-12 | Paper |
| Optimal communication in networks with randomly distributed byzantine faults | 1994-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4018725 | 1993-01-16 | Paper |
| Almost Safe Gossiping in Bounded Degree Networks | 1993-01-16 | Paper |
| Reliable communication in networks with Byzantine link failures | 1992-10-13 | Paper |
| Broadcasting in complete networks with faulty nodes using unreliable calls | 1992-06-28 | Paper |
| Crooked diagrams with few slopes | 1992-06-25 | Paper |
| Searching with a forbidden lie pattern in responses | 1991-01-01 | Paper |
| Orders with level diagrams | 1991-01-01 | Paper |
| Motion Planning,Two-Directional Point Representation, and Ordered Sets | 1991-01-01 | Paper |
| Drawing orders with few slopes | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3494327 | 1990-01-01 | Paper |
| Searching with known error probability | 1989-01-01 | Paper |
| Detecting errors in searching games | 1989-01-01 | Paper |
| Ulam's searching game with lies | 1989-01-01 | Paper |
| Weakly adaptive comparison searching | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750863 | 1989-01-01 | Paper |
| Prefix search with a lie | 1988-01-01 | Paper |
| Solution of Ulam's problem on binary search with two lies | 1988-01-01 | Paper |
| Solution of Ulam's problem on searching with a lie | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783955 | 1987-01-01 | Paper |
| Invariant measures on abelian metric groups | 1987-01-01 | Paper |
| Lie patterns in search procedures | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3027015 | 1986-01-01 | Paper |
| Invariant Ideals and Borel Sets | 1986-01-01 | Paper |
| Extensions of invariant measures on Euclidean spaces | 1985-01-01 | Paper |
| On the existence of measures on σ-algebras | 1985-01-01 | Paper |
| Idempotent ideals on abelian groups | 1984-01-01 | Paper |
| The Nonexistence of Maximal Invariant Measures on Abelian Groups | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3718967 | 1984-01-01 | Paper |
| Combinatorics on σ-algebras and problem of Banach | 1984-01-01 | Paper |
| On a Problem of Banach | 1983-01-01 | Paper |
| Semiregular Invariant Measures on Abelian Groups | 1982-01-01 | Paper |
| Solution of a problem of Ulam on countable sequences of sets | 1981-01-01 | Paper |
| Ideals on the real line and Ulam's problem | 1981-01-01 | Paper |
| On families of σ-complete ideals | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3872443 | 1978-01-01 | Paper |
