Get started
Author

Dan Touitou

Observed name: D. Touitou
OpenAlex ID: A5090313350
Software transactional memory
1995 · Nir Shavit, Dan Touitou · ACM Symposium on Principles of Distributed Computing (PODC) · 1,233
PDF
Software transactional memory
1997 · Nir Shavit, Dan Touitou · Distributed Computing · 405
Wait-free made fast
1995 · Yehuda Afek, Dalia Dauber, et al. · ACM Symposium on Theory of Computing (STOC) · 106
PDF
Elimination Trees and the Construction of Pools and Stacks
1997 · N. Shavit, D. Touitou · Theory of Computing Systems · 88
Long-lived adaptive collect with applications
2003 · Y. Afek, G. Stupp, et al. · Annual Symposium on Foundations of Computer Science · 74
Long-lived renaming made adaptive
1999 · Yehuda Afek, Hagit Attiya, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 61
Long lived adaptive splitter and applications
2002 · Afek Yehuda, Gideon Stupp, et al. · Distributed Computing · 54
Elimination trees and the construction of pools and stacks
1995 · Nir Shavit, Dan Touitou · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · 54
PDF
Disentangling multi-object operations (extended abstract)
1997 · Yehuda Afek, Michael Merrit, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 51
PDF
Disentangling Multi-object Operations
1997 · Michael Merrittt, Gadi Taubenfeld, et al. · 42
Towards a practical snapshot algorithm
2001 · Yaron Riany, Nir Shavit, et al. · Theoretical Computer Science · 29
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
2000 · Yehuda Afek, Gideon Stupp, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 29
Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract)
2000 · Yehuda Afek, Pazi Boxer, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 20
Supporting Increment and Decrement Operations in Balancing Networks
1999 · William Aiello, Costas Busch, et al. · Lecture notes in computer science · 14
Towards a practical snapshot algorithm
2002 · Y. Riany, N. Shavit, et al. · Israel Symposium on Theory and Computing Systems (ISTCS) · 11
Timing conditions for linearizability in uniform counting networks
1999 · Nancy Lynch, Nir Shavit, et al. · Theoretical Computer Science · 9
PDF
Counting networks are practically linearizable
1996 · Nancy Lynch, Nir Shavit, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 9
PDF
Supporting Increment and Decrement Operations in Balancing Networks.
2000 · William Aiello, Costas Busch, et al. · 6
Wait-free made fast (Extended Abstract).
1995 · Yehuda Afek, Dalia Dauber, et al. · 6
ADS: A framework for running 5G radio access network in the cloud
2016 · Yoni Baehr, Eilam Ben-Dror, et al. · IEEE Conference on Standards for Communications and Networking · 4
Accelerating NFV with fast path offloading
2014 · Dan Touitou, Evelyne Roch · IEEE Consumer Communications and Networking Conference · 4
Untitled
2000 · William Aiello, Costas Busch, et al. · Chicago Journal of Theoretical Computer Science
PDF
Works count: 31
Citation count: 2,309
H-index: 14
I10-index: 15
Year
Topic
Type