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

Forcing With Stable Posets. - Uri Abraham; Saharon Shelah (J. Symb. Log., 1982)

Aronszajn trees on aleph2 and aleph3. - Uri Abraham (Ann. Pure Appl. Log., 1983)

On Forcing Without the Continuum Hypothesis. - Uri Abraham (J. Symb. Log., 1983)

Forcing Closed Unbounded Sets. - Uri Abraham; Saharon Shelah (J. Symb. Log., 1983)

On the consistency of some partition theorems for continuous colorings, and the structure of aleph1-dense real order types. - Uri Abraham; Matatyahu Rubin; Saharon Shelah (Ann. Pure Appl. Log., 1985)

On the Intersection of Closed Unbounded Sets. - Uri Abraham; Saharon Shelah (J. Symb. Log., 1986)

On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract). - Uri Abraham; Shai Ben-David; Shlomo Moran (WDAG, 1991)

A Delta22 Well-Order of the Reals and Incompactness of L(QMM). - Uri Abraham; Saharon Shelah (Ann. Pure Appl. Log., 1993)

On system executions and states. - Uri Abraham (Appl. Intell., 1993)

On the Mutual-Exclusion Problem - A Quest for Minimal Solutions. - Uri Abraham; Menachem Magidor (Theor. Comput. Sci., 1994)

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

Martin's axiom and D21 well-ordering of the reals. - Uri Abraham; Saharon Shelah (Arch. Math. Log., 1996)

Self-stabilizing l-exclusion. - Uri Abraham; Shlomi Dolev; Ted Herman; Irit Koll (Theor. Comput. Sci., 2001)

Coding with Ladders A Well Ordering of The Reals. - Uri Abraham; Saharon Shelah (J. Symb. Log., 2002)

Exercises in Style (Alpha Specifications). - Uri Abraham; Tamar Pinhas (Fundam. Informaticae, 2003)

On Poset Boolean Algebras. - Uri Abraham; Robert Bonnet; Wieslaw Kubis; Matatyahu Rubin (Order, 2003)

Self-stabilizing timestamps. - Uri Abraham (Theor. Comput. Sci., 2003)

Ladder gaps over stationary sets. - Uri Abraham; Saharon Shelah (J. Symb. Log., 2004)

Some results in polychromatic Ramsey theory. - Uri Abraham; James Cummings 001; Clifford D. Smyth (J. Symb. Log., 2007)

Assertional and Behavioral Approaches to Concurrency. - Uri Abraham (Bull. EATCS, 2011)

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

On a Decidable Formal Theory for Abstract Continuous-Time Dynamical Systems. - Ievgen Ivanov; Mykola S. Nikitchenko; Uri Abraham (ICTERI, 2014)

On the Mailbox Problem. - Uri Abraham; Gal Amram (OPODIS, 2014)

Event-Based Proof of the Mutual Exclusion Property of Peterson's Algorithm. - Ievgen Ivanov; Mykola S. Nikitchenko; Uri Abraham (Formaliz. Math., 2015)

Preface. - Uri Abraham; Lev D. Beklemishev; Paola D'Aquino; Marcus Tressl (Ann. Pure Appl. Log., 2016)

Two-process synchronization. - Uri Abraham; Gal Amram (Theor. Comput. Sci., 2017)

Kishon's Poker Game. - Uri Abraham (CoRR, 2018)

On the Lazy Set object. - Uri Abraham (CoRR, 2018)

On Lamport's "Teaching Concurrency". - Uri Abraham (Bull. EATCS, 2019)

On the ABK Conjecture, alpha-well Quasi Orders and Dress-Schiffels product. - Uri Abraham; Robert Bonnet; Mirna Dzamonja; Maurice Pouzet (CoRR, 2023)

Linearizability Analysis of the Contention-Friendly Binary Search Tree. - Uri Abraham; Avi Hayoun (CoRR, 2023)