Name
Affiliation
Papers
YORAM MOSES
Department of Computer Science, The Weiemann Institute, Rehovot, 76100 Israel
104
Collaborators
Citations 
PageRank 
56
2120
417.71
Referers 
Referees 
References 
2129
696
1071
Search Limit
1001000
Title
Citations
PageRank
Year
Stochastic Coordination in Heterogeneous Load Balancing Systems00.342021
Optimistically Tuning Synchronous Byzantine Consensus: Another Win For Null Messages10.372021
Brief Announcement - Probabilistic Indistinguishability and The Quality of Validity in Byzantine Agreement.00.342021
Brief Announcement: On Using Null Messages in a Byzantine Setting00.342020
Distributed Dispatching in the Parallel Server Model00.342020
Timing in Software-Defined and Centrally-Managed Networks.00.342019
Asynchronous Signalling Processes10.362019
Byzantine Consensus in the Common Case.00.342019
Mutual exclusion as a matter of priority.00.342018
Introduction to the special issue of papers from DISC 2015.00.342018
Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour.00.342017
The Eventual C-Element Theorem for Delay-Insensitive Asynchronous Circuits30.422017
TimeFlip: Using Timestamp-Based TCAM Ranges to Accurately Schedule Network Updates60.422017
On Using Time Without Clocks via Zigzag Causality.10.352017
Characterizing Solution Concepts in Terms of Common Knowledge of Rationality.00.342017
ReversePTP: A clock synchronization scheme for software-defined networks.00.342016
OneClock to rule them all: Using time in networked applications40.452016
Unbeatable Set Consensus via Topological and Combinatorial Reasoning.00.342016
Software defined networks: It's about time200.852016
Timed Consistent Network Updates in Software-Defined Networks.60.432016
Time Capability in NETCONF.00.342016
Timeflip: Scheduling Network Updates With Timestamp-Based Tcam Ranges230.882015
Timed consistent network updates110.572015
Time4: Time for SDN30.412015
Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority10.392015
Relating Knowledge And Coordinated Action: The Knowledge Of Preconditions Principle00.342015
Analyzing Isochronic Forks with Potential Causality50.542015
On the Necessity of Time-based Updates in SDN.80.732014
Unbeatable Consensus.00.342014
Beyond Lamport's Happened-before: On Time Bounds and the Ordering of Events in Distributed Systems30.422014
ReversePTP: a software defined networking approach to clock synchronization60.552014
A procedural characterization of solution concepts in games10.352014
Timely Common Knowledge.30.392013
Agent-time Epistemics and Coordination90.652013
A Knowledge-based Treatment of Human-Automation Systems.00.342013
Time-based updates in software defined networks251.342013
The Shape of Reactive Coordination Tasks.20.402013
Brief announcement: pareto optimal solutions to consensus and set consensus50.462013
Knowledge as a window into distributed coordination00.342012
On interactive knowledge with bounded communication.100.642011
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions40.442011
Coordinated consensus in dynamic networks300.952011
Known unknowns: time bounds and knowledge of ignorance20.412011
Behind the Scenes of K&CK: the undelivered speech for the 2009 Dijkstra prize00.342010
Continuous consensus with ambiguous failures20.372010
Causing Communication Closure: Safe Program Composition with Reliable Non-FIFO Channels00.342009
Revisiting simultaneous consensus with crash failures60.462009
An Optimal Self-stabilizing Firing Squad30.392009
Optimum simultaneous consensus for general omissions is equivalent to an NP oracle00.342009
Continuous Consensus with Failures and Recoveries70.512008
  • 1
  • 2