{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T20:28:49Z","timestamp":1714076929479},"reference-count":15,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Algorithms and Applications"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1080\/10637199308915449","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T02:50:54Z","timestamp":1183776654000},"page":"303-314","source":"Crossref","is-referenced-by-count":5,"title":["ON THE EXPECTED EXECUTION TIME FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS MAPPED ONTO 1D REGULAR ARRAYS"],"prefix":"10.1080","volume":"1","author":[{"given":"VASSIL","family":"ALEKSANDROV","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"STEFKA","family":"FIDANOVA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","volume-title":"A Linear Systolic Array for the Knapsack Problem","author":"Andonov R. A.","year":"1991"},{"key":"CIT0002","author":"Andonov R.","year":"1992","journal-title":"Publ. Interne N0639"},{"key":"CIT0003","unstructured":"R. Andonov , V. Aleksandrov and A. Benaini , A fixed size modular systolic array for the knapsack problem , Universite de Franche Comte , RRN05\u201391 , Besancon , France ."},{"key":"CIT0004","volume-title":"Algorithms and Parallel VLSI Architectures II","author":"Andonov R.","year":"1991"},{"key":"CIT0005","volume-title":"ASAP'91","author":"Andonov R.","year":"1991"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(90)90124-R"},{"key":"CIT0007","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"1990"},{"key":"CIT0008","first-page":"7","volume":"1","author":"Djidjcv H. N.","year":"1988","journal-title":"J. New Gener, Comput. Syst."},{"key":"CIT0009","volume-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","author":"Garcy M.","year":"1979"},{"key":"CIT0010","volume-title":"Integer Programming","author":"Garfinkcl R.","year":"1972"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(88)90007-X"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(91)90080-S"},{"key":"CIT0013","volume-title":"Knapsack Problems Algorithms and Computer Implementation","author":"Martcllo S.","year":"1990"},{"key":"CIT0014","volume-title":"Proc. of Workshop on Parallel Algorithms","author":"Mcgson G. M.","year":"1992"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1007\/BF02477176"}],"container-title":["Parallel Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10637199308915449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,16]],"date-time":"2016-12-16T21:12:23Z","timestamp":1481922743000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/10637199308915449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["10.1080\/10637199308915449"],"URL":"https:\/\/doi.org\/10.1080\/10637199308915449","relation":{},"ISSN":["1063-7192"],"issn-type":[{"value":"1063-7192","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}