{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:49Z","timestamp":1725664129769},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_249","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:09:20Z","timestamp":1330261760000},"page":"191-200","source":"Crossref","is-referenced-by-count":2,"title":["Using fractal geometry for solving divide-and-conquer recurrences"],"prefix":"10.1007","author":[{"given":"Simant","family":"Dube","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"21_CR1","unstructured":"A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"21_CR2","unstructured":"M. F. Barnsley, Fractals Everywhere, Academic Press, 1988."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01889596","volume":"5","author":"M. F. Barnsley","year":"1989","unstructured":"M. F. Barnsley, J. H. Elton and D. P. Hardin, \u201cRecurrent Iterated Function Systems,\u201d Constructive Approximation, 5, 3\u201331 (1989).","journal-title":"Constructive Approximation"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"M. F. Barnsley, R. L. Devaney, B. B. Mandelbrot, H-O. Peitgen, De Saupe, and R. F. Voss, Science of Fractal Images, Springer-Verlag, 1988.","DOI":"10.1007\/978-1-4612-3784-6"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/1008861.1008865","volume":"12","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley, D. Haken and J. B. Saxe, \u201cA General Method for Solving Divideand-Conquer Recurrences,\u201d SIGACT News, 12, 36\u201344 (1980).","journal-title":"SIGACT News"},{"key":"21_CR6","unstructured":"T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, MIT Press, 1990."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/0304-3975(93)90329-R","volume":"116","author":"K. Culik II","year":"1993","unstructured":"K. Culik II and S. Dube, \u201cAffine Automata and Related Techniques for Generation of Complex Images,\u201d Theoretical Computer Science 116, 373\u2013398 (1993).","journal-title":"Theoretical Computer Science"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(93)90031-I","volume":"41","author":"K. Culik II","year":"1993","unstructured":"K. Culik II and S. Dube, \u201cRational and Affine Expressions for Image Synthesis.\u201d Discrete Applied Mathematics 41, 85\u2013120 (1993).","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"K. Culik II and S. Dube, \u201cBalancing Order and Chaos in Image Generation,\u201d Preliminary version in Proc. of ICALP'91. Lecture notes in Computer Science 510, Springer-Verlag, pp. 600\u2013614. Computer and Graphics, to appear.","DOI":"10.1007\/3-540-54233-7_167"},{"key":"21_CR10","unstructured":"S. Dube, \u201cUsing Fractal Geometry for Solving Divide-and-Conquer Recurrences,\u201d Technical Report 93-70, Dept of Math, Stat and Comp Sci, University of New England at Armidale, Australia."},{"key":"21_CR11","unstructured":"R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, 1989."},{"key":"21_CR12","volume-title":"Mathematics for the Analysis of Algorithms","author":"D. H. Greene","year":"1982","unstructured":"D. H. Greene and D. E. Knuth, Mathematics for the Analysis of Algorithms, Birkh\u00e4user Boston, 1982."},{"key":"21_CR13","volume-title":"The Fractal Geometry of Nature","author":"B. Mandelbrot","year":"1982","unstructured":"B. Mandelbrot, The Fractal Geometry of Nature, W. H. Freeman and Co., San Francisco, 1982."},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1090\/S0002-9947-1988-0961615-4","volume":"309","author":"R. D. Mauldin","year":"1988","unstructured":"R. D. Mauldin and S. C. Williams, \u201cHausdorff Dimension in Graph Directed Constructions,\u201d Transactions of American Mathematical Society, 309, 811\u2013829 (1988).","journal-title":"Transactions of American Mathematical Society"},{"key":"21_CR15","unstructured":"P. W. Purdom, Jr. and C. A. Brown, The Analysis of Algorithms, Holt, Rinehart and Winston, 1985."},{"key":"21_CR16","first-page":"173","volume-title":"Math. Research No. 51","author":"L. Staiger","year":"1989","unstructured":"L. Staiger, \u201cQuadtrees and the Hausdorff Dimension of Pictures,\u201d Workshop on Geometrical Problems of Image Processing (GEOBILD'89), Math. Research No. 51, Akademie-Verlag, Berlin, pp. 173\u2013178 (1989)."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_249.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:10Z","timestamp":1605647590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_249","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}