Cook, Victor; Peterson, Christina; Painter, Zachary; Dechev, Damian Quantifiability: a concurrent correctness condition modeled in vector space. (English) Zbl 1519.68157 Computing 105, No. 5, 955-978 (2023). MSC: 68Q85 68M07 PDFBibTeX XMLCite \textit{V. Cook} et al., Computing 105, No. 5, 955--978 (2023; Zbl 1519.68157) Full Text: DOI arXiv
Baig, Mirza Ahad; Hendler, Danny; Milani, Alessia; Travers, Corentin Long-lived counters with polylogarithmic amortized step complexity. (English) Zbl 07662946 Distrib. Comput. 36, No. 1, 29-43 (2023). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{M. A. Baig} et al., Distrib. Comput. 36, No. 1, 29--43 (2023; Zbl 07662946) Full Text: DOI
Peterson, Christina; Cook, Victor; Dechev, Damian Concurrent correctness in vector space. (English) Zbl 1472.68092 Henglein, Fritz (ed.) et al., Verification, model checking, and abstract interpretation. 22nd international conference, VMCAI 2021, Copenhagen, Denmark, January 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12597, 151-173 (2021). MSC: 68Q60 68N19 68Q85 PDFBibTeX XMLCite \textit{C. Peterson} et al., Lect. Notes Comput. Sci. 12597, 151--173 (2021; Zbl 1472.68092) Full Text: DOI
Almeida, Paulo Sérgio; Baquero, Carlos Scalable eventually consistent counters over unreliable networks. (English) Zbl 1451.68034 Distrib. Comput. 32, No. 1, 69-89 (2019). MSC: 68M14 68M15 68R10 PDFBibTeX XMLCite \textit{P. S. Almeida} and \textit{C. Baquero}, Distrib. Comput. 32, No. 1, 69--89 (2019; Zbl 1451.68034) Full Text: DOI arXiv Link
Dongol, Brijesh; Hierons, Robert M. Decidability and complexity for quiescent consistency and its variations. (English) Zbl 1380.68294 Inf. Comput. 257, 1-21 (2017). MSC: 68Q85 68Q17 68Q25 68Q60 PDFBibTeX XMLCite \textit{B. Dongol} and \textit{R. M. Hierons}, Inf. Comput. 257, 1--21 (2017; Zbl 1380.68294) Full Text: DOI
Akbari, Hoda; Berenbrink, Petra; Sauerwald, Thomas A simple approach for adapting continuous load balancing processes to discrete settings. (English) Zbl 1356.68015 Distrib. Comput. 29, No. 2, 143-161 (2016). MSC: 68M14 68W15 68W20 PDFBibTeX XMLCite \textit{H. Akbari} et al., Distrib. Comput. 29, No. 2, 143--161 (2016; Zbl 1356.68015) Full Text: DOI Link
Derrick, John; Smith, Graeme A framework for correctness criteria on weak memory models. (English) Zbl 1427.68166 Bjørner, Nikolaj (ed.) et al., FM 2015: formal methods. 20th international symposium, Oslo, Norway, June 24–26, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9109, 178-194 (2015). MSC: 68Q60 68Q55 PDFBibTeX XMLCite \textit{J. Derrick} and \textit{G. Smith}, Lect. Notes Comput. Sci. 9109, 178--194 (2015; Zbl 1427.68166) Full Text: DOI
Alistarh, Dan; Aspnes, James; Censor-Hillel, Keren; Gilbert, Seth; Guerraoui, Rachid Tight bounds for asynchronous renaming. (English) Zbl 1295.68118 J. ACM 61, No. 3, Article No. 18, 51 p. (2014). MSC: 68Q17 68M15 68P05 68Q85 68W40 PDFBibTeX XMLCite \textit{D. Alistarh} et al., J. ACM 61, No. 3, Article No. 18, 51 p. (2014; Zbl 1295.68118) Full Text: DOI
Friedrich, Tobias; Sauerwald, Thomas; Vilenchik, Dan Smoothed analysis of balancing networks. (English) Zbl 1223.68019 Random Struct. Algorithms 39, No. 1, 115-138 (2011). MSC: 68M14 68M07 68R10 PDFBibTeX XMLCite \textit{T. Friedrich} et al., Random Struct. Algorithms 39, No. 1, 115--138 (2011; Zbl 1223.68019) Full Text: DOI arXiv
Busch, Costas; Tirthapura, Srikanta Concurrent counting is harder than queuing. (English) Zbl 1205.68503 Theor. Comput. Sci. 411, No. 43, 3823-3833 (2010). MSC: 68W15 68P05 PDFBibTeX XMLCite \textit{C. Busch} and \textit{S. Tirthapura}, Theor. Comput. Sci. 411, No. 43, 3823--3833 (2010; Zbl 1205.68503) Full Text: DOI
Mavronicolas, Marios; Sauerwald, Thomas The impact of randomization in smoothing networks. (English) Zbl 1231.68086 Distrib. Comput. 22, No. 5-6, 381-411 (2010). MSC: 68M14 68P05 68Q17 68Q87 PDFBibTeX XMLCite \textit{M. Mavronicolas} and \textit{T. Sauerwald}, Distrib. Comput. 22, No. 5--6, 381--411 (2010; Zbl 1231.68086) Full Text: DOI
Busch, Costas; Mavronicolas, Marios An efficient counting network. (English) Zbl 1196.68019 Theor. Comput. Sci. 411, No. 34-36, 3001-3030 (2010). MSC: 68M10 68M14 68P05 PDFBibTeX XMLCite \textit{C. Busch} and \textit{M. Mavronicolas}, Theor. Comput. Sci. 411, No. 34--36, 3001--3030 (2010; Zbl 1196.68019) Full Text: DOI
Hendler, Danny; Kutten, Shay Bounded-wait combining: constructing robust and high-throughput shared objects. (English) Zbl 1267.68309 Distrib. Comput. 21, No. 6, 405-431 (2009). MSC: 68W15 PDFBibTeX XMLCite \textit{D. Hendler} and \textit{S. Kutten}, Distrib. Comput. 21, No. 6, 405--431 (2009; Zbl 1267.68309) Full Text: DOI Link
Mavronicolas, Marios; Merritt, Michael; Taubenfeld, Gadi Sequentially consistent versus linearizable counting networks. (English) Zbl 1267.68062 Distrib. Comput. 21, No. 4, 249-269 (2008). MSC: 68M14 PDFBibTeX XMLCite \textit{M. Mavronicolas} et al., Distrib. Comput. 21, No. 4, 249--269 (2008; Zbl 1267.68062) Full Text: DOI
Hendler, Danny; Shavit, Nir Solo-valency and the cost of coordination. (English) Zbl 1267.68036 Distrib. Comput. 21, No. 1, 43-54 (2008). MSC: 68M10 68M14 PDFBibTeX XMLCite \textit{D. Hendler} and \textit{N. Shavit}, Distrib. Comput. 21, No. 1, 43--54 (2008; Zbl 1267.68036) Full Text: DOI
Kashyap, Akshay; Başar, Tamer; Srikant, R. Quantized consensus. (English) Zbl 1123.93090 Automatica 43, No. 7, 1192-1203 (2007). MSC: 93E25 68R10 93E03 PDFBibTeX XMLCite \textit{A. Kashyap} et al., Automatica 43, No. 7, 1192--1203 (2007; Zbl 1123.93090) Full Text: DOI
Herlihy, Maurice; Tirthapura, Srikanta Self-stabilizing smoothing and balancing networks. (English) Zbl 1266.68056 Distrib. Comput. 18, No. 5, 345-357 (2006). MSC: 68M14 68Q17 PDFBibTeX XMLCite \textit{M. Herlihy} and \textit{S. Tirthapura}, Distrib. Comput. 18, No. 5, 345--357 (2006; Zbl 1266.68056) Full Text: DOI
Busch, Costas; Mavronicolas, Marios; Spirakis, Paul The cost of concurrent, low-contention Read & Modify & Write. (English) Zbl 1070.68013 Theor. Comput. Sci. 333, No. 3, 373-400 (2005). MSC: 68M14 PDFBibTeX XMLCite \textit{C. Busch} et al., Theor. Comput. Sci. 333, No. 3, 373--400 (2005; Zbl 1070.68013) Full Text: DOI
Fatourou, Panagiota; Herlihy, Maurice Read-modify-write networks. (English) Zbl 1448.68224 Distrib. Comput. 17, No. 1, 33-46 (2004). MSC: 68P05 PDFBibTeX XMLCite \textit{P. Fatourou} and \textit{M. Herlihy}, Distrib. Comput. 17, No. 1, 33--46 (2004; Zbl 1448.68224) Full Text: DOI
Brit, Hagit; Moran, Shlomo; Taubenfeld, Gadi Public data structures: counters as a special case. (English) Zbl 1061.68034 Theor. Comput. Sci. 289, No. 1, 401-423 (2002). MSC: 68P05 PDFBibTeX XMLCite \textit{H. Brit} et al., Theor. Comput. Sci. 289, No. 1, 401--423 (2002; Zbl 1061.68034) Full Text: DOI
Busch, Costas; Demetriou, Neophytos; Herlihy, Maurice; Mavronicolas, Marios Threshold counters with increments and decrements. (English) Zbl 0988.68076 Theor. Comput. Sci. 270, No. 1-2, 811-826 (2002). MSC: 68Q10 68P05 PDFBibTeX XMLCite \textit{C. Busch} et al., Theor. Comput. Sci. 270, No. 1--2, 811--826 (2002; Zbl 0988.68076) Full Text: DOI
Riany, Yaron; Shavit, Nir; Touitou, Dan Towards a practical snapshot algorithm. (English) Zbl 0983.68240 Theor. Comput. Sci. 269, No. 1-2, 163-201 (2001). MSC: 68W05 PDFBibTeX XMLCite \textit{Y. Riany} et al., Theor. Comput. Sci. 269, No. 1--2, 163--201 (2001; Zbl 0983.68240) Full Text: DOI
Shavit, Nir; Touitou, Dan Software transactional memory. (English) Zbl 1448.68214 Distrib. Comput. 10, No. 2, 99-116 (1997). MSC: 68N19 68M14 PDFBibTeX XMLCite \textit{N. Shavit} and \textit{D. Touitou}, Distrib. Comput. 10, No. 2, 99--116 (1997; Zbl 1448.68214) Full Text: DOI
Busch, Costas; Mavronicolas, Marios Impossibility results for weak threshold networks. (English) Zbl 1337.68106 Inf. Process. Lett. 63, No. 2, 85-90 (1997). MSC: 68Q10 PDFBibTeX XMLCite \textit{C. Busch} and \textit{M. Mavronicolas}, Inf. Process. Lett. 63, No. 2, 85--90 (1997; Zbl 1337.68106) Full Text: DOI
Herlihy, Maurice; Shavit, Nir; Waarts, Orli Linearizable counting networks. (English) Zbl 1448.68226 Distrib. Comput. 9, No. 4, 193-203 (1996). MSC: 68P05 68M14 68W15 PDFBibTeX XMLCite \textit{M. Herlihy} et al., Distrib. Comput. 9, No. 4, 193--203 (1996; Zbl 1448.68226) Full Text: DOI
Aharonson, Eran; Attiya, Hagit Counting networks with arbitrary fan-out. (English) Zbl 1448.68058 Distrib. Comput. 8, No. 4, 163-169 (1995). MSC: 68M14 68M10 68M20 PDFBibTeX XMLCite \textit{E. Aharonson} and \textit{H. Attiya}, Distrib. Comput. 8, No. 4, 163--169 (1995; Zbl 1448.68058) Full Text: DOI