Amos Israeli

According to our database1, Amos Israeli authored at least 36 papers between 1984 and 2010.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
Low Memory Distributed Protocols for 2-Coloring.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

2008
An approximation algorithm for sequential rectangle placement.
Inf. Process. Lett., 2008

On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems.
Inf. Comput., 2008

2005
Time and space optimal implementations of atomic multi-writer register.
Inf. Comput., 2005

1998
Automated Meta-Control for Adaptable Real-Time Software.
Real Time Syst., 1998

The Time Complexity of Updating Snapshot Memories.
Inf. Process. Lett., 1998

1997
Uniform Dynamic Self-Stabilizing Leader Election.
IEEE Trans. Parallel Distributed Syst., 1997

Resource Bounds for Self-Stabilizing Message-Driven Protocols.
SIAM J. Comput., 1997

Time-Message Trade-Offs for the Weak Unison Problem.
Nord. J. Comput., 1997

1995
Analyzing Expected Time by Scheduler-Luck Games.
IEEE Trans. Software Eng., 1995

Linear-Time Snapshot Implementations in Unbalanced Systems.
Math. Syst. Theory, 1995

Optimal Time Byzantine Agreement for t<n/8 With Linear-Messages.
Distributed Comput., 1995

Dynamic Counting.
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

1994
Wait-Free Consensus Using Asynchronous Hardware.
SIAM J. Comput., 1994

Disjoint-Access-Parallel Implementations of Strong Shared Memory Primitives.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993
Uniform Self-Stabilizing Ring Orientation
Inf. Comput., June, 1993

Multiple Communication in Multihop Radio Networks.
SIAM J. Comput., 1993

The Track: Technion Robot And Controller Kit.
Robotica, 1993

Bonded Time-Stamps.
Distributed Comput., 1993

Self-Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity.
Distributed Comput., 1993

Linear-Time Snapshot Protocols for Unbalanced Systems.
Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

Efficient Wait-Free Implementation of a Concurrent Priority Queue.
Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

1992
A Concurrent Time-Stamp Scheme which is Linear in Time and Space.
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Optimal Multi-Writer Multi-Reader Atomic Register.
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991
Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact).
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

1990
Self-Stabilizing Ring Orientation.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Token Management Schemes and Random Walks Yield Self-Stabilizing Mutual Exclusion.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

A simulation generator for multiprocessor systems.
Proceedings of the Next Decade in Information Technology: Proceedings of the 5th Jerusalem Conference on Information Technology 1990, 1990

1989
Multiple Communication in Multi-Hop Radio Networks.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

1988
On the existence of polynomial time algorithms for interpolation problems in propositional logic.
Notre Dame J. Formal Log., 1988

Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs.
Inf. Process. Lett., 1988

1987
On Processor Coordination Using Asynchronous Hardware.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

Bounded Time-Stamps (Extended Abstract)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
An Improved Parallel Algorithm for Maximal Matching.
Inf. Process. Lett., 1986

A Fast and Simple Randomized Parallel Algorithm for Maximal Matching.
Inf. Process. Lett., 1986

1984
Finding Euler Circuits in Logarithmic Parallel Time
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984


  Loading...