|
Search the dblp DataBase
Dan Touitou:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Yehuda Afek, Gideon Stupp, Dan Touitou
ong-lived Adaptive Collect with Applications. [Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:262-272 [Conf]
- Yaron Riany, Nir Shavit, Dan Touitou
Towards A Practical Snapshot Algorithm. [Citation Graph (0, 0)][DBLP] ISTCS, 1995, pp:121-129 [Conf]
- Yehuda Afek, Hagit Attiya, Arie Fouren, Gideon Stupp, Dan Touitou
Long-Lived Renaming Made Adaptive. [Citation Graph (0, 0)][DBLP] PODC, 1999, pp:91-103 [Conf]
- Yehuda Afek, Pazi Boxer, Dan Touitou
Bounds on the shared memory requirements for long-lived adaptive objects (extended abstract). [Citation Graph (0, 0)][DBLP] PODC, 2000, pp:81-89 [Conf]
- Yehuda Afek, Michael Merritt, Gadi Taubenfeld, Dan Touitou
Disentangling Multi-Object Operations (Extended Abstract). [Citation Graph (0, 0)][DBLP] PODC, 1997, pp:111-120 [Conf]
- Yehuda Afek, Gideon Stupp, Dan Touitou
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract). [Citation Graph (0, 0)][DBLP] PODC, 2000, pp:71-80 [Conf]
- Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou
Counting Networks are Practically Linearizable. [Citation Graph (0, 0)][DBLP] PODC, 1996, pp:280-289 [Conf]
- Nir Shavit, Dan Touitou
Software Transactional Memory. [Citation Graph (0, 0)][DBLP] PODC, 1995, pp:204-213 [Conf]
- Nir Shavit, Dan Touitou
Elimination Trees and the Construction of Pools and Stacks (Preliminary Version). [Citation Graph (0, 0)][DBLP] SPAA, 1995, pp:54-63 [Conf]
- William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
Supporting Increment and Decrement Operations in Balancing Networks. [Citation Graph (0, 0)][DBLP] STACS, 1999, pp:393-403 [Conf]
- Yehuda Afek, Dalia Dauber, Dan Touitou
Wait-free made fast (Extended Abstract). [Citation Graph (0, 0)][DBLP] STOC, 1995, pp:538-547 [Conf]
- William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
Supporting Increment and Decrement Operations in Balancing Networks. [Citation Graph (0, 0)][DBLP] Chicago J. Theor. Comput. Sci., 2000, v:2000, n:, pp:- [Journal]
- Nir Shavit, Dan Touitou
Software Transactional Memory. [Citation Graph (0, 0)][DBLP] Distributed Computing, 1997, v:10, n:2, pp:99-116 [Journal]
- Yehuda Afek, Gideon Stupp, Dan Touitou
Long lived adaptive splitter and applications. [Citation Graph (0, 0)][DBLP] Distributed Computing, 2002, v:15, n:2, pp:67-86 [Journal]
- Nir Shavit, Dan Touitou
Elimination Trees and the Construction of Pools and Stacks. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 1997, v:30, n:6, pp:645-670 [Journal]
- Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou
Timing Conditions for Linearizability in Uniform Counting Networks. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:220, n:1, pp:67-91 [Journal]
- Yaron Riany, Nir Shavit, Dan Touitou
Towards a practical snapshot algorithm. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:269, n:1-2, pp:163-201 [Journal]
Search in 0.002secs, Finished in 0.002secs
|