{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T21:47:53Z","timestamp":1764193673213},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_33","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T10:43:16Z","timestamp":1133779396000},"page":"408-419","source":"Crossref","is-referenced-by-count":14,"title":["Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks"],"prefix":"10.1007","author":[{"given":"Prasad","family":"Jayanti","sequence":"first","affiliation":[]},{"given":"Srdjan","family":"Petrovic","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"David, M.: A single-enqueuer wait-free queue implementation. In: Proceedings of the 18th International Conference on Distributed Computing, pp. 132\u2013143 (2004)","DOI":"10.1007\/978-3-540-30186-8_10"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM TOPLAS\u00a013, 124\u2013149 (1991)","journal-title":"ACM TOPLAS"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1145\/161468.161469","volume":"15","author":"M. Herlihy","year":"1993","unstructured":"Herlihy, M.: A methodology for implementing highly concurrent data structures. ACM Transactions on Programming Languages and Systems\u00a015, 745\u2013770 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: A lower bound on the local time complexity of universal constructions. In: Proceedings of the 17th Annual Symposium on Principles of Distributed Computing (1998)","DOI":"10.1145\/277697.277731"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Chandra, T., Jayanti, P., Tan, K.Y.: A polylog time wait-free construction for closed objects. In: Proceedings of the 17th Annual Symposium on Principles of Distributed Computing (1998)","DOI":"10.1145\/277697.277753"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: f-arrays: implementation and applications. In: Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, pp. 270\u2013279 (2002)","DOI":"10.1145\/571825.571875"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Anderson, J., Moir, M.: Universal constructions for large objects. In: Proceedings of the 9th International Workshop on Distributed Algorithms, pp. 168\u2013182 (1995)","DOI":"10.1007\/BFb0022146"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Petrovic, S.: Efficient and practical constructions of LL\/SC variables. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (2003)","DOI":"10.1145\/872035.872078"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Moir, M.: Practical implementations of non-blocking synchronization primitives. In: Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pp. 219\u2013228 (1997)","DOI":"10.1145\/259380.259442"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Afek, Y., Weisberger, E., Weisman, H.: A completeness theorem for a class of synchronization objects. In: Proceedings of the 12th Annual Symposium on Principles of Distributed Computing, pp. 159\u2013170 (1993)","DOI":"10.1145\/164051.164071"},{"key":"33_CR11","unstructured":"Li, Z.: Non-blocking implementation of queues in asynchronous distributed sharedmemory systems. Master\u2019s thesis, University of Toronto (2001)"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/69624.357207","volume":"5","author":"L. Lamport","year":"1983","unstructured":"Lamport, L.: Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems\u00a05, 190\u2013222 (1983)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Michael, M., Scott, M.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pp. 267\u2013276 (1996)","DOI":"10.1145\/248052.248106"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Afek, Y., Dauber, D., Touitou, D.: Wait-free made fast. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 538\u2013547 (1995)","DOI":"10.1145\/225058.225271"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Michael, M., Scott, M.: Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. Journal of Parallel and Distributed Computing, 1\u201326 (1998)","DOI":"10.1006\/jpdc.1998.1446"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.: Linearizability: A correctness condition for concurrent objects. ACM TOPLAS\u00a012, 463\u2013492 (1990)","journal-title":"ACM TOPLAS"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:49:13Z","timestamp":1619491753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11590156_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}