| Publication | Date of Publication | Type |
|---|
Learning hierarchically-structured concepts. II: Overlapping concepts, and networks with feedback
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Learning hierarchically-structured concepts
Neural Networks | 2023-09-28 | Paper |
A basic compositional model for spiking neural networks
Lecture Notes in Computer Science | 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
Lecture Notes in Computer Science | 2022-11-04 | Paper |
How to color a French flag. Biologically inspired algorithms for scale-invariant patterning
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
scientific article; zbMATH DE number 7561455 (Why is no real title available?)
| 2022-07-21 | Paper |
Some perspectives on PODC
Distributed Computing | 2020-12-04 | Paper |
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing | 2020-12-03 | Paper |
The BG distributed simulation algorithm
Distributed Computing | 2020-12-03 | Paper |
How to color a French flag. Biologically inspired algorithms for scale-invariant patterning
Structural Information and Communication Complexity | 2020-03-03 | Paper |
Leader election in SINR model with arbitrary power control
Theoretical Computer Science | 2020-02-13 | Paper |
Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits
Neural Computation | 2020-02-07 | Paper |
On simple back-off in unreliable radio networks
Theoretical Computer Science | 2020-01-16 | Paper |
Liveness in timed and untimed systems
Automata, Languages and Programming | 2019-04-29 | Paper |
Ant-inspired density estimation via random walks
Proceedings of the National Academy of Sciences | 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
Journal of Computer and System Sciences | 2018-04-18 | Paper |
Designing algorithms for distributed systems with partially synchronized clocks
Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
Information-theoretic lower bounds on the storage cost of shared memory emulation
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Ant-Inspired Density Estimation via Random Walks
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Specifying and using a partitionable group communication service
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
Proving time bounds for randomized distributed algorithms
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
Searching without communicating: tradeoffs between performance and selection complexity
Distributed Computing | 2017-08-31 | Paper |
A tradeoff between safety and liveness for randomized coordinated attack protocols
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
A coded shared atomic memory algorithm for message passing architectures
Distributed Computing | 2017-03-29 | Paper |
Dynamic input/output automata: a formal and compositional model for dynamic systems
Information and Computation | 2016-07-07 | Paper |
A local broadcast layer for the SINR network model
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
A (truly) local broadcast layer for unreliable radio networks
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Distributed house-hunting in ant colonies
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Bounded-contention coding for the additive network model
Distributed Computing | 2015-10-20 | Paper |
Tight bounds for \(k\)-set agreement
Journal of the ACM | 2015-09-19 | Paper |
Counting networks are practically linearizable
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
Structuring unreliable radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Multi-message broadcast with abstract MAC layers and unreliable links
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Trade-offs between selection complexity and performance when searching the plane without communication
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Gradient clock synchronization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
An \({\Omega}(n\log n)\) lower bound on the cost of mutual exclusion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
The cost of radio network broadcast for different models of unreliable links
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Virtual infrastructure for collision-prone wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Asynchronous failure detectors
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Structuring unreliable radio networks
Distributed Computing | 2014-07-11 | Paper |
Straight-line program length as a parameter for complexity measures
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
On the weakest failure detector ever
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Proving approximate implementations for probabilistic I/O automata
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
Consensus and collision detectors in radio networks
Distributed Computing | 2013-06-28 | Paper |
On the weakest failure detector ever
Distributed Computing | 2013-06-28 | Paper |
Gradient clock synchronization
Distributed Computing | 2013-06-13 | Paper |
GeoQuorums: implementing atomic memory in mobile ad hoc networks
Distributed Computing | 2013-06-07 | Paper |
Bounded-contention coding for wireless networks in the high SNR regime
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Bounds on contention management in radio networks
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Leader election using loneliness detection
Distributed Computing | 2013-02-04 | Paper |
\textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
Distributed Computing | 2012-02-06 | Paper |
Modeling radio networks
Distributed Computing | 2012-02-06 | Paper |
The abstract MAC layer
Distributed Computing | 2012-02-06 | Paper |
Leader election using loneliness detection
Lecture Notes in Computer Science | 2011-10-28 | Paper |
The impossibility of boosting distributed service resilience
Information and Computation | 2011-07-08 | Paper |
The Theory of Timed I/O Automata
Synthesis Lectures on Computer Science | 2011-06-21 | Paper |
The theory of timed I/O automata
Synthesis Lectures on Distributed Computing Theory | 2011-05-20 | Paper |
CONCUR 2003 - Concurrency Theory
Lecture Notes in Computer Science | 2010-03-30 | Paper |
Efficient replication of large data objects
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Keeping Mobile Robot Swarms Connected
Lecture Notes in Computer Science | 2009-11-19 | Paper |
The Abstract MAC Layer
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Modeling Radio Networks
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Analyzing security protocols using time-bounded task-PIOAs
Discrete Event Dynamic Systems | 2009-05-29 | Paper |
Trace-Based Semantics for Probabilistic Timed I/O Automata
Hybrid Systems: Computation and Control | 2009-03-11 | Paper |
The DHCP Failover Protocol: A Formal Perspective
Lecture Notes in Computer Science | 2009-03-10 | Paper |
scientific article; zbMATH DE number 5485457 (Why is no real title available?)
| 2009-01-05 | Paper |
Modeling Computational Security in Long-Lived Systems
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Observing branching structure through probabilistic contexts
| 2008-08-14 | Paper |
Self-stabilizing Mobile Node Location Management and Message Routing
Lecture Notes in Computer Science | 2007-09-25 | Paper |
A three-level analysis of a simple acceleration maneuver, with uncertainties
| 2007-08-22 | Paper |
Hybrid Systems: Computation and Control
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science | 2006-12-07 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Theoretical Aspects of Computing - ICTAC 2004
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Lecture Notes in Computer Science | 2005-08-19 | Paper |
Hybrid I/O automata.
Information and Computation | 2004-03-14 | Paper |
scientific article; zbMATH DE number 2013819 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 2013830 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 1973981 (Why is no real title available?)
| 2003-09-03 | Paper |
scientific article; zbMATH DE number 1973995 (Why is no real title available?)
| 2003-09-03 | Paper |
scientific article; zbMATH DE number 1956640 (Why is no real title available?)
| 2003-07-30 | Paper |
scientific article; zbMATH DE number 1953037 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1950675 (Why is no real title available?)
| 2003-07-17 | Paper |
scientific article; zbMATH DE number 1931815 (Why is no real title available?)
| 2003-06-20 | Paper |
scientific article; zbMATH DE number 1863163 (Why is no real title available?)
| 2003-02-03 | Paper |
scientific article; zbMATH DE number 1794382 (Why is no real title available?)
| 2002-09-03 | Paper |
scientific article; zbMATH DE number 1759734 (Why is no real title available?)
| 2002-07-15 | Paper |
Revisiting the PAXOS algorithm
Theoretical Computer Science | 2000-08-21 | Paper |
Timing conditions for linearizability in uniform counting networks
Theoretical Computer Science | 1999-06-21 | Paper |
Eventually-serializable data services
Theoretical Computer Science | 1999-06-21 | Paper |
Liveness in timed and untimed systems
Information and Computation | 1998-11-10 | Paper |
Implementing sequentially consistent shared objects using broadcast and point-to-point communication
Journal of the ACM | 1998-10-25 | Paper |
scientific article; zbMATH DE number 1142328 (Why is no real title available?)
| 1998-05-14 | Paper |
scientific article; zbMATH DE number 996442 (Why is no real title available?)
| 1997-04-03 | Paper |
Hybrid atomicity for nested transactions
Theoretical Computer Science | 1997-02-28 | Paper |
A tradeoff between safety and liveness for randomized coordinated attack
Information and Computation | 1997-02-03 | Paper |
Action transducers and timed automata
Formal Aspects of Computing | 1996-12-01 | Paper |
Forward and backward simulations. II: Timing-based systems
Information and Computation | 1996-10-01 | Paper |
scientific article; zbMATH DE number 794262 (Why is no real title available?)
| 1996-05-28 | Paper |
Forward and backward simulations. I. Untimed Systems
Information and Computation | 1995-11-14 | Paper |
Are wait-free algorithms fast?
Journal of the ACM | 1994-11-03 | Paper |
On the correctness of orphan management algorithms
Journal of the ACM | 1994-08-21 | Paper |
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM | 1994-06-29 | Paper |
Time bounds for real-time process control in the presence of timing uncertainty
Information and Computation | 1994-06-09 | Paper |
Bounds on shared memory for mutual exclusion
Information and Computation | 1994-03-24 | Paper |
A modular drinking philosophers algorithm
Distributed Computing | 1993-09-16 | Paper |
Using mappings to prove timing properties
Distributed Computing | 1993-01-16 | Paper |
Optimal placement of identical resources in a tree
Information and Computation | 1992-06-28 | Paper |
Commutativity-based locking for nested transactions
Journal of Computer and System Sciences | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4110131 (Why is no real title available?)
| 1989-01-01 | Paper |
A proof of the Kahn principle for input/output automata
Information and Computation | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4084989 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4055011 (Why is no real title available?)
| 1988-01-01 | Paper |
A new fault-tolerant algorithm for clock synchronization
Information and Computation | 1988-01-01 | Paper |
Introduction to the theory of nested transactions
Theoretical Computer Science | 1988-01-01 | Paper |
Electing a leader in a synchronous ring
Journal of the ACM | 1987-01-01 | Paper |
Reaching approximate agreement in the presence of faults
Journal of the ACM | 1986-01-01 | Paper |
Easy impossibility proofs for distributed consensus problems
Distributed Computing | 1986-01-01 | Paper |
Probabilistic analysis of a network resource allocation algorithm
Information and Control | 1986-01-01 | Paper |
Impossibility of distributed consensus with one faulty process
Journal of the ACM | 1985-01-01 | Paper |
An upper and lower bound for clock synchronization
Information and Control | 1984-01-01 | Paper |
Efficiency of Synchronous Versus Asynchronous Distributed Systems
Journal of the ACM | 1983-01-01 | Paper |
A technique for decomposing algorithms which use a single shared variable
Journal of Computer and System Sciences | 1983-01-01 | Paper |
Multilevel atomicity—a new correctness criterion for database concurrency control
ACM Transactions on Database Systems | 1983-01-01 | Paper |
Accessibility of values as a determinant of relative complexity in algebras
Journal of Computer and System Sciences | 1982-01-01 | Paper |
An efficient algorithm for byzantine agreement without authentication
Information and Control | 1982-01-01 | Paper |
A lower bound for the time to assure interactive consistency
Information Processing Letters | 1982-01-01 | Paper |
Upper bounds for static resource allocation in a distributed system
Journal of Computer and System Sciences | 1981-01-01 | Paper |
Relative complexity of algebras
Mathematical Systems Theory | 1981-01-01 | Paper |
On describing the behavior and implementation of distributed systems
Theoretical Computer Science | 1981-01-01 | Paper |
A time-space tradeoff for sorting on non-oblivious machines
Journal of Computer and System Sciences | 1981-01-01 | Paper |
Efficient searching using partial ordering
Information Processing Letters | 1981-01-01 | Paper |
Relative complexity of operations on numeric and bit-string algebras
Mathematical Systems Theory | 1980-01-01 | Paper |
Straight-line program length as a parameter for complexity analysis
Journal of Computer and System Sciences | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3662563 (Why is no real title available?)
| 1979-01-01 | Paper |
A difference in expressive power between flowcharts and recursion schemes
Mathematical Systems Theory | 1979-01-01 | Paper |
Log space machines with multiple oracle tapes
Theoretical Computer Science | 1978-01-01 | Paper |
Derivation Complexity in Context-Free Grammar Forms
SIAM Journal on Computing | 1977-01-01 | Paper |
Log Space Recognition and Translation of Parenthesis Languages
Journal of the ACM | 1977-01-01 | Paper |
Size complexity in context-free grammars forms
Journal of the ACM | 1976-01-01 | Paper |
Complexity-class-encoding sets
Journal of Computer and System Sciences | 1976-01-01 | Paper |
Relativization of questions about log space computability
Mathematical Systems Theory | 1976-01-01 | Paper |
“Helping”: several formalizations
Journal of Symbolic Logic | 1976-01-01 | Paper |
Relativization of the Theory of Computational Complexity
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3605930 (Why is no real title available?)
| 1975-01-01 | Paper |
A comparison of polynomial time reducibilities
Theoretical Computer Science | 1975-01-01 | Paper |
On Reducibility to Complex or Sparse Sets
Journal of the ACM | 1975-01-01 | Paper |
scientific article; zbMATH DE number 3592966 (Why is no real title available?)
| 1974-01-01 | Paper |
Approximations to the halting problem
Journal of Computer and System Sciences | 1974-01-01 | Paper |
scientific article; zbMATH DE number 3478395 (Why is no real title available?)
| 1973-01-01 | Paper |
Number of faults a system can withstand without repairs
| N/A | Paper |
