{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:46:33Z","timestamp":1648849593633},"reference-count":6,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T00:00:00Z","timestamp":1408406400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2014,9]]},"abstract":"<jats:p>In 2011, shortly after his untimely passing, several colleagues and I wrote an obituary for Philippe Flajolet [5] that includes the following:\n<jats:disp-quote><jats:p>He was the leading figure in the development of the international \u2018AofA\u2019 community that is devoted to research on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms. The colleagues and students who are devoted to carrying on his work form the core of his primary legacy.<\/jats:p><\/jats:disp-quote>\nThis special issue is testimony to that legacy. Many of the dozens of authors who are represented here worked closely with Philippe; many others have been inspired by his work. All are devoted to carrying it on.<\/jats:p>","DOI":"10.1017\/s0963548314000583","type":"journal-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T07:19:17Z","timestamp":1408432757000},"page":"631-634","source":"Crossref","is-referenced-by-count":0,"title":["In Memory of Philippe Flajolet"],"prefix":"10.1017","volume":"23","author":[{"given":"Robert","family":"Sedgewick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,8,19]]},"reference":[{"key":"S0963548314000583_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655"},{"key":"S0963548314000583_ref1","first-page":"225","volume-title":"Trends in Theoretical Computer Science","author":"Flajolet","year":"1988"},{"key":"S0963548314000583_ref4","volume-title":"The Art of Computer Programming","author":"Knuth","year":"1968"},{"key":"S0963548314000583_ref2","volume-title":"An Introduction to the Analysis of Algorithms","author":"Flajolet","year":"2012"},{"key":"S0963548314000583_ref6","volume-title":"Balzac","author":"Zweig","year":"1946"},{"key":"S0963548314000583_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.06.003"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548314000583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T21:12:17Z","timestamp":1555881137000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548314000583\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,19]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["S0963548314000583"],"URL":"https:\/\/doi.org\/10.1017\/s0963548314000583","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,19]]}}}