{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:05:19Z","timestamp":1760169919227},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7382,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1016\/0304-3975(93)90208-b","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"3-34","source":"Crossref","is-referenced-by-count":5,"title":["Average-case analysis of unification algorithms"],"prefix":"10.1016","volume":"113","author":[{"given":"Luc","family":"Albert","sequence":"first","affiliation":[]},{"given":"Rafael","family":"Casas","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Fages","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90208-B_BIB1","first-page":"223","article-title":"Average case complexity analysis of RETE pattern match algorithm and average size of join in databases","volume":"Vol. 405","author":"Albert","year":"1989"},{"key":"10.1016\/0304-3975(93)90208-B_BIB2","series-title":"Ph.D. Thesis","article-title":"Quelques analyses de complexit\u00e9 en moyenne sur les algorithmes de multi-filtrage, d'unification et de requ\u00eate multiple","author":"Albert","year":"1990"},{"key":"10.1016\/0304-3975(93)90208-B_BIB3","series-title":"Report de Recerca LSI-89-26","article-title":"On unification over unrestricted pairs of trees","author":"Albert","year":"1989"},{"key":"10.1016\/0304-3975(93)90208-B_BIB4","first-page":"18","article-title":"Average case complexity analysis of the RETE pattern match algorithm","volume":"Vol. 317","author":"Albert","year":"1988"},{"key":"10.1016\/0304-3975(93)90208-B_BIB5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0020-0190(89)90078-1","article-title":"Average case analysis of Robinson's unification algorithm with two different variables","volume":"31","author":"Casas","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(93)90208-B_BIB6","series-title":"MAPLE: Reference Manual","author":"Char","year":"1988"},{"key":"10.1016\/0304-3975(93)90208-B_BIB7","first-page":"85","article-title":"Equations and inequations on finite and infinite trees","author":"Colmerauer","year":"1984","journal-title":"Proc. Internat. Conf. on Fifth Generation Computer Systems"},{"key":"10.1016\/0304-3975(93)90208-B_BIB8","series-title":"Advanced Combinatorics","author":"Comtet","year":"1974"},{"key":"10.1016\/0304-3975(93)90208-B_BIB9","first-page":"909","article-title":"A rehabilitation of Robinson's unification algorithm","volume":"Vol. 83","author":"Corbin","year":"1983"},{"key":"10.1016\/0304-3975(93)90208-B_BIB10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","article-title":"Fundamental properties of infinite trees","volume":"25","author":"Courcelle","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90208-B_BIB11","series-title":"Asymptotic Methods in Analysis","author":"de Bruijn","year":"1958"},{"key":"10.1016\/0304-3975(93)90208-B_BIB12","first-page":"369","article-title":"Average time analyses related to logic programming","author":"Dershowitz","year":"1989","journal-title":"6th Internat. Conf. on Logic Programming"},{"key":"10.1016\/0304-3975(93)90208-B_BIB13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0743-1066(84)90022-0","article-title":"On the sequential nature of unification","volume":"1","author":"Dwork","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(93)90208-B_BIB14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0012-365X(80)90050-3","article-title":"Combinatorial aspects of continued fractions","volume":"32","author":"Flajolet","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(93)90208-B_BIB15","series-title":"Trends in Theoretical Computer Science","first-page":"225","article-title":"Mathematical methods in the analysis of algorithms and data structures","author":"Flajolet","year":"1988"},{"issue":"2","key":"10.1016\/0304-3975(93)90208-B_BIB16","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","article-title":"Singularity analysis of generating functions","volume":"3","author":"Flajolet","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0304-3975(93)90208-B_BIB17","series-title":"Inria Research Report 1073","article-title":"Lambda-upsilon-omega: the 1989 cookbook","author":"Flajolet","year":"1989"},{"key":"10.1016\/0304-3975(93)90208-B_BIB18","first-page":"220","article-title":"Analytic variations on the common subexpression problem","volume":"Vol. 443","author":"Flajolet","year":"1990"},{"key":"10.1016\/0304-3975(93)90208-B_BIB19","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(89)90004-2","article-title":"Complete sets of transformations for general E-unification","volume":"67","author":"Gallier","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90208-B_BIB20","series-title":"Ecrits logiques de Jacques Herbrand","article-title":"Recherches sur la th\u00e9orie de la d\u00e9monstration","author":"Herbrand","year":"1968"},{"key":"10.1016\/0304-3975(93)90208-B_BIB21","article-title":"R\u00e9solution d'\u00e9quations dans les langages d'ordre 1, 2, \u2026, \u03c9","author":"Huet","year":"1976","journal-title":"Th\u00e8se d'\u00e9tat de l'Universit\u00e9 Paris VII"},{"key":"10.1016\/0304-3975(93)90208-B_BIB22","article-title":"Unification revisited","author":"Lassez","year":"1986","journal-title":"Foundations of Deductive Databases and Logic Programming"},{"key":"10.1016\/0304-3975(93)90208-B_BIB23","first-page":"122","article-title":"On the complexity of unification sequences","author":"Mannila","year":"1986","journal-title":"Proc. 3rd Logic Programming Conf."},{"key":"10.1016\/0304-3975(93)90208-B_BIB24","series-title":"Internal Report B76-16","article-title":"Unification in linear time and space: a structured presentation","author":"Martelli","year":"1976"},{"issue":"2","key":"10.1016\/0304-3975(93)90208-B_BIB25","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An efficient unification algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0304-3975(93)90208-B_BIB26","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","article-title":"Linear unification","volume":"16","author":"Paterson","year":"1978","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0304-3975(93)90208-B_BIB27","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(93)90208-B_BIB28","article-title":"Computational logic: the unification computation","volume":"Vol. 6","author":"Robinson","year":"1971"},{"key":"10.1016\/0304-3975(93)90208-B_BIB29","series-title":"Formal Techniques in Artificial Intelligence: A Sourcebook","first-page":"369","article-title":"An introduction to unification theory","author":"Siekmann","year":"1990"},{"issue":"IV","key":"10.1016\/0304-3975(93)90208-B_BIB30","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF02575754","article-title":"Complexity of the unification algorithm for first-order expressions","volume":"XII","author":"Venturini-Zilli","year":"1975","journal-title":"Calcolo"},{"key":"10.1016\/0304-3975(93)90208-B_BIB31","series-title":"A Handbook of Theoretical Computer Science","article-title":"Average case analysis of algorithms and data structures","author":"Vitter","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390208B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390208B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:22:52Z","timestamp":1555129372000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390208B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["030439759390208B"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90208-b","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}