Yoram Moses

From MaRDI portal
Person:418186

Available identifiers

zbMath Open moses.yoramDBLP81/49WikidataQ2897783 ScholiaQ2897783MaRDI QIDQ418186

List of research outcomes





PublicationDate of PublicationType
Stochastic coordination in heterogeneous load balancing systems2024-03-26Paper
https://portal.mardi4nfdi.de/entity/Q60834422023-12-08Paper
Distributed dispatching in the parallel server model2023-11-02Paper
Stochastic coordination in heterogeneous load balancing systems2023-09-11Paper
https://portal.mardi4nfdi.de/entity/Q58742482023-02-07Paper
Information Flow Guided Synthesis2022-12-07Paper
Off-line reasoning for on-line efficiency: knowledge bases2022-09-23Paper
Unbeatable consensus2022-04-01Paper
https://portal.mardi4nfdi.de/entity/Q50153952021-12-07Paper
Optimistically tuning synchronous Byzantine consensus: another win for null messages2021-11-08Paper
Brief Announcement: On Using Null Messages in a Byzantine Setting2021-03-15Paper
Probably Approximately Knowing2021-03-15Paper
Using counterfactuals in knowledge-based programming2020-12-04Paper
Knowledge-based programs2020-12-02Paper
Silence2020-11-11Paper
Known Unknowns: Time Bounds and Knowledge of Ignorance2020-07-24Paper
Silence2019-09-19Paper
Mutual exclusion as a matter of priority2018-11-29Paper
On Using Time Without Clocks via Zigzag Causality2017-10-11Paper
Knowledge-oriented programming2017-09-29Paper
Knowledge-based programs2017-09-29Paper
Knowledge, timed precedence and clocks (preliminary report)2017-09-29Paper
Unbeatable Set Consensus via Topological and Combinatorial Reasoning2017-09-29Paper
Characterizing solution concepts in terms of common knowledge of rationality2017-08-15Paper
The unified structure of consensus, a layered analysis approach2016-03-02Paper
Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority2016-01-08Paper
Coordinated consensus in dynamic networks2015-09-11Paper
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions2015-09-11Paper
Fully polynomial Byzantine agreement in t + 1 rounds2015-05-07Paper
Agent-Time Epistemics and Coordination2015-01-06Paper
Beyond Lamport's Happened-before2014-09-12Paper
A Procedural Characterization of Solution Concepts in Games2014-03-24Paper
Causing communication closure: safe program composition with reliable non-FIFO channels2013-06-28Paper
Continuous consensus via common knowledge2013-06-20Paper
An optimal self-stabilizing firing squad2012-08-10Paper
On interactive knowledge with bounded communication2012-07-17Paper
No double discount: condition-based simultaneity yields limited gain2012-05-24Paper
A Refinement Theory that Supports Reasoning about Knowledge and Time for Synchronous Agents2011-05-06Paper
Beyond Lamport’s Happened-Before: On the Role of Time Bounds in Synchronous Systems2010-09-10Paper
Continuous consensus with ambiguous failures2010-08-11Paper
Single-bit messages are insufficient for data link over duplicating channels2010-04-19Paper
Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle2009-11-19Paper
No Double Discount: Condition-Based Simultaneity Yields Limited Gain2008-11-20Paper
Continuous Consensus with Failures and Recoveries2008-11-20Paper
A New Proof of the GHS Minimum Spanning Tree Algorithm2008-09-09Paper
Continuous Consensus with Ambiguous Failures2008-03-06Paper
Distributed Computing2006-11-01Paper
Distributed Computing – IWDC 20052006-10-10Paper
Distributed Computing – IWDC 20052006-10-10Paper
Computer Vision - ECCV 20042005-12-27Paper
https://portal.mardi4nfdi.de/entity/Q46619712005-03-30Paper
https://portal.mardi4nfdi.de/entity/Q27666242002-06-17Paper
https://portal.mardi4nfdi.de/entity/Q27666502002-06-17Paper
A layered analysis of consensus2002-04-23Paper
A characterization of eventual Byzantine agreement2002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q45082972000-10-03Paper
Common knowledge revisited1999-06-24Paper
Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds1998-05-10Paper
Applications of a logic of knowledge to motion planning under uncertainty1998-02-17Paper
https://portal.mardi4nfdi.de/entity/Q48454721995-09-11Paper
Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time1994-09-08Paper
Belief as defeasible knowledge1994-05-26Paper
A guide to completeness and complexity for modal logics of knowledge and belief1992-09-27Paper
Knowledge and common knowledge in a distributed environment1990-01-01Paper
Knowledge and common knowledge in a Byzantine environment: Crash failures1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31989121989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57504281989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52037171988-01-01Paper
Programming simultaneous actions using common knowledge1988-01-01Paper
Cheating husbands and other stories: A case study of knowledge, action, and communication1986-01-01Paper
Taken by surprise: the paradox of the surprise test revisited1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37033151985-01-01Paper
On the Encoding of Relations by Graphs1984-01-01Paper

Research outcomes over time

This page was built for person: Yoram Moses