{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:29Z","timestamp":1725663329232},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540159841"},{"type":"electronic","value":"9783540396857"}],"license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15984-3_268","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:29:09Z","timestamp":1330176549000},"page":"225-228","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Worst-case analysis of algorithms for computational problems on abelian permutation groups"],"prefix":"10.1007","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"40_CR1","unstructured":"AHO, A., HOPCROFT, J., ULLMAN, J., The design and analysis of Computer algorithms, Addison-Wesley (1974)"},{"key":"40_CR2","volume-title":"Problems in Group theory","author":"J.D. Dixon","year":"1973","unstructured":"DIXON, J.D., Problems in Group theory, Dover, New York (1973)"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"FURST, M., HOPCROFT, J., LUKS, E., Polynomial time algorithms for permutation groups, 22nd Symposium on the Foundations of Computer Science (1980), pp 36\u201341","DOI":"10.1109\/SFCS.1980.34"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"HOFFMANN, C.M., Group theoretic algorithms and graph isomorphism, Springer-Verlag (1982).","DOI":"10.1007\/3-540-11493-9"},{"key":"40_CR5","unstructured":"HU, T.C., Integer programming and network flows Addison-Wesley, (1969)"},{"key":"40_CR6","unstructured":"ILIOPOULOS, C.S., Algorithms in the theory of abelian groups, Ph.D. Thesis, Warwick Univ., (1983)"},{"key":"40_CR7","first-page":"4","volume":"20","author":"C.S. Iliopoulos","year":"1985","unstructured":"ILIOPOULOS, C.S., Analysis of algorithms on problems in general abelian groups Info. Proc. Letters, Vol 20, 4, 1985","journal-title":"Proc. Letters"}],"container-title":["Lecture Notes in Computer Science","EUROCAL '85"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15984-3_268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:43:21Z","timestamp":1558255401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15984-3_268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540159841","9783540396857"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-15984-3_268","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}