Uri Abraham - Citegraph

Author Info

Name	Affiliation	Papers
URI ABRAHAM	Department of Mathematics and Computer Science, Ben-Gurion University of Negev, P.O. Box 653, Beer-Sheva 84105, Israel	25
Collaborators	Citations	PageRank
18	56	13.91
Referers	Referees	References
78	100	99

Publications (25 rows)

Collaborators (18 rows)

Referers (78 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Two-process synchronization.	0	0.34	2017
Event-Based Proof of the Mutual Exclusion Property of Peterson's Algorithm.	2	0.49	2015
On a Decidable Formal Theory for Abstract Continuous-Time Dynamical Systems.	3	0.58	2014
On The Mailbox Problem	1	0.43	2013
Logical classification of distributed algorithms (Bakery algorithms as an example)	3	0.49	2011
Assertional and Behavioral Approaches to Concurrency.	0	0.34	2011
Classification with Tarskian system executions (Bakery Algorithms as an example)	0	0.34	2009
Some results in polychromatic Ramsey theory	4	0.71	2007
Ladder gaps over stationary sets	0	0.34	2004
Exercises in style (Alpha specifications)	0	0.34	2003
Self-stabilizing timestamps	4	0.43	2003
On Poset Boolean Algebras	3	0.94	2003
Coding with Ladders A Well Ordering of The Reals	4	1.01	2002
Self-stabilizing l-exclusion	8	0.54	1997
Martin's axiom and D21 well-ordering of the reals.	0	0.34	1996
On interprocess communication and the implementation of multi-writer atomic registers	11	0.74	1995
On the mutual-exclusion problem: a quest for minimal solutions	0	0.34	1994
A Delta22 Well-Order of the Reals and Incompactness of L(QMM)	0	0.34	1993
On system executions and states	3	0.49	1993
On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract)	1	0.36	1991
On The Intersection Of Closed Unbounded Sets	3	0.91	1986
On the consistency of some partition theorems for continuous colorings, and the structure of aleph1-dense real order types.	0	0.34	1985
Forcing Closed Unbounded Sets	6	2.07	1983
On Forcing Without the Continuum Hypothesis	0	0.34	1983
Forcing With Stable Posets	0	0.34	1982