{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:10:32Z","timestamp":1736104232995,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540139125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024000","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:44:22Z","timestamp":1132379062000},"page":"109-118","source":"Crossref","is-referenced-by-count":1,"title":["Sorting and recognition problems for ordered sets"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Faigle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"B. Bollob\u00e1s [1978]: Extremal Graph Theory, Academic Press."},{"key":"12_CR2","unstructured":"G. Hetyei [1964]: unpublished."},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(81)90203-X","volume":"35","author":"D. Kelly","year":"1981","unstructured":"D. Kelly [1981]: On the dimension of partially ordered sets, Discr. Math. 35, 135\u2013156.","journal-title":"Discr. Math."},{"key":"12_CR4","volume-title":"The Art of Computer Programming, Vol. 3","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth [1973]: The Art of Computer Programming, Vol. 3, Addison Wesley, Reading MA."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"N. Linial and M.E. Saks [1983]: Information bounds are good for search problems on ordered structures, 24th IEEE FOCS, 473\u2013475.","DOI":"10.1109\/SFCS.1983.27"},{"key":"12_CR6","unstructured":"L. Lov\u00e1sz [1979]: Combinatorial Problems and Exercises, Akad\u00e9miai Kiad\u00f3."},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0012-365X(79)90082-7","volume":"25","author":"I. Rabinovitch","year":"1979","unstructured":"I. Rabinovitch and I. Rival [1979]: The rank of a distributive lattice, Discr. Math. 25, 275\u2013279.","journal-title":"Discr. Math."}],"container-title":["Lecture Notes in Computer Science","STACS 85"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024000.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T18:50:23Z","timestamp":1736103023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024000"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540139125"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0024000","relation":{},"subject":[]}}