Laws@SRI-AI.ARPA@sri-unix.UUCP (08/09/83)
From: Ken Laws <Laws@SRI-AI.ARPA> [Includes selected topics in CS that seem relevant to AIList and are not covered in the preceeding bibliographies.] Eppinger, J.L.*An empirical study of insertion and deletion in binary search trees.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-146.*1982. Gilmore, P.C.*Solvable cases of the travelling salesman problem.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-08.*1981. Graham, R.L. Hell, P.*On the history of the minimum spanning tree problem.* Simon Fraser U. Computing Sci.Dept.*TR 82-05.*1982. Gupta, A. Hon, R.W.*Two papers on circuit extraction.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-147.*1982. Contents: Gupta, A.* ACE: a circuit extractor; Gupta, A. Hon, R.W.* HEXT: a hierarchical circuit extractor. Hofri, M.*BIN packing: an analysis of the next fit algorithm.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 242.*1982. Jomier, G.*An overview of systems modelling and evaluation tendencies.* INRIA.*Rapport de Recherche 134.*1982. Jurkiewicz, E.* Stability of compromise solution in multicriteria decision making problem.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 455.*1981. Kirkpatrick, D.G. Hell, P.*On the complexity of general graph factor problems.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-07.*1981. Kjelldahl, L. Romberger, S.*Requirements for interactive editing of diagrams.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8303.*1983. Moran, S.*On the densest packing of circles in convex figures.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.* Tech.Rpt. 241.*1982. Nau, D. Kumar, V. Kanal, L.*General branch and bound and its relation to A* and AO*.* Maryland U. Comp.Sci. Center.*TR-1170.*1982. Nau, D.S.* Pathology on game trees revisited, and an alternative to minimaxing.* Maryland U. Comp.Sci. Center.*TR-1187.*1982. Roberts, B.J. Marashian, I.* Bibliography of Stanford computer science reports, 1963-1982.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-911.*1982. 59p. Scowen, R.S.*An introduction and handbook for the standard syntactic metalanguage.* U.K. National Physical Lab. Info. Technology and Computing Div.*DITC 19/83.*1983. Seidel, R.*A convex hull algorithm for point sets in even dimensions.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-14.*1981. Varah, J.M.*Pitfalls in the numerical solution of linear ill posed problems.* British Columbia U. Comp.Sci.Dept.* Tech.Rpt. 81-10.*1981. Wegman, M.*Summarizing graphs by regular expressions.* IBM Watson Res. Center.*RC 9364.*1982.