{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:25:01Z","timestamp":1725582301196},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208768"},{"type":"electronic","value":"9783642208775"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20877-5_3","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T02:35:17Z","timestamp":1303871717000},"page":"14-26","source":"Crossref","is-referenced-by-count":3,"title":["A Real Elementary Approach to the Master Recurrence and Generalizations"],"prefix":"10.1007","author":[{"given":"Chee","family":"Yap","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","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. Addison-Wesley, Reading (1983)"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1018373005182","volume":"10","author":"M. Akra","year":"1998","unstructured":"Akra, M., Bazzi, L.: On the solution of linear recurrences. Computational Optimizations and Applications\u00a010(2), 195\u2013210 (1998)","journal-title":"Computational Optimizations and Applications"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/1008861.1008865","volume":"12","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L., Haken, D., Saxe, J.B.: A general method for solving divide-and-conquer recurrences. ACM SIGACT News\u00a012(3), 36\u201344 (1980)","journal-title":"ACM SIGACT News"},{"key":"3_CR4","volume-title":"Fundamentals of Algorithms","author":"G. Brassard","year":"1996","unstructured":"Brassard, G., Bratley, P.: Fundamentals of Algorithms. Prentice-Hall, Englewood Cliffs (1996)"},{"key":"3_CR5","unstructured":"Corman, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press & McGraw-Hill Book Co. (2001)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0020-0190(86)90088-8","volume":"23","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., Welzl, E.: Halfplanar range search in linear space and O(n\n                    0.695) query time. Info. Processing Letters\u00a023, 289\u2013293 (1986)","journal-title":"Info. Processing Letters"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(98)00099-1","volume":"210","author":"M.H. Escard\u00f3","year":"1999","unstructured":"Escard\u00f3, M.H., Streicher, T.: Induction and recursion on the partial real line with applications to Real PCF. Theor. Computer Sci.\u00a0210(1), 121\u2013157 (1999)","journal-title":"Theor. Computer Sci."},{"key":"3_CR8","volume-title":"Handbook of Algorithms and Data Structures","author":"G.H. Gonnet","year":"1984","unstructured":"Gonnet, G.H.: Handbook of Algorithms and Data Structures. Addison-Wesley Pub. Co., London (1984)"},{"key":"3_CR9","volume-title":"A Course in Mathematical Analysis","author":"\u00c9. Goursat","year":"1904","unstructured":"Goursat, \u00c9.: A Course in Mathematical Analysis, vol.\u00a01. Ginn & Co., Boston (1904); Trans.\u00a0by Earle Raymod Hedrick. Available from Google books"},{"key":"3_CR10","volume-title":"Mathematics for the Analysis of Algorithms","author":"D.H. Greene","year":"1982","unstructured":"Greene, D.H., Knuth, D.E.: Mathematics for the Analysis of Algorithms, 2nd edn. Birkh\u00e4user, Basel (1982)","edition":"2"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/261342.261350","volume":"28","author":"M. Kao","year":"1997","unstructured":"Kao, M.: Multiple-size divide-and-conquer recurrences. SIGACT News\u00a028(2), 67\u201369 (1997); also Proc. 1996 Intl.\u00a0Conf.\u00a0on Algorithms, Natl. Sun Yat-Sen U., Taiwan, pp. 159\u2013161","journal-title":"SIGACT News"},{"issue":"6","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1145\/195613.195632","volume":"41","author":"R.M. Karp","year":"1994","unstructured":"Karp, R.M.: Probabilistic recurrence relations. J. ACM\u00a041(6), 1136\u20131150 (1994)","journal-title":"J. ACM"},{"key":"3_CR13","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"D.E. Knuth","year":"1972","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol.\u00a03. Addison-Wesley, Boston (1972)"},{"key":"3_CR14","unstructured":"Leighton, T.: Notes on better master theorems for divide-and-conquer recurrences (1996) (class notes)"},{"key":"3_CR15","unstructured":"Mahony, B.P., Hayes, I.J.: Using continuous real functions to model timed histories. In: 6th Australian Software Eng. Conf (ASWEC), pp. 257\u2013270 (1991)"},{"key":"3_CR16","volume-title":"The Analysis of Algorithms","author":"J. Paul Walton Purdom","year":"1985","unstructured":"Paul Walton Purdom, J., Brown, C.A.: The Analysis of Algorithms. Holt, Rinehart and Winston, New York (1985)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-63165-8_201","volume-title":"Automata, Languages and Programming","author":"S. Roura","year":"1997","unstructured":"Roura, S.: An improved master theorem for divide-and-conquer recurrences. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 449\u2013459. Springer, Heidelberg (1997)"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/375827.375837","volume":"48","author":"S. Roura","year":"2001","unstructured":"Roura, S.: Improved master theorems for divide-and-conquer recurrences. J. ACM\u00a048(2), 170\u2013205 (2001)","journal-title":"J. ACM"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1006\/jagm.1994.1004","volume":"16","author":"R.M. Verma","year":"1994","unstructured":"Verma, R.M.: A general method and a master theorem for divide-and-conquer recurrences with applications. J. Algorithms\u00a016, 67\u201379 (1994)","journal-title":"J. Algorithms"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0020-0190(96)00076-2","volume":"59","author":"X. Wang","year":"1996","unstructured":"Wang, X., Fu, Q.: A frame for general divide-and-conquer recurrences. Info. Processing Letters\u00a059, 45\u201351 (1996)","journal-title":"Info. Processing Letters"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-85521-7_12","volume-title":"Reliable Implementation of Real Number Algorithms: Theory and Practice","author":"C.K. Yap","year":"2008","unstructured":"Yap, C.K.: Theory of real computation according to EGC. In: Hertling, P., Hoffmann, C.M., Luther, W., Revol, N. (eds.) Real Number Algorithms. LNCS, vol.\u00a05045, pp. 193\u2013237. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20877-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:23:19Z","timestamp":1558574599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20877-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208768","9783642208775"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20877-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}