{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:24:08Z","timestamp":1725600248345},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"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-22300-6_43","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:41:31Z","timestamp":1312893691000},"page":"512-523","source":"Crossref","is-referenced-by-count":2,"title":["Searching in Dynamic Tree-Like Partial Orders"],"prefix":"10.1007","author":[{"given":"Brent","family":"Heeringa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marius C\u0103t\u0103lin","family":"Iordan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis","family":"Theran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"43_CR1","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/S009753979731858X","volume":"28","author":"Y. Ben-Asher","year":"1999","unstructured":"Ben-Asher, Y., Farchi, E., Newman, I.: Optimal search in trees. SIAM J. Comput.\u00a028(6), 2090\u20132102 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"43_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2003.06.001","volume":"321","author":"R. Carmo","year":"2004","unstructured":"Carmo, R., Donadelli, J., Kohayakawa, Y., Laber, E.S.: Searching in random partially ordered sets. Theor. Comput. Sci.\u00a0321(1), 41\u201357 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR3","first-page":"1096","volume-title":"SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"S. Mozes","year":"2008","unstructured":"Mozes, S., Onak, K., Weimann, O.: Finding an optimal tree searching strategy in linear time. In: SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1096\u20131105. Society for Industrial and Applied Mathematics, Philadelphia (2008)"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1109\/FOCS.2006.32","volume-title":"FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science","author":"K. Onak","year":"2006","unstructured":"Onak, K., Parys, P.: Generalization of binary search: Searching in trees and forest-like partial orders. In: FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 379\u2013388. IEEE Computer Society, Washington, DC, USA (2006)"},{"issue":"13","key":"43_CR5","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1016\/j.dam.2008.03.007","volume":"156","author":"D. Dereniowski","year":"2008","unstructured":"Dereniowski, D.: Edge ranking and searching in partial orders. Discrete Appl. Math.\u00a0156(13), 2493\u20132500 (2008)","journal-title":"Discrete Appl. Math."},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-14165-2_45","volume-title":"Automata, Languages and Programming","author":"T. Jacobs","year":"2010","unstructured":"Jacobs, T., Cicalese, F., Laber, E.S., Molinaro, M.: On the complexity of searching in trees: Average-case minimization. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 527\u2013539. Springer, Heidelberg (2010)"},{"key":"43_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-540-70575-8_38","volume-title":"Automata, Languages and Programming","author":"E. Laber","year":"2008","unstructured":"Laber, E., Molinaro, M.: An approximation algorithm for binary searching in trees. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 459\u2013471. Springer, Heidelberg (2008)"},{"key":"43_CR8","first-page":"392","volume-title":"SODA 2009: Proceedings of the Nineteenth Annual ACM-SIAM SODA","author":"C. Daskalakis","year":"2009","unstructured":"Daskalakis, C., Karp, R.M., Mossel, E., Riesenfeld, S., Verbin, E.: Sorting and selection in posets. In: SODA 2009: Proceedings of the Nineteenth Annual ACM-SIAM SODA, pp. 392\u2013401. SIAM, Philadelphia (2009)"},{"key":"43_CR9","unstructured":"Daskalakis, C., Karp, R.M., Mossel, E., Riesenfeld, S., Verbin, E.: Sorting and selection in posets. CoRR abs\/0707.1532 (2007)"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Heeringa, B., Iordan, M.C., Theran, L.: Searching in dynamic tree-like partial orders. CoRR abs\/1010.1316 (2010)","DOI":"10.1007\/978-3-642-22300-6_43"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1571-0653(04)00209-4","volume":"7","author":"E. Laber","year":"2001","unstructured":"Laber, E., Nogueira, L.T.: Fast searching in trees. Electronic Notes in Discrete Mathematics\u00a07, 1\u20134 (2001)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"43_CR12","doi-asserted-by":"publisher","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 altitude of nodes in random trees. Canadian Journal of Mathematics\u00a030, 997\u20131015 (1978)","journal-title":"Canadian Journal of Mathematics"},{"key":"43_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-55251-0_2","volume-title":"CAAP \u201992","author":"F. Bergeron","year":"1992","unstructured":"Bergeron, F., Flajolet, P., Salvy, B.: Varieties of increasing trees. In: Raoult, J.-C. (ed.) CAAP 1992. LNCS, vol.\u00a0581, pp. 24\u201348. Springer, Heidelberg (1992)"},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00026-009-0009-x","volume":"12","author":"M. Drmota","year":"2009","unstructured":"Drmota, M.: The height of increasing trees. Annals of Combinatorics\u00a012, 373\u2013402 (2009), doi:10.1007\/s00026-009-0009-x","journal-title":"Annals of Combinatorics"},{"issue":"2","key":"43_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1017\/S1446788700016517","volume":"30","author":"G.R. Grimmett","year":"1980","unstructured":"Grimmett, G.R.: Random labelled trees and their branching networks. J. Austral. Math. Soc. Ser. A\u00a030(2), 229\u2013237 (1980\/1981)","journal-title":"J. Austral. Math. Soc. Ser. A"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T22:54:16Z","timestamp":1560466456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}