{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:59:12Z","timestamp":1725569952603},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291633"},{"type":"electronic","value":"9783540320753"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561927_5","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T10:14:47Z","timestamp":1128939287000},"page":"33-47","source":"Crossref","is-referenced-by-count":8,"title":["On Conspiracies and Hyperfairness in Distributed Computing"],"prefix":"10.1007","author":[{"given":"Hagen","family":"V\u00f6lzer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF02242712","volume":"6","author":"P.C. Attie","year":"1993","unstructured":"Attie, P.C., Francez, N., Grumberg, O.: Fairness and hyperfairness in multi-party interactions. Distributed Computing\u00a06, 245\u2013254 (1993)","journal-title":"Distributed Computing"},{"key":"5_CR2","first-page":"27","volume-title":"Proc. 2nd PODC","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proc. 2nd PODC, pp. 27\u201330. ACM, New York (1983)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Best, E.: Fairness and conspiracies. In: IPL, vol. 18, pp. 215\u2013220 (1984) Erratum ibidem 19:162","DOI":"10.1016\/0020-0190(84)90114-5"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"key":"5_CR5","volume-title":"Parallel Program Design: A Foundation","author":"K.M. Chandy","year":"1988","unstructured":"Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley, Reading (1988)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E.W. Dijkstra","year":"1971","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Inf.\u00a01, 115\u2013138 (1971)","journal-title":"Acta Inf."},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of the ACM"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/BF01211476","volume":"4","author":"N. Francez","year":"1992","unstructured":"Francez, N., Back, R.-J.J., Kurki-Suonio, R.: On equivalence-completions of fairness assumptions. Formal Aspects of Computing\u00a04, 582\u2013591 (1992)","journal-title":"Formal Aspects of Computing"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"11","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM ToPLaS\u00a011(1), 124\u2013149 (1991)","journal-title":"ACM ToPLaS"},{"issue":"1-2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0304-3975(98)00224-2","volume":"243","author":"Y.-J. Joung","year":"2000","unstructured":"Joung, Y.-J.: Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability. Theor. Comput. Sci.\u00a0243(1-2), 307\u2013338 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2000.3014","volume":"166","author":"Y.-J. Joung","year":"2001","unstructured":"Joung, Y.-J.: On fairness notions in distributed systems, part I: A characterization of implementability. Information and Computation\u00a0166, 1\u201334 (2001)","journal-title":"Information and Computation"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/inco.2000.3015","volume":"166","author":"Y.-J. Joung","year":"2001","unstructured":"Joung, Y.-J.: On fairness notions in distributed systems, part II: Equivalence-completions and their hierarchies. Information and Computation\u00a0166, 35\u201360 (2001)","journal-title":"Information and Computation"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BFb0022469","volume-title":"Semantics of Concurrent Computation","author":"Y. Kwong","year":"1979","unstructured":"Kwong, Y.: On the absence of livelocks in parallel programs. In: Kahn, G. (ed.) Semantics of Concurrent Computation. LNCS, vol.\u00a070, pp. 172\u2013190. Springer, Heidelberg (1979)"},{"issue":"7","key":"5_CR15","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM\u00a021(7), 558\u2013565 (1978)","journal-title":"Communications of the ACM"},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/PL00008921","volume":"13","author":"L. Lamport","year":"2000","unstructured":"Lamport, L.: Fairness and hyperfairness. Distributed Computing\u00a013(4), 239\u2013245 (2000)","journal-title":"Distributed Computing"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Logics of Programs","author":"O. Lichtenstein","year":"1985","unstructured":"Lichtenstein, O., Pnueli, A., Zuck, L.: The glory of the past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.\u00a0193. Springer, Heidelberg (1985)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Petri Nets 1987","author":"A. Merceron","year":"1987","unstructured":"Merceron, A.: Fair processes. In: Rozenberg, G. (ed.) APN 1987. LNCS, vol.\u00a0266. Springer, Heidelberg (1987)"},{"key":"5_CR19","first-page":"278","volume-title":"Proc. 15th STOC","author":"A. Pnueli","year":"1983","unstructured":"Pnueli, A.: On the extremely fair treatment of probabilistic algorithms. In: Proc. 15th STOC, pp. 278\u2013290. ACM, New York (1983)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"V\u00f6lzer, H.: A constructive proof for FLP. In: IPL, vol.\u00a092, pp. 83\u201387 (2004)","DOI":"10.1016\/j.ipl.2004.06.008"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1007\/978-3-540-27836-8_100","volume-title":"Automata, Languages and Programming","author":"H. V\u00f6lzer","year":"2004","unstructured":"V\u00f6lzer, H.: On randomization versus synchronization in distributed systems. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1214\u20131226. Springer, Heidelberg (2004)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"V\u00f6lzer, H.: On conspiracies and hyperfairness in distributed computing. SIIM Technical Report SIIM-TR-A-05-20, Universit\u00e4t zu L\u00fcbeck (2005)","DOI":"10.1007\/11561927_5"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561927_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:10:23Z","timestamp":1558293023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561927_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291633","9783540320753"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11561927_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}