{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:23Z","timestamp":1725701663037},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_64","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"743-754","source":"Crossref","is-referenced-by-count":7,"title":["Succinct Posets"],"prefix":"10.1007","author":[{"given":"J. Ian","family":"Munro","sequence":"first","affiliation":[]},{"given":"Patrick K.","family":"Nicholson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"64_CR1","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00453-010-9452-7","volume":"62","author":"J. Barbay","year":"2012","unstructured":"Barbay, J., Aleardi, L.C., He, M., Munro, J.I.: Succinct representation of labeled graphs. Algorithmica\u00a062(1-2), 224\u2013257 (2012)","journal-title":"Algorithmica"},{"issue":"2","key":"64_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0097-3165(96)80001-X","volume":"73","author":"G. Brightwell","year":"1996","unstructured":"Brightwell, G., Jurgen Promel, H., Steger, A.: The average number of linear extensions of a partial order. J. Comb. Theo., Series A\u00a073(2), 193\u2013206 (1996)","journal-title":"J. Comb. Theo., Series A"},{"key":"64_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press (2001)"},{"key":"64_CR4","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Karp, R.M., Mossel, E., Riesenfeld, S., Verbin, E.: Sorting and selection in posets. In: Proc. SODA, pp. 392\u2013401. SIAM (2009)","DOI":"10.1137\/1.9781611973068.44"},{"key":"64_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-25591-5_32","volume-title":"Algorithms and Computation","author":"A. Farzan","year":"2011","unstructured":"Farzan, A., Fischer, J.: Compact Representation of Posets. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol.\u00a07074, pp. 302\u2013311. Springer, Heidelberg (2011)"},{"key":"64_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-87744-8_33","volume-title":"Algorithms - ESA 2008","author":"A. Farzan","year":"2008","unstructured":"Farzan, A., Munro, J.I.: Succinct Representations of Arbitrary Graphs. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 393\u2013404. Springer, Heidelberg (2008)"},{"issue":"2","key":"64_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0304-3975(95)00232-4","volume":"165","author":"M. Habib","year":"1996","unstructured":"Habib, M., Nourine, L.: Tree structure for distributive lattices and its applications. Theoretical Computer Science\u00a0165(2), 391 (1996)","journal-title":"Theoretical Computer Science"},{"key":"64_CR8","unstructured":"He, M.: Succinct Indexes. Ph.D. thesis, University of Waterloo (2007)"},{"key":"64_CR9","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proc. FOCS, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"64_CR10","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1090\/S0002-9939-1970-0253944-9","volume":"25","author":"D.J. Kleitman","year":"1970","unstructured":"Kleitman, D.J., Rothschild, B.L.: The number of finite topologies. Proceedings of the American Mathematical Society\u00a025, 276 (1970)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"64_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1090\/S0002-9947-1975-0369090-9","volume":"205","author":"D.J. Kleitman","year":"1975","unstructured":"Kleitman, D.J., Rothschild, B.L.: Asymptotic enumeration of partial orders on a finite set. Transactions of the American Mathematical Society\u00a0205, 205\u2013220 (1975)","journal-title":"Transactions of the American Mathematical Society"},{"key":"64_CR12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K\u0151v\u00e1ri","year":"1954","unstructured":"K\u0151v\u00e1ri, T., S\u00f3s, V.T., Tur\u00e1n, P.: On a problem of Zarankiewicz. Coll. Math.\u00a03, 50\u201357 (1954)","journal-title":"Coll. Math."},{"issue":"5","key":"64_CR13","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.ipl.2009.11.015","volume":"110","author":"D. Mubayi","year":"2010","unstructured":"Mubayi, D., Tur\u00e1n, G.: Finding bipartite subgraphs efficiently. Information Processing Letters\u00a0110(5), 174\u2013177 (2010)","journal-title":"Information Processing Letters"},{"issue":"3","key":"64_CR14","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput.\u00a031(3), 762\u2013776 (2001)","journal-title":"SIAM J. Comput."},{"key":"64_CR15","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: ALENEX (2007)","DOI":"10.1137\/1.9781611972870.6"},{"key":"64_CR16","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. SODA, pp. 233\u2013242. SIAM (2002)"},{"issue":"5","key":"64_CR17","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.1137\/S0097539794274404","volume":"28","author":"M. Talamo","year":"1999","unstructured":"Talamo, M., Vocca, P.: An efficient data structure for lattice operations. SIAM J. on Comp.\u00a028(5), 1783\u20131805 (1999)","journal-title":"SIAM J. on Comp."},{"issue":"6","key":"64_CR18","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M. Thorup","year":"2004","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J. ACM\u00a051(6), 993\u20131024 (2004)","journal-title":"J. ACM"},{"issue":"1","key":"64_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M. Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM\u00a052(1), 1\u201324 (2005)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:06Z","timestamp":1620129306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}