@Article{Bona:2017:RST,
  author =       "Mikl{\'o}s B{\'o}na and Boris Pittel",
  title =        "On a random search tree: asymptotic enumeration of
                 vertices by distance from leaves",
  journal =      j-ADV-APPL-PROB,
  volume =       "49",
  number =       "3",
  pages =        "850--876",
  month =        sep,
  year =         "2017",
  CODEN =        "AAPBBD",
  DOI =          "https://doi.org/10.1017/apr.2017.24",
  ISSN =         "0001-8678 (print), 1475-6064 (electronic)",
  ISSN-L =       "0001-8678",
  bibdate =      "Sat Mar 16 08:55:03 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/advapplprob.bib",
  note =         "See corrigendum \cite{Bona:2022:RST}.",
  URL =          "https://www.cambridge.org/core/journals/advances-in-applied-probability/article/on-a-random-search-tree-asymptotic-enumeration-of-vertices-by-distance-from-leaves/EEE6903D24CC8938929C7ACECD533DF3",
  acknowledgement = ack-nhfb,
  ajournal =     "Adv. Appl. Probab.",
  fjournal =     "Advances in Applied Probability",
  journal-URL =  "https://www.cambridge.org/core/journals/advances-in-applied-probability",
  onlinedate =   "08 September 2017",
}

{"_id":"6FCqtTJ5DTv4n3sGk","bibbaseid":"bna-pittel-onarandomsearchtreeasymptoticenumerationofverticesbydistancefromleaves-2017","author_short":["Bóna, M.","Pittel, B."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Miklós"],"propositions":[],"lastnames":["Bóna"],"suffixes":[]},{"firstnames":["Boris"],"propositions":[],"lastnames":["Pittel"],"suffixes":[]}],"title":"On a random search tree: asymptotic enumeration of vertices by distance from leaves","journal":"Advances in Applied Probability","volume":"49","number":"3","pages":"850–876","month":"September","year":"2017","coden":"AAPBBD","doi":"https://doi.org/10.1017/apr.2017.24","issn":"0001-8678 (print), 1475-6064 (electronic)","issn-l":"0001-8678","bibdate":"Sat Mar 16 08:55:03 MDT 2019","bibsource":"http://www.math.utah.edu/pub/tex/bib/advapplprob.bib","note":"See corrigendum i̧teBona:2022:RST.","url":"https://www.cambridge.org/core/journals/advances-in-applied-probability/article/on-a-random-search-tree-asymptotic-enumeration-of-vertices-by-distance-from-leaves/EEE6903D24CC8938929C7ACECD533DF3","acknowledgement":"Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 585 1640, +1 801 581 4148, e-mail: \\path|beebe@math.utah.edu|, \\path|beebe@acm.org|, \\path|beebe@computer.org| (Internet), URL: \\path|http://www.math.utah.edu/ beebe/|","ajournal":"Adv. Appl. Probab.","fjournal":"Advances in Applied Probability","journal-url":"https://www.cambridge.org/core/journals/advances-in-applied-probability","onlinedate":"08 September 2017","bibtex":"@Article{Bona:2017:RST,\n author = \"Mikl{\\'o}s B{\\'o}na and Boris Pittel\",\n title = \"On a random search tree: asymptotic enumeration of\n vertices by distance from leaves\",\n journal = j-ADV-APPL-PROB,\n volume = \"49\",\n number = \"3\",\n pages = \"850--876\",\n month = sep,\n year = \"2017\",\n CODEN = \"AAPBBD\",\n DOI = \"https://doi.org/10.1017/apr.2017.24\",\n ISSN = \"0001-8678 (print), 1475-6064 (electronic)\",\n ISSN-L = \"0001-8678\",\n bibdate = \"Sat Mar 16 08:55:03 MDT 2019\",\n bibsource = \"http://www.math.utah.edu/pub/tex/bib/advapplprob.bib\",\n note = \"See corrigendum \\cite{Bona:2022:RST}.\",\n URL = \"https://www.cambridge.org/core/journals/advances-in-applied-probability/article/on-a-random-search-tree-asymptotic-enumeration-of-vertices-by-distance-from-leaves/EEE6903D24CC8938929C7ACECD533DF3\",\n acknowledgement = ack-nhfb,\n ajournal = \"Adv. Appl. Probab.\",\n fjournal = \"Advances in Applied Probability\",\n journal-URL = \"https://www.cambridge.org/core/journals/advances-in-applied-probability\",\n onlinedate = \"08 September 2017\",\n}\n\n","author_short":["Bóna, M.","Pittel, B."],"key":"Bona:2017:RST","id":"Bona:2017:RST","bibbaseid":"bna-pittel-onarandomsearchtreeasymptoticenumerationofverticesbydistancefromleaves-2017","role":"author","urls":{"Paper":"https://www.cambridge.org/core/journals/advances-in-applied-probability/article/on-a-random-search-tree-asymptotic-enumeration-of-vertices-by-distance-from-leaves/EEE6903D24CC8938929C7ACECD533DF3"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"http://ftp.math.utah.edu/pub/tex/bib/advapplprob.bib","dataSources":["8DKZik2cWsn9Xkr7S"],"keywords":[],"search_terms":["random","search","tree","asymptotic","enumeration","vertices","distance","leaves","bóna","pittel"],"title":"On a random search tree: asymptotic enumeration of vertices by distance from leaves","year":2017}