Uri Abraham

According to our database1, Uri Abraham authored at least 32 papers between 1979 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Linearizability Analysis of the Contention-Friendly Binary Search Tree.
CoRR, 2023

On the ABK Conjecture, alpha-well Quasi Orders and Dress-Schiffels product.
CoRR, 2023

2019
On Lamport's "Teaching Concurrency".
Bull. EATCS, 2019

2018
On the Lazy Set object.
CoRR, 2018

Kishon's Poker Game.
CoRR, 2018

2017
Two-process synchronization.
Theor. Comput. Sci., 2017

2016
Preface.
Ann. Pure Appl. Log., 2016

2015
Event-Based Proof of the Mutual Exclusion Property of Peterson's Algorithm.
Formaliz. Math., 2015

2014
On the Mailbox Problem.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

On a Decidable Formal Theory for Abstract Continuous-Time Dynamical Systems.
Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2014

2011
Logical classification of distributed algorithms (Bakery algorithms as an example).
Theor. Comput. Sci., 2011

Assertional and Behavioral Approaches to Concurrency.
Bull. EATCS, 2011

2007
Some results in polychromatic Ramsey theory.
J. Symb. Log., 2007

2004
Ladder gaps over stationary sets.
J. Symb. Log., 2004

2003
Self-stabilizing timestamps.
Theor. Comput. Sci., 2003

On Poset Boolean Algebras.
Order, 2003

Exercises in Style (Alpha Specifications).
Fundam. Informaticae, 2003

2002
Coding with Ladders A Well Ordering of The Reals.
J. Symb. Log., 2002

2001
Self-stabilizing l-exclusion.
Theor. Comput. Sci., 2001

1996
Martin's axiom and D<sup>2</sup><sub>1</sub> well-ordering of the reals.
Arch. Math. Log., 1996

1995
On Interprocess Communication and the Implementation of Multi-Writer Atomic Registers.
Theor. Comput. Sci., 1995

1994
On the Mutual-Exclusion Problem - A Quest for Minimal Solutions.
Theor. Comput. Sci., 1994

1993
On system executions and states.
Appl. Intell., 1993

A Delta<sup>2</sup><sub>2</sub> Well-Order of the Reals and Incompactness of L(Q<sup>MM</sup>).
Ann. Pure Appl. Log., 1993

1991
On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract).
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

1986
On the Intersection of Closed Unbounded Sets.
J. Symb. Log., 1986

1985
On the consistency of some partition theorems for continuous colorings, and the structure of aleph<sub>1</sub>-dense real order types.
Ann. Pure Appl. Log., 1985

1983
Forcing Closed Unbounded Sets.
J. Symb. Log., 1983

On Forcing Without the Continuum Hypothesis.
J. Symb. Log., 1983

Aronszajn trees on aleph<sub>2</sub> and aleph<sub>3</sub>.
Ann. Pure Appl. Log., 1983

1982
Forcing With Stable Posets.
J. Symb. Log., 1982

1979
איזומורפיזם של עצי אהרונשין וכפיות ללא הנחת השערת הרצף (Isomorphism of Aronszajn trees and forcing without the generalized continuum hypothesis.).
PhD thesis, 1979


  Loading...