{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T18:23:25Z","timestamp":1740162205147,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s13389-017-0153-x","type":"journal-article","created":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T02:34:14Z","timestamp":1488335654000},"page":"85-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Regulating the pace of von Neumann correctors"],"prefix":"10.1007","volume":"8","author":[{"given":"Houda","family":"Ferradi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8719-1724","authenticated-orcid":false,"given":"R\u00e9mi","family":"G\u00e9raud","sequence":"additional","affiliation":[]},{"given":"Diana","family":"Maimu\u0163","sequence":"additional","affiliation":[]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[]},{"given":"Amaury","family":"de Wargny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,1]]},"reference":[{"key":"153_CR1","volume-title":"Analysis of Queueing Networks with Blocking","author":"S Balsamo","year":"2013","unstructured":"Balsamo, S., de Nitto Person\u00e9, V., Onvural, R.: Analysis of Queueing Networks with Blocking, vol. 31. Springer, Berlin (2013)"},{"issue":"3","key":"153_CR2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10845-012-0687-9","volume":"25","author":"L Demir","year":"2014","unstructured":"Demir, L., Tunali, S., Eliiyi, D.T.: The state of the art on buffer allocation problem: a comprehensive survey. J. Intell. Manuf. 25(3), 371\u2013392 (2014)","journal-title":"J. Intell. Manuf."},{"key":"153_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-39889-9","volume-title":"Big Queues","author":"AJ Ganesh","year":"2004","unstructured":"Ganesh, A.J., O\u2019Connell, N., Wischik, D.J.: Big Queues. Springer, Berlin (2004)"},{"key":"153_CR4","unstructured":"Kendall, D.G.: Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. Ann. Math. Stat. 23(3), 338\u2013354 (1953)"},{"key":"153_CR5","first-page":"73","volume":"39","author":"A Khinchine","year":"1932","unstructured":"Khinchine, A.: Mathematical theory of a stationary queue. Mat. Sb. 39, 73\u201384 (1932)","journal-title":"Mat. Sb."},{"key":"153_CR6","volume-title":"Queuing Systems","author":"L Kleinrock","year":"1975","unstructured":"Kleinrock, L.: Queuing Systems, vol. 1. Wiley, New York (1975)"},{"issue":"3","key":"153_CR7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/opre.9.3.383","volume":"9","author":"JD Little","year":"1961","unstructured":"Little, J.D.: A proof for the queuing formula: \n                        $$l= \\lambda w$$\n                        \n                            \n                                \n                                    l\n                                    =\n                                    \u03bb\n                                    w\n                                \n                            \n                        \n                    . Oper. Res. 9(3), 383\u2013387 (1961)","journal-title":"Oper. Res."},{"issue":"4","key":"153_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1080\/07408170590916986","volume":"37","author":"J MacGregor Smith","year":"2005","unstructured":"MacGregor Smith, J., Cruz, F.: The buffer allocation problem for general finite buffer queueing networks. IIE Trans. 37(4), 343\u2013365 (2005)","journal-title":"IIE Trans."},{"issue":"2","key":"153_CR9","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.ijpe.2006.02.011","volume":"103","author":"N Nahas","year":"2006","unstructured":"Nahas, N., Ait-Kadi, D., Nourelfath, M.: A new approach for buffer allocation in unreliable production lines. Int. J. Prod. Econ. 103(2), 873\u2013881 (2006)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"153_CR10","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/BF01194620","volume":"32","author":"F Pollaczek","year":"1930","unstructured":"Pollaczek, F.: \u00dcber eine aufgabe der wahrscheinlichkeitstheorie. I. Math. Z. 32(1), 64\u2013100 (1930)","journal-title":"Math. Z."},{"issue":"1","key":"153_CR11","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/BF01194663","volume":"32","author":"F Pollaczek","year":"1930","unstructured":"Pollaczek, F.: \u00dcber eine aufgabe der wahrscheinlichkeitstheorie. II. Math. Z. 32(1), 729\u2013750 (1930)","journal-title":"Math. Z."},{"issue":"7","key":"153_CR12","doi-asserted-by":"crossref","first-page":"1989","DOI":"10.1080\/00207549508904794","volume":"33","author":"D Seong","year":"1995","unstructured":"Seong, D., Chang, S., Hong, Y.: Heuristic algorithms for buffer allocation in a production line with unreliable machines. Int. J. Prod. Res. 33(7), 1989\u20132005 (1995)","journal-title":"Int. J. Prod. Res."},{"issue":"1\u20134","key":"153_CR13","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1023\/A:1018984125703","volume":"93","author":"DD Spinellis","year":"2000","unstructured":"Spinellis, D.D., Papadopoulos, C.T.: A simulated annealing approach for buffer allocation in reliable production lines. Ann. Oper. Res. 93(1\u20134), 373\u2013384 (2000)","journal-title":"Ann. Oper. Res."},{"key":"153_CR14","first-page":"36","volume":"12","author":"J Neumann von","year":"1951","unstructured":"von Neumann, J.: Various techniques used in connection with random digits. Natl. Bur. Stand. Appl. Math. Ser. 12, 36\u201338 (1951)","journal-title":"Natl. Bur. Stand. Appl. Math. Ser."}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-017-0153-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-017-0153-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-017-0153-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T10:19:31Z","timestamp":1521800371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-017-0153-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["153"],"URL":"https:\/\/doi.org\/10.1007\/s13389-017-0153-x","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"type":"print","value":"2190-8508"},{"type":"electronic","value":"2190-8516"}],"subject":[],"published":{"date-parts":[[2017,3,1]]}}}