Searching for authors named "Dan Touitou" – sorted by Relevance.
-
Elimination Trees and the Construction of Pools and Stacks
- -Aviv University Dan Touitou Tel-Aviv University February 28, 1996 Abstract Shared pools and stacks are two
- Cited by 31 (9 self) – Add To MetaCart
-
Long-Lived and Adaptive Atomic Snapshot and Immediate Snapshot (Extended Abstract)
- Computer Science Dept. Tel-Aviv University Israel 69978 stupp@(email omitted); Dan Touitou IBM Research Lab
- Cited by 13 (0 self) – Add To MetaCart
-
Software Transactional Memory
- Software Transactional Memory Nir Shavit MIT and Tel-Aviv University Dan Touitou Tel
- Cited by 250 (6 self) – Add To MetaCart
-
Long-Lived Renaming Made Adaptive (Extended Abstract)
- z Gideon Stupp x Dan Touitou -- Abstract Two implementations of an adaptive, wait
- Add To MetaCart
-
Long-lived Adaptive Collect with Applications (Extended Abstract)
- -Aviv University, Israel 69978. afek@(email omitted);. Dan Touitou Interdisciplinary Center, Herzliya, Israel 46150
- Add To MetaCart
-
Long Lived Adaptive Splitter and Applications
- and Applications Yehuda Afek 1 , Gideon Stupp 2 , Dan Touitou 3 1 Computer Science Department, Tel
- Cited by 5 (0 self) – Add To MetaCart
-
Counting Networks are Practically Linearizable
- Dan Touitou -- Abstract Counting networks are a class of concurrent structures that allow the design
- Cited by 9 (2 self) – Add To MetaCart
-
Towards a practical snapshot algorithm
- in terms of overall throughput and latency. 1. INTRODUCTION Yaron Riany, Nir Shavit, Dan Touitou Tel Aviv
- Cited by 6 (1 self) – Add To MetaCart
-
Adaptive Long-Lived Renaming Using Bounded Memory (Extend Abstract)
- y Arie Fouren z Gideon Stupp x Dan Touitou -- April 12, 1999 Abstract This paper addresses
- Cited by 20 (7 self) – Add To MetaCart
-
Supporting Increment and Decrement Operations in Balancing Networks
- Busch z Maurice Herlihy z Marios Mavronicolas x Nir Shavit { Dan Touitou k November 6, 1998
- Cited by 9 (7 self) – Add To MetaCart

