{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,14]],"date-time":"2026-09-14T03:26:56Z","timestamp":1789356416276,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540630890","type":"print"},{"value":"9783540691273","type":"electronic"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0053377","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T04:12:53Z","timestamp":1149653573000},"page":"128-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Near optimal hierarchical encoding of types"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Krall","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Vitek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R. Nigel","family":"Horspool","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,23]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/59287.59293","volume":"11","author":"H. At-Kaci","year":"1989","unstructured":"Hassan At-Kaci, Robert Boyer, Patrick Lincoln, and Roger Nasr. Efficient implementation of lattice operations. ACM Transactions on Programming Languages and Systems, 11(1):115\u2013146, 1989.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR2","first-page":"275","volume-title":"Coloring heuristics for register allocation","author":"P. Briggs","year":"1993","unstructured":"Preston Briggs, Keith Cooper, Ken Kennedy, and Linda Torczon. Coloring heuristics for register allocation. In ACM Conference on Programming Language Design and Implementation, pages 275\u2013284, Portland, June 1993. ACM."},{"key":"6_CR3","first-page":"271","volume-title":"Efficient handling of multiple inheritance hierarchies","author":"Y. Caseau","year":"1993","unstructured":"Yves Caseau. Efficient handling of multiple inheritance hierarchies. In Conference on Object Oriented Programming Systems, Languages & Applications, pages 271\u2013287, Washington, October 1993. ACM."},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1145\/115372.115297","volume":"13","author":"N. H. Cohen","year":"1991","unstructured":"Norman H. Cohen. Type-extension type tests can be performed in constant time. ACM Transactions on Programming Languages and Systems, 13(4):626\u2013629, 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"6","key":"6_CR5","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1145\/1780.1802","volume":"6","author":"P. Dencker","year":"1984","unstructured":"Peter Dencker, Karl D\u00fcrre, and Johannes Heuft. Optimization of parser tables for portable compilers. ACM Transactions on Programming Languages and Systems, 6(6):546\u2013572, 1984.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"5","key":"6_CR6","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1093\/comjnl\/32.5.474","volume":"32","author":"J. A. Ellis","year":"1989","unstructured":"J. A. Ellis and P. M. Lepolesa. A Las Vegas graph coloring algorithm. The Computer Journal, 32(5):474\u2013476, 1989.","journal-title":"The Computer Journal"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Charles Fleurent and Jacques A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, page to appear, 1995.","DOI":"10.1007\/BF02125407"},{"key":"6_CR8","unstructured":"James Gosling, Frank Yellin, and The Java Team. The Java Application Programming Interface. Addison-Weley, 1996."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Michel Habib and Lhouari Nourine. Bit-vector encoding for partially ordered sets. In ORDAL'94, LNCS 831, pages 1\u201312. Springer, 1994.","DOI":"10.1007\/BFb0019423"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0304-3975(95)00232-4","volume":"165","author":"M. Habib","year":"1996","unstructured":"Michel Habib and Lhouari Nourine. Tree structure for distributive lattices and its applications. Theoretical Computer Science, 165:391\u2013405, 1996.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"D. W. Matula","year":"1983","unstructured":"David W. Matula and Leland L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM, 30(3):417\u2013427, July 1983.","journal-title":"Journal of the ACM"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"David W. Matula, George Marble, and Joel D. Isaacson. Graph coloring algorithms. In R. C. Read, editor, Graph Theory and Computing, pages 109\u2013122. Academic Press, 1972.","DOI":"10.1016\/B978-1-4832-3187-7.50015-5"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1145\/42190.46167","volume":"10","author":"N. Wirth","year":"1988","unstructured":"Niklaus Wirth. Type extensions. ACM Transactions on Programming Languages and Systems, 10(2):204\u2013214, 1988.","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","ECOOP'97 \u2014 Object-Oriented Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:19:56Z","timestamp":1676675996000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0053377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630890","9783540691273"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0053377","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"23 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}