{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T12:18:13Z","timestamp":1772367493844,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1007\/bf02242022","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T01:22:32Z","timestamp":1132017752000},"page":"51-67","source":"Crossref","is-referenced-by-count":2,"title":["Uniform random generation of expressions respecting algebraic identities","Uniforme Zufallserzeugung von Ausdr\u00fccken unter Beachtung algebraischer Identit\u00e4ten"],"prefix":"10.1007","volume":"47","author":[{"given":"W. J.","family":"Gutjahr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02242022_CR1","first-page":"263","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1978","unstructured":"Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms, p. 263. Reading, MA: Addison-Wesley 1978."},{"key":"BF02242022_CR2","first-page":"80","volume-title":"Data structures and algorithms","author":"A. V. Aho","year":"1983","unstructured":"Aho, A. V., Hopcroft, J. E., Ullman, J. D.: Data structures and algorithms, pp. 80\u201381, Reading, MA: Addison-Wesley 1983."},{"key":"BF02242022_CR3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/978-1-4613-8643-8","volume-title":"Non-uniform random variate generation","author":"L. Devroye","year":"1986","unstructured":"Devroye, L.: Non-uniform random variate generation, pp. 96\u201398. Berlin: Springer 1986."},{"key":"BF02242022_CR4","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1137\/0211054","volume":"11","author":"T. Gonzalez","year":"1982","unstructured":"Gonzalez, T., Ja'Ja', J.: Evaluation of arithmetic expressions with algebraic identities. SIAM J. Comput.11, 633\u2013662 (1982).","journal-title":"SIAM J. Comput."},{"key":"BF02242022_CR5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","volume":"25","author":"Ph. Flajolet","year":"1982","unstructured":"Flajolet, Ph., Odlyzko, A.: The average height of binary trees and other simple trees. J. Comp. Syst. Sci.25, 171\u2013213 (1982).","journal-title":"J. Comp. Syst. Sci."},{"key":"BF02242022_CR6","first-page":"13","volume":"12","author":"W. Gutjahr","year":"1987","unstructured":"Gutjahr, W.: Enumeration of program structures as trees with commutative or associative nodes. J. Comb. Inf. Syst. Sci.12, 13\u201324 (1987).","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"BF02242022_CR7","first-page":"208","volume-title":"Graphical enumeration","author":"F. Harary","year":"1973","unstructured":"Harary, F., Palmer, E. M.: Graphical enumeration, pp. 208\u2013214. New York, London: Academic Press 1973."},{"key":"BF02242022_CR8","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1137\/0212044","volume":"12","author":"T. Hickey","year":"1983","unstructured":"Hickey, T., Cohen, J.: Uniform random generation of strings in a context-free language. SIAM J. Comput.12, 645\u2013655 (1983).","journal-title":"SIAM J. Comput."},{"key":"BF02242022_CR9","first-page":"305","volume-title":"The art of computer programming, Vol. I: Fundamental algorithms","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D. E.: The art of computer programming, Vol. I: Fundamental algorithms, 2nd. ed., pp. 305\u2013422. Reading, MA: Addison-Wesley 1973.","edition":"2nd. ed."},{"key":"BF02242022_CR10","doi-asserted-by":"crossref","first-page":"997","DOI":"10.4153\/CJM-1978-085-0","volume":"30","author":"A. Meir","year":"1978","unstructured":"Meir, A., Moon, J. W.: On the altidude of nodes in random trees. Can. J. Math.30, 997\u20131015 (1978).","journal-title":"Can. J. Math."},{"key":"BF02242022_CR11","first-page":"77","volume-title":"Combinatorial algorithms","author":"A. Nijenhuis","year":"1975","unstructured":"Nijenhuis, A., Wilf, H. S.: Combinatorial algorithms, pp. 77\u201380. New York, San Francisco, London: Academic Press 1975."},{"key":"BF02242022_CR12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0196-6774(90)90030-I","volume":"11","author":"F. Ruskey","year":"1990","unstructured":"Ruskey, F., Proskurowski, A.: Generating binary trees by transpositions. J. of Algorithms11, 68\u201384 (1990).","journal-title":"J. of Algorithms"},{"key":"BF02242022_CR13","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1145\/321607.321620","volume":"17","author":"T. Sethi","year":"1970","unstructured":"Sethi, T., Ullman, J. D.: The generation of optimal code for arithmetic expressions. JACM17, 715\u2013728 (1970).","journal-title":"JACM"},{"key":"BF02242022_CR14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02242268","volume":"33","author":"G. Tinhofer","year":"1984","unstructured":"Tinhofer, G., Schreck, H.: Linear time tree codes. Computing33, 211\u2013225 (1984).","journal-title":"Computing"},{"key":"BF02242022_CR15","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0950-5849(90)90044-R","volume":"32","author":"M. A. Vouk","year":"1990","unstructured":"Vouk, M. A.: Back-to-back testing. Inform. Soft. Techn.32, 34\u201346 (1990).","journal-title":"Inform. Soft. Techn."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02242022.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02242022\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02242022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T23:15:50Z","timestamp":1557875750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02242022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["BF02242022"],"URL":"https:\/\/doi.org\/10.1007\/bf02242022","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}