{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:49:52Z","timestamp":1782971392351,"version":"3.54.5"},"reference-count":19,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4301,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1995,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Constructions of permutation arrays are presented that are optimal or nearly\u2010optimal with respect to two cost measures: the so\u2010called longest\u2010jump measure and the longest\u2010monotone\u2010greedy\u2010subsequence measure. These measures arise in the context of scheduling problems in asynchronous, shared memory, multiprocessor machines.<\/jats:p>","DOI":"10.1002\/rsa.3240060105","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T18:53:40Z","timestamp":1180205620000},"page":"39-50","source":"Crossref","is-referenced-by-count":12,"title":["Constructions of permutation arrays for certain scheduling cost measures"],"prefix":"10.1002","volume":"6","author":[{"given":"Joseph","family":"Naor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ron M.","family":"Roth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1972-002-5"},{"key":"e_1_2_1_3_2","unstructured":"Y.Afek D.Greenberg M.Merritt andG.Taubenfeld private communication (1992)."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90024-R"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.119713"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"R. J.AndersonandH. S.Woll Wait\u2010free algorithms for the union\u2010find problem Proc. 23rd ACM Symp. Theory of Computation 1991 pp.370\u2013380.","DOI":"10.1145\/103418.103458"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"Y.AumannandM. O.Rabin Fast PRAM simulation on a fully asynchronous parallel system Proc. 33rd IEEE Symp. Found. Comput. Sci. 1992 pp.147\u2013156.","DOI":"10.1109\/SFCS.1992.267777"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"M. F.BridglandandR. J.Watro Fault tolerant decision making in totally asynchronous distributed systems Proc. 6th Annual ACM Symp. Principles of Distributed Computing 1987 pp.52\u201363.","DOI":"10.1145\/41840.41845"},{"key":"e_1_2_1_9_2","unstructured":"J.BussandP.Ragde Certified write\u2010all on a strongly asynchronous PRAM manuscript (1990)."},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"C.Dwork J.Halperin andO.Waartz Performing work efficiently in the presence of faults Proc. 11th Annual ACM Symp. Principles of Distributed Computing 91\u2013102(1992).","DOI":"10.1145\/135419.135439"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","unstructured":"P.KanellakisandA.Shvartsman Efficient parallel algorithms can be made robust Proc. 8th Annual ACM Symp. Principles of Distributed Computing 1989 pp.211\u2013222.","DOI":"10.1145\/72981.72996"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","unstructured":"Z. M.Kedem K. V.Palem A.Rathunathan andP. G.Spirakis Combining tentative and definite executions for very fast dependable parallel computing Proc. 23rd ACM Symp. Theory of Computation 1991 pp.381\u2013390.","DOI":"10.1145\/103418.103459"},{"key":"e_1_2_1_14_2","doi-asserted-by":"crossref","unstructured":"Z. M.Kedem K. V.Palem M. O.Rabin andA.Raghunathan Efficient program transformations for resilient parallel computation via randomization. Proc. 24th ACM Symp. Theory of Computation 1992 pp.306\u2013317.","DOI":"10.1145\/129712.129742"},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"Z. M.Kedem K. V.Palem andP. G.Spirakis Efficient robust parallel computations Proc. 22nd ACM Symp. Theory of Computation 1990 pp.138\u2013148.","DOI":"10.1145\/100216.100231"},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"A.Lubotzky R.Phillips andP.Sarnak Explicit expanders and the Ramanujan conjecture Proc. 18th Annual ACM Symp. Theory of Computation 1986pp.240\u2013246[see also:","DOI":"10.1145\/12130.12154"},{"key":"e_1_2_1_16_3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"},{"key":"e_1_2_1_17_2","article-title":"Explicit group\u2010theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators","volume":"24","author":"Margulis G. A.","year":"1988","journal-title":"Probab. Inf. Trans."},{"key":"e_1_2_1_18_2","doi-asserted-by":"crossref","unstructured":"C.Martel R.Subramonian andA.Park Asynchronous PRAMs are (almost) as good as synchronous PRAMs Proc. 31st IEEE Svmp. Foundations of Computer Science 1990pp.590\u2013599.","DOI":"10.1109\/FSCS.1990.89580"},{"key":"e_1_2_1_19_2","first-page":"3","article-title":"An estimate of the complexity of constructing binary linear cascade codes","volume":"7","author":"Zyablov V. V.","year":"1971","journal-title":"Probab. Inf. Trans."}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240060105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240060105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:21:33Z","timestamp":1737051693000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240060105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["10.1002\/rsa.3240060105"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240060105","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}