default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUri Abraham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i5]Uri Abraham, Robert Bonnet, Mirna Dzamonja, Maurice Pouzet:
On the ABK Conjecture, alpha-well Quasi Orders and Dress-Schiffels product. CoRR abs/2303.11451 (2023)- [i4]Uri Abraham, Avi Hayoun:
Linearizability Analysis of the Contention-Friendly Binary Search Tree. CoRR abs/2305.07758 (2023)
2010 – 2019
- 2019
- [j24]Uri Abraham:
On Lamport's "Teaching Concurrency". Bull. EATCS 127 (2019) - 2018
- [i3]Uri Abraham:
Kishon's Poker Game. CoRR abs/1809.08576 (2018) - [i2]Uri Abraham:
On the Lazy Set object. CoRR abs/1811.00756 (2018) - 2017
- [j23]Uri Abraham, Gal Amram
:
Two-process synchronization. Theor. Comput. Sci. 688: 2-23 (2017) - 2016
- [j22]Uri Abraham, Lev D. Beklemishev, Paola D'Aquino, Marcus Tressl:
Preface. Ann. Pure Appl. Log. 167(10): 865-867 (2016) - 2015
- [j21]Ievgen Ivanov, Mykola S. Nikitchenko, Uri Abraham:
Event-Based Proof of the Mutual Exclusion Property of Peterson's Algorithm. Formaliz. Math. 23(4): 325-331 (2015) - 2014
- [c4]Ievgen Ivanov, Mykola S. Nikitchenko, Uri Abraham:
On a Decidable Formal Theory for Abstract Continuous-Time Dynamical Systems. ICTERI 2014: 78-99 - [c3]Uri Abraham, Gal Amram:
On the Mailbox Problem. OPODIS 2014: 453-468 - 2013
- [i1]Uri Abraham, Gal Amram:
On the Mailbox Problem. CoRR abs/1307.5619 (2013) - 2011
- [j20]Uri Abraham:
Assertional and Behavioral Approaches to Concurrency. Bull. EATCS 105: 100-117 (2011) - [j19]Uri Abraham:
Logical classification of distributed algorithms (Bakery algorithms as an example). Theor. Comput. Sci. 412(25): 2724-2745 (2011)
2000 – 2009
- 2007
- [j18]Uri Abraham, James Cummings, Clifford D. Smyth:
Some results in polychromatic Ramsey theory. J. Symb. Log. 72(3): 865-896 (2007) - 2004
- [j17]Uri Abraham, Saharon Shelah:
Ladder gaps over stationary sets. J. Symb. Log. 69(2): 518-532 (2004) - 2003
- [j16]Uri Abraham, Tamar Pinhas:
Exercises in Style (Alpha Specifications). Fundam. Informaticae 54(2-3): 107-135 (2003) - [j15]Uri Abraham, Robert Bonnet, Wieslaw Kubis, Matatyahu Rubin:
On Poset Boolean Algebras. Order 20(3): 265-290 (2003) - [j14]Uri Abraham:
Self-stabilizing timestamps. Theor. Comput. Sci. 308(1-3): 449-515 (2003) - 2002
- [j13]Uri Abraham, Saharon Shelah:
Coding with Ladders A Well Ordering of The Reals. J. Symb. Log. 67(2): 579-597 (2002) - 2001
- [j12]Uri Abraham, Shlomi Dolev, Ted Herman, Irit Koll:
Self-stabilizing l-exclusion. Theor. Comput. Sci. 266(1-2): 653-692 (2001)
1990 – 1999
- 1997
- [c2]Uri Abraham, Shlomi Dolev, Ted Herman, Irit Koll:
Self-stabilizing L-exclusion. WSS 1997: 48-63 - 1996
- [j11]Uri Abraham, Saharon Shelah:
Martin's axiom and D21 well-ordering of the reals. Arch. Math. Log. 35(5-6): 287-298 (1996) - 1995
- [j10]Uri Abraham:
On Interprocess Communication and the Implementation of Multi-Writer Atomic Registers. Theor. Comput. Sci. 149(2): 257-298 (1995) - 1994
- [j9]Uri Abraham, Menachem Magidor:
On the Mutual-Exclusion Problem - A Quest for Minimal Solutions. Theor. Comput. Sci. 129(1): 1-38 (1994) - 1993
- [j8]Uri Abraham, Saharon Shelah:
A Delta22 Well-Order of the Reals and Incompactness of L(QMM). Ann. Pure Appl. Log. 59(1): 1-32 (1993) - [j7]Uri Abraham:
On system executions and states. Appl. Intell. 3(1): 17-30 (1993) - 1991
- [c1]Uri Abraham, Shai Ben-David, Shlomo Moran:
On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract). WDAG 1991: 1-8
1980 – 1989
- 1986
- [j6]Uri Abraham, Saharon Shelah:
On the Intersection of Closed Unbounded Sets. J. Symb. Log. 51(1): 180-189 (1986) - 1985
- [j5]Uri Abraham, Matatyahu Rubin, Saharon Shelah:
On the consistency of some partition theorems for continuous colorings, and the structure of aleph1-dense real order types. Ann. Pure Appl. Log. 29(2): 123-206 (1985) - 1983
- [j4]Uri Abraham:
Aronszajn trees on aleph2 and aleph3. Ann. Pure Appl. Log. 24(3): 213-230 (1983) - [j3]Uri Abraham, Saharon Shelah:
Forcing Closed Unbounded Sets. J. Symb. Log. 48(3): 643-657 (1983) - [j2]Uri Abraham:
On Forcing Without the Continuum Hypothesis. J. Symb. Log. 48(3): 658-661 (1983) - 1982
- [j1]Uri Abraham, Saharon Shelah:
Forcing With Stable Posets. J. Symb. Log. 47(1): 37-42 (1982)
1970 – 1979
- 1979
- [b1]Uri Abraham:
איזומורפיזם של עצי אהרונשין וכפיות ללא הנחת השערת הרצף (Isomorphism of Aronszajn trees and forcing without the generalized continuum hypothesis.). Hebrew University of Jerusalem, Israel, 1979
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
