Stochastic Coordination in Heterogeneous Load Balancing Systems | 0 | 0.34 | 2021 |
Optimistically Tuning Synchronous Byzantine Consensus: Another Win For Null Messages | 1 | 0.37 | 2021 |
Brief Announcement - Probabilistic Indistinguishability and The Quality of Validity in Byzantine Agreement. | 0 | 0.34 | 2021 |
Brief Announcement: On Using Null Messages in a Byzantine Setting | 0 | 0.34 | 2020 |
Distributed Dispatching in the Parallel Server Model | 0 | 0.34 | 2020 |
Timing in Software-Defined and Centrally-Managed Networks. | 0 | 0.34 | 2019 |
Asynchronous Signalling Processes | 1 | 0.36 | 2019 |
Byzantine Consensus in the Common Case. | 0 | 0.34 | 2019 |
Mutual exclusion as a matter of priority. | 0 | 0.34 | 2018 |
Introduction to the special issue of papers from DISC 2015. | 0 | 0.34 | 2018 |
Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour. | 0 | 0.34 | 2017 |
The Eventual C-Element Theorem for Delay-Insensitive Asynchronous Circuits | 3 | 0.42 | 2017 |
TimeFlip: Using Timestamp-Based TCAM Ranges to Accurately Schedule Network Updates | 6 | 0.42 | 2017 |
On Using Time Without Clocks via Zigzag Causality. | 1 | 0.35 | 2017 |
Characterizing Solution Concepts in Terms of Common Knowledge of Rationality. | 0 | 0.34 | 2017 |
ReversePTP: A clock synchronization scheme for software-defined networks. | 0 | 0.34 | 2016 |
OneClock to rule them all: Using time in networked applications | 4 | 0.45 | 2016 |
Unbeatable Set Consensus via Topological and Combinatorial Reasoning. | 0 | 0.34 | 2016 |
Software defined networks: It's about time | 20 | 0.85 | 2016 |
Timed Consistent Network Updates in Software-Defined Networks. | 6 | 0.43 | 2016 |
Time Capability in NETCONF. | 0 | 0.34 | 2016 |
Timeflip: Scheduling Network Updates With Timestamp-Based Tcam Ranges | 23 | 0.88 | 2015 |
Timed consistent network updates | 11 | 0.57 | 2015 |
Time4: Time for SDN | 3 | 0.41 | 2015 |
Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority | 1 | 0.39 | 2015 |
Relating Knowledge And Coordinated Action: The Knowledge Of Preconditions Principle | 0 | 0.34 | 2015 |
Analyzing Isochronic Forks with Potential Causality | 5 | 0.54 | 2015 |
On the Necessity of Time-based Updates in SDN. | 8 | 0.73 | 2014 |
Unbeatable Consensus. | 0 | 0.34 | 2014 |
Beyond Lamport's Happened-before: On Time Bounds and the Ordering of Events in Distributed Systems | 3 | 0.42 | 2014 |
ReversePTP: a software defined networking approach to clock synchronization | 6 | 0.55 | 2014 |
A procedural characterization of solution concepts in games | 1 | 0.35 | 2014 |
Timely Common Knowledge. | 3 | 0.39 | 2013 |
Agent-time Epistemics and Coordination | 9 | 0.65 | 2013 |
A Knowledge-based Treatment of Human-Automation Systems. | 0 | 0.34 | 2013 |
Time-based updates in software defined networks | 25 | 1.34 | 2013 |
The Shape of Reactive Coordination Tasks. | 2 | 0.40 | 2013 |
Brief announcement: pareto optimal solutions to consensus and set consensus | 5 | 0.46 | 2013 |
Knowledge as a window into distributed coordination | 0 | 0.34 | 2012 |
On interactive knowledge with bounded communication. | 10 | 0.64 | 2011 |
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions | 4 | 0.44 | 2011 |
Coordinated consensus in dynamic networks | 30 | 0.95 | 2011 |
Known unknowns: time bounds and knowledge of ignorance | 2 | 0.41 | 2011 |
Behind the Scenes of K&CK: the undelivered speech for the 2009 Dijkstra prize | 0 | 0.34 | 2010 |
Continuous consensus with ambiguous failures | 2 | 0.37 | 2010 |
Causing Communication Closure: Safe Program Composition with Reliable Non-FIFO Channels | 0 | 0.34 | 2009 |
Revisiting simultaneous consensus with crash failures | 6 | 0.46 | 2009 |
An Optimal Self-stabilizing Firing Squad | 3 | 0.39 | 2009 |
Optimum simultaneous consensus for general omissions is equivalent to an NP oracle | 0 | 0.34 | 2009 |
Continuous Consensus with Failures and Recoveries | 7 | 0.51 | 2008 |