| Publication | Date of Publication | Type |
|---|
| Learning hierarchically-structured concepts. II: Overlapping concepts, and networks with feedback | 2024-01-11 | Paper |
| Learning hierarchically-structured concepts | 2023-09-28 | Paper |
| A basic compositional model for spiking neural networks | 2023-07-26 | Paper |
| Lack of Quorum Sensing Leads to Failure of Consensus in Temnothorax Ant Emigration | 2023-04-21 | Paper |
| An efficient communication abstraction for dense wireless networks | 2023-02-03 | Paper |
| Neuro-RAM unit with applications to similarity testing and compression in spiking neural networks | 2023-02-03 | Paper |
| Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks. | 2023-02-03 | Paper |
| Ant-Inspired Dynamic Task Allocation via Gossiping | 2022-11-04 | Paper |
| How to color a French flag. Biologically inspired algorithms for scale-invariant patterning | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091105 | 2022-07-21 | Paper |
| Some perspectives on PODC | 2020-12-04 | Paper |
| Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study | 2020-12-03 | Paper |
| The BG distributed simulation algorithm | 2020-12-03 | Paper |
| How to color a French flag. Biologically inspired algorithms for scale-invariant patterning | 2020-03-03 | Paper |
| Leader election in SINR model with arbitrary power control | 2020-02-13 | Paper |
| Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits | 2020-02-07 | Paper |
| On simple back-off in unreliable radio networks | 2020-01-16 | Paper |
| Liveness in timed and untimed systems | 2019-04-29 | Paper |
| Ant-inspired density estimation via random walks | 2019-01-11 | Paper |
| Computing in additive networks with bounded-information codes | 2018-08-24 | Paper |
| Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks | 2018-05-03 | Paper |
| Task-structured probabilistic I/O automata | 2018-04-18 | Paper |
| Designing algorithms for distributed systems with partially synchronized clocks | 2017-09-29 | Paper |
| Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation | 2017-09-29 | Paper |
| Ant-Inspired Density Estimation via Random Walks | 2017-09-29 | Paper |
| Specifying and using a partitionable group communication service | 2017-09-29 | Paper |
| Proving time bounds for randomized distributed algorithms | 2017-09-29 | Paper |
| Searching without communicating: tradeoffs between performance and selection complexity | 2017-08-31 | Paper |
| A tradeoff between safety and liveness for randomized coordinated attack protocols | 2017-08-21 | Paper |
| A coded shared atomic memory algorithm for message passing architectures | 2017-03-29 | Paper |
| Dynamic input/output automata: a formal and compositional model for dynamic systems | 2016-07-07 | Paper |
| A local broadcast layer for the SINR network model | 2016-03-23 | Paper |
| A (truly) local broadcast layer for unreliable radio networks | 2016-03-23 | Paper |
| Distributed house-hunting in ant colonies | 2016-03-23 | Paper |
| Bounded-contention coding for the additive network model | 2015-10-20 | Paper |
| Tight bounds for k -set agreement | 2015-09-19 | Paper |
| Counting networks are practically linearizable | 2015-09-11 | Paper |
| Structuring unreliable radio networks | 2015-09-11 | Paper |
| Multi-message broadcast with abstract MAC layers and unreliable links | 2015-09-03 | Paper |
| Trade-offs between selection complexity and performance when searching the plane without communication | 2015-09-03 | Paper |
| Gradient clock synchronization | 2015-08-03 | Paper |
| An Ω ( n log n ) lower bound on the cost of mutual exclusion | 2015-03-10 | Paper |
| The cost of radio network broadcast for different models of unreliable links | 2015-03-02 | Paper |
| Broadcasting in unreliable radio networks | 2015-03-02 | Paper |
| Virtual infrastructure for collision-prone wireless networks | 2014-12-12 | Paper |
| Asynchronous failure detectors | 2014-12-05 | Paper |
| Distributed computation in dynamic networks | 2014-08-13 | Paper |
| Structuring unreliable radio networks | 2014-07-11 | Paper |
| Straight-line program length as a parameter for complexity measures | 2014-03-14 | Paper |
| On the weakest failure detector ever | 2014-03-13 | Paper |
| Proving approximate implementations for probabilistic I/O automata | 2013-12-06 | Paper |
| Consensus and collision detectors in radio networks | 2013-06-28 | Paper |
| On the weakest failure detector ever | 2013-06-28 | Paper |
| Gradient clock synchronization | 2013-06-13 | Paper |
| GeoQuorums: implementing atomic memory in mobile ad hoc networks | 2013-06-07 | Paper |
| Bounded-Contention Coding for Wireless Networks in the High SNR Regime | 2013-03-13 | Paper |
| Bounds on Contention Management in Radio Networks | 2013-03-13 | Paper |
| Leader election using loneliness detection | 2013-02-04 | Paper |
| \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks | 2012-02-06 | Paper |
| Modeling radio networks | 2012-02-06 | Paper |
| The abstract MAC layer | 2012-02-06 | Paper |
| Leader Election Using Loneliness Detection | 2011-10-28 | Paper |
| The impossibility of boosting distributed service resilience | 2011-07-08 | Paper |
| The Theory of Timed I/O Automata | 2011-06-21 | Paper |
| The Theory of Timed I/O Automata, Second Edition | 2011-05-20 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Keeping Mobile Robot Swarms Connected | 2009-11-19 | Paper |
| The Abstract MAC Layer | 2009-11-19 | Paper |
| Modeling Radio Networks | 2009-10-22 | Paper |
| Analyzing security protocols using time-bounded task-PIOAs | 2009-05-29 | Paper |
| Trace-Based Semantics for Probabilistic Timed I/O Automata | 2009-03-11 | Paper |
| The DHCP Failover Protocol: A Formal Perspective | 2009-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549619 | 2009-01-05 | Paper |
| Modeling Computational Security in Long-Lived Systems | 2008-11-25 | Paper |
| Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols | 2008-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3519383 | 2008-08-14 | Paper |
| Self-stabilizing Mobile Node Location Management and Message Routing | 2007-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5754535 | 2007-08-22 | Paper |
| Hybrid Systems: Computation and Control | 2007-05-02 | Paper |
| Switched PIOA: parallel composition via distributed scheduling | 2006-12-07 | Paper |
| Formal Modeling and Analysis of Timed Systems | 2006-11-14 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
| Theoretical Aspects of Computing - ICTAC 2004 | 2005-11-30 | Paper |
| Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems | 2005-08-19 | Paper |
| Hybrid I/O automata. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437111 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437122 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422075 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422092 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418003 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414396 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413404 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4709174 | 2003-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791834 | 2003-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552483 | 2002-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536749 | 2002-07-15 | Paper |
| Revisiting the PAXOS algorithm | 2000-08-21 | Paper |
| Timing conditions for linearizability in uniform counting networks | 1999-06-21 | Paper |
| Eventually-serializable data services | 1999-06-21 | Paper |
| Liveness in timed and untimed systems | 1998-11-10 | Paper |
| Implementing sequentially consistent shared objects using broadcast and point-to-point communication | 1998-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385544 | 1998-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3126969 | 1997-04-03 | Paper |
| Hybrid atomicity for nested transactions | 1997-02-28 | Paper |
| A tradeoff between safety and liveness for randomized coordinated attack | 1997-02-03 | Paper |
| Action transducers and timed automata | 1996-12-01 | Paper |
| Forward and backward simulations. II: Timing-based systems | 1996-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847023 | 1996-05-28 | Paper |
| Forward and backward simulations. I. Untimed Systems | 1995-11-14 | Paper |
| Are wait-free algorithms fast? | 1994-11-03 | Paper |
| On the correctness of orphan management algorithms | 1994-08-21 | Paper |
| Bounds on the time to reach agreement in the presence of timing uncertainty | 1994-06-29 | Paper |
| Time bounds for real-time process control in the presence of timing uncertainty | 1994-06-09 | Paper |
| Bounds on shared memory for mutual exclusion | 1994-03-24 | Paper |
| A modular drinking philosophers algorithm | 1993-09-16 | Paper |
| Using mappings to prove timing properties | 1993-01-16 | Paper |
| Optimal placement of identical resources in a tree | 1992-06-28 | Paper |
| Commutativity-based locking for nested transactions | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3833630 | 1989-01-01 | Paper |
| A proof of the Kahn principle for input/output automata | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3814780 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3790621 | 1988-01-01 | Paper |
| A new fault-tolerant algorithm for clock synchronization | 1988-01-01 | Paper |
| Introduction to the theory of nested transactions | 1988-01-01 | Paper |
| Electing a leader in a synchronous ring | 1987-01-01 | Paper |
| Reaching approximate agreement in the presence of faults | 1986-01-01 | Paper |
| Easy impossibility proofs for distributed consensus problems | 1986-01-01 | Paper |
| Probabilistic analysis of a network resource allocation algorithm | 1986-01-01 | Paper |
| Impossibility of distributed consensus with one faulty process | 1985-01-01 | Paper |
| An upper and lower bound for clock synchronization | 1984-01-01 | Paper |
| Efficiency of Synchronous Versus Asynchronous Distributed Systems | 1983-01-01 | Paper |
| A technique for decomposing algorithms which use a single shared variable | 1983-01-01 | Paper |
| Multilevel atomicity—a new correctness criterion for database concurrency control | 1983-01-01 | Paper |
| Accessibility of values as a determinant of relative complexity in algebras | 1982-01-01 | Paper |
| An efficient algorithm for byzantine agreement without authentication | 1982-01-01 | Paper |
| A lower bound for the time to assure interactive consistency | 1982-01-01 | Paper |
| Upper bounds for static resource allocation in a distributed system | 1981-01-01 | Paper |
| Relative complexity of algebras | 1981-01-01 | Paper |
| On describing the behavior and implementation of distributed systems | 1981-01-01 | Paper |
| A time-space tradeoff for sorting on non-oblivious machines | 1981-01-01 | Paper |
| Efficient searching using partial ordering | 1981-01-01 | Paper |
| Relative complexity of operations on numeric and bit-string algebras | 1980-01-01 | Paper |
| Straight-line program length as a parameter for complexity analysis | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3860833 | 1979-01-01 | Paper |
| A difference in expressive power between flowcharts and recursion schemes | 1979-01-01 | Paper |
| Log space machines with multiple oracle tapes | 1978-01-01 | Paper |
| Derivation Complexity in Context-Free Grammar Forms | 1977-01-01 | Paper |
| Log Space Recognition and Translation of Parenthesis Languages | 1977-01-01 | Paper |
| Size complexity in context-free grammars forms | 1976-01-01 | Paper |
| Complexity-class-encoding sets | 1976-01-01 | Paper |
| Relativization of questions about log space computability | 1976-01-01 | Paper |
| “Helping”: several formalizations | 1976-01-01 | Paper |
| Relativization of the Theory of Computational Complexity | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4171568 | 1975-01-01 | Paper |
| A comparison of polynomial time reducibilities | 1975-01-01 | Paper |
| On Reducibility to Complex or Sparse Sets | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4162480 | 1974-01-01 | Paper |
| Approximations to the halting problem | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4061962 | 1973-01-01 | Paper |
| Number of faults a system can withstand without repairs | N/A | Paper |
