{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:56:27Z","timestamp":1725476187282},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387362328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-36503-9_21","type":"book-chapter","created":{"date-parts":[[2007,1,10]],"date-time":"2007-01-10T06:47:50Z","timestamp":1168411670000},"page":"227-236","source":"Crossref","is-referenced-by-count":1,"title":["An Average Length of Computations of Normalized Probabilistic Algorithms"],"prefix":"10.1007","author":[{"given":"Joanna","family":"Karbowska-Chili\u0144ska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Borowska A., Da\u0144ko W., Karbowska-Chili\u0144ska J.: Probabilistic Algorithms as a Tool for Modelling Stochastic Processes, Proceedings of the conference CISIM 2004, 14\u201316 June, 2004, E\u0142k, Poland."},{"issue":"3\u20144","key":"21_CR2","doi-asserted-by":"crossref","first-page":"417","DOI":"10.3233\/FI-1993-193-411","volume":"19","author":"W. Da\u0144ko","year":"1993","unstructured":"Da\u0144ko W.: The Set of Probabilistic Algorithmic Formulas Valid in a Finite Structure is Decidable with Respect to its Diagram, Fundamenta Informaticae, vol. 19(3\u20144), pp. 417\u2013431, 1993.","journal-title":"Fundamenta Informaticae"},{"key":"21_CR3","volume-title":"An Introduction to Probability Theory","author":"W. Feller","year":"1977","unstructured":"Feller W.: An Introduction to Probability Theory, PWN, Warsaw 1977."},{"key":"21_CR4","volume-title":"Finite Markov Processes and Their Applications","author":"M. Iosifescu","year":"1988","unstructured":"Iosifescu M.: Finite Markov Processes and Their Applications, John Wiley & Sons, New York, London 1988."},{"key":"21_CR5","unstructured":"Karbowska-Chili\u0144ska J.: An Average Length of Computations of Probabilistic Algorithm of the Basis of the Theorem of Normal Form of Programs, Proceedings of the conference CISIM 2005, 30.VI\u20133.VII, 2005, E\u0142k, Poland."},{"key":"21_CR6","volume-title":"The Methods for Verification Properties of Probabilistic Programs","author":"J. Koszelew","year":"2000","unstructured":"Koszelew J.: The Methods for Verification Properties of Probabilistic Programs, Ph. D. thesis IPI PAN Warsaw, 2000."},{"key":"21_CR7","volume-title":"Algorithmic Logic","author":"G. Mirkowska","year":"1987","unstructured":"Mirkowska G., Salwicki A.: Algorithmic Logic, D. Reidel Publ. Co. & PWN Warsaw, 1987."},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M. Matsumoto","year":"1998","unstructured":"Matsumoto M., Nishimura T.: Mersenne Twister: A 623-dimensionally Equidistributed Uniform Pseudorandom Number Generator, ACM Trans. on Modeling and Computer Simulation Vol. 8, No. 1, January 1998, p.3\u201330.","journal-title":"ACM Trans. on Modeling and Computer Simulation"},{"key":"21_CR9","unstructured":"Stapp L.: The Normal Form Theorem for Probabilistic Programs, University of Warsaw, 1979 (not public manuscript)."}],"container-title":["Biometrics, Computer Security Systems and Artificial Intelligence Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-36503-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,7]],"date-time":"2021-08-07T12:38:32Z","timestamp":1628339912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-36503-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387362328"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-36503-9_21","relation":{},"subject":[]}}