{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:25Z","timestamp":1725662905840},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_36","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:03:25Z","timestamp":1330193005000},"page":"391-402","source":"Crossref","is-referenced-by-count":2,"title":["Probabilistic bidding gives optimal distributed resource allocation"],"prefix":"10.1007","author":[{"given":"John","family":"Reif","sequence":"first","affiliation":[]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"issue":"4","key":"36_CR1","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/357146.357149","volume":"3","author":"G. Andrews","year":"1981","unstructured":"Andrews, G., \"Synchronizing Resources,\" ACM Trans. on Programming Languages and Systems, 3(4), 405\u2013430 (1981).","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D., \"Local and Global Properties in Networks of Processors,\" 12th Annual Symp. on Theory of Computing, Los Angeles, CA, 82\u201393 (April 1980).","DOI":"10.1145\/800141.804655"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Arjomandi, E., M. Fischer, and N. Lynch, \"A Difference in Efficiency Between Synchronous and Asynchronous Systems,\" 13th Ann. Symp. on Theory of Computing, (April 1981).","DOI":"10.21236\/ADA097476"},{"issue":"2","key":"36_CR4","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/357094.357101","volume":"2","author":"A. J. Bernstein","year":"1980","unstructured":"Bernstein, A.J., \"Output Guards and Nondeterminism in Communicating Sequential Processes,\" ACM Trans. on Programming Languages and Systems, 2(2), 234\u2013238 (1980).","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, P. and N. Goodman, \"Fundamental Algorithms for Concurrency Control in Distributed Database Systems,\" CCA Tr. Contract No. F30603-79-0191, Cambridge, MA (1980).","DOI":"10.21236\/ADA087996"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Dennis, J.B. and D.P. Misunas, \"A Preliminary Architecture for a Basic Dataflow Processors,\" Proc. 2nd Annual Symp. on Computer Architecture, ACM IEEE, 126\u2013132 (1974).","DOI":"10.1145\/641675.642111"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Fisher, M.J., N.A. Lynch, J.E. Burns, and A. Borodin, \"Resource Allocation with Immunity to Limited Process Failure,\" 19th FOCS, 234\u2013254 (1979).","DOI":"10.1109\/SFCS.1979.37"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Francez, N., \"Extended Naming Conventions for Communicating Processes,\" 9th ACM Symp. on Principles of Programming Languages, Albuquerque, New Mexico, (Jan. 1982).","DOI":"10.1145\/582153.582158"},{"key":"36_CR9","unstructured":"Francez, N. and J. Reif, \"A Social CSP,\" to appear."},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Francez, N. and Rodeh, \"A Distributed Data Type Implemented by a Probabilistic Communication Scheme,\" 21 Ann. Symp. on Foundations of Computer Science, Syracuse, New York, 373\u2013379 (Oct. 1980).","DOI":"10.1109\/SFCS.1980.2"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Hart, S. and M. Sharir, \"Termination of Probabilistic Concurrent Programs,\" 9th Ann. SCM Symp. on Principles of Programming Languages, Albuquerque, New Mexico, (Jan. 1982).","DOI":"10.1145\/582153.582154"},{"issue":"8","key":"36_CR12","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C. A. R. R. Hoare","year":"1978","unstructured":"Hoare, C.A.R., \"Communicating Sequential Processes,\" Com. of ACM, 21 (8), 666\u2013677 (1978).","journal-title":"Com. of ACM"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Itai, A. and M. Rodeh, \"Symmetry Breaking in Distributive Networks,\" 22nd Annual Symp. on Foundations of Computer Science, Nashville, Tennessee, Oct. 1981, 120\u2013158.","DOI":"10.1109\/SFCS.1981.41"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Lehmann, D. and M. Rabin, \"On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers' Problem,\" to appear in 8th ACM Symp. on Principles of Programming Languages, (Jan. 1981).","DOI":"10.1145\/567532.567547"},{"key":"36_CR15","unstructured":"Lipton, R. and F.G. Sayward, \"Response Time of Parallel Programs,\" Research Report #108, Dept. of Comp. Science, Yale University, (June 1977)."},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Lynch, M.A., \"Fast Allocation of Nearby Resources in a Distributed System,\" 12th Ann. Symp. in Theory of Computing, Los Angeles, CA, 70\u201381 (April 1980).","DOI":"10.1145\/800141.804654"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Rabin, M., \"N-Process Synchronization by a 4 Log2M-Valued Shared Variable,\" 21st Ann. Symp. on Foundations of Comp. Science, Syracuse, NY, 407\u2013410 (Oct. 1980).","DOI":"10.1109\/SFCS.1980.26"},{"key":"36_CR18","volume-title":"The Choice Coordination Problem","author":"N. Rabin","year":"1980","unstructured":"Rabin, N., \"The Choice Coordination Problem,\" Mem. No. UCB\/ERL MBO\/38, Electric. Research Laboratory, University of California, Berkeley, (Aug. 1980)."},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"Reif, J.H. and P. Spirakis, \"Distributed Algorithms for Synchronizing Interprocess Communication Within Real Time,\" 13th Ann. Sym. on Theory of Computation, Wisconsin, 133\u2013145 (1981); also as \"Real-Time Synchronization of Interprocess Communications,\" to appear in Transactions on Programming Languages, 1984.","DOI":"10.1145\/800076.802467"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Reif, J.H. and P. Spirakis, \"Unbounded Speed Variability in Distributed Communications Systems,\" 9th ACM Symp. on Principles of Programming Languages, Albuquerque, New Mexico (1982a), also to appear in SIAM Journal of Computing, 1984.","DOI":"10.1145\/582153.582159"},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Reif, J.H. and P. Spirakis, \"Real Time Resource Allocation in Distributed Systems,\" ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, ottawa, Canada, (Aug. 1982b).","DOI":"10.1145\/800220.806685"},{"key":"36_CR22","unstructured":"Schwarz, J., \"Distributed Synchronization of Communicating Sequential Processes,\" DAI Research Report No. 56, University of Edinburg, (1980)."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T01:28:47Z","timestamp":1640914127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}