ICIS Research Publications


2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 1986 1985 1984 1983 1982 1981 1980 1979 1978 1977 1976 1975 1974 1973 1972 1971 1970 1969 1968 1967 1966 1965 1964 1963 1962 1960 1959 1958 1957 1956 1955 1953 1952 1951 1950 1949 1948 1947 1946 1945 1941 1938 1923 1911

Unclassified

H.D. Anderson, and P.B. Berra. Minimum cost selection of secondary indexes for formatted files. In: ACM Transactions on Database Systems, Vol: 2, Pages: 68-90, 1977.

[ Missing PDF ] [ Bibtex ]

R. Bayer, and M. Schkolnick. Concurrency of Operations on B-Trees. In: Acta Informatica, Vol: 9, Pages: 1-21, 1977.

[ Missing PDF ] [ Bibtex ]

M. Bunge. The Furniture of the World. Treatise on Basic Philosophy, Vol: 3, D. Reidel Publishing Company, The Netherlands, EU, 1977.

[ Missing PDF ] [ Bibtex ]

C.C. Chang, and H.J. Keisler. Model Theory. 2nd edition, North-Holland, Amsterdam, The Netherlands, EU, 1977.

[ Missing PDF ] [ Bibtex ]

E. Denert. Specification and Design of Dialogue Systems with State Diagrams. In: Proceeding International Computing Symposium, Amsterdam, The Netherlands, EU, Edited by: E. Morlet, and D. Ribbens. Pages: 417-424, North-Holland, Amsterdam, The Netherlands, EU, 1977.

[ Missing PDF ] [ Bibtex ]

J.A. Goguen, J.W. Thatcher, E.G. Wagner, and J.B. Wright. Initial Algebra Semantics and Continuous Algebras. In: Journal of the ACM (JACM), Nr: 1, Vol: 24, Pages: 68-95, ACM, New York, New York, USA, 1977, ISSN 00045411.

[ PDF ] [ Bibtex ]

W.J. Hutchins. On the problem of aboutness in Information Retrieval. In: Journal of Informatics, Vol: 1, Pages: 17-35, 1977.

[ Missing PDF ] [ Bibtex ]

N.D. Jones, L.H. Landweber, and Y.E. Lien. Complexity of Some Problems in Petri Nets. In: Theoretical Computer Science, Vol: 4, Pages: 277-299, 1977.

[ Missing PDF ] [ Bibtex ]

E. Kant. The Selection of Efficient Implementations for a High-Level Language. In: SIGPLAN Notices, Nr: 8, Vol: 12, Pages: 140-146, 1977.

[ Missing PDF ] [ Bibtex ]

E.M. Keen. On the Generation and Searching of Entries in Printed Subject Indexes. In: Journal of Documentation, Nr: 1, Vol: 33, Pages: 15-45, 1977.

[ Missing PDF ] [ Bibtex ]

B.W. Lampson, J.J. Horning, R.L. London, J.G. Mitchell, and G.J. Popek. Report on the Programming Language EUCLID. In: SIGPLAN Notices, Nr: 2, Vol: 12, 1977.

[ Missing PDF ] [ Bibtex ]

E.J. Lemmon. The Lemmon Notes: An Introduction to Modal Logic. American Philosophical Quarterly Monograph Series, 1977.

[ Missing PDF ] [ Bibtex ]

M.E. Maron. On Indexing, Retrieval and the Meaning of About. In: Journal of the American Society for Information Science, Nr: 1, Vol: 28, Pages: 38-43, 1977.

[ Missing PDF ] [ Bibtex ]

M.E. Maron. On Indexing, Retrieval and the Meaning of About. In: Journal of the American Society for Information Science, Nr: 1, Vol: 28, Pages: 38-43, 1977.

[ Missing PDF ] [ Bibtex ]

R.K. Ragade, and M.M. Gupta. Fuzzy Set Theory:Introduction. Chapter 7, Pages: 105-131, North-Holland, Amsterdam, The Netherlands, EU, 1977.

[ Missing PDF ] [ Bibtex ]

S.E. Robertson. The Probability Ranking Principle in IR. In: Journal of Documentation, Vol: 33, Pages: 294-304, 1977.

[ Missing PDF ] [ Bibtex ]

S. E. Robertson. The Probability Ranking Principle. In: Journal of Documentation, Nr: 4, Vol: 33, Pages: 294-304, December, 1977.

[ Missing PDF ] [ Bibtex ]

S.J. Rosenschein, and S.M. Katz. Selection of Representations for Data Structures. In: SIGPLAN Notices, Nr: 8, Vol: 12, Pages: 147-154, 1977.

[ Missing PDF ] [ Bibtex ]

Solntseff and Wood. Pyramides. In: BIT, Vol: 17, Pages: 344, 1977.

[ Missing PDF ] [ Bibtex ]

D.F. Stanat, and D.F. McAllister. Discrete mathematics in computer science. Prentice-Hall, Englewood Cliffs, New Jersey, USA, 1977.

[ Missing PDF ] [ Bibtex ]

J.E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Semantics. MIT Press, Cambridge, Massachusetts, USA, 1977.

[ Missing PDF ] [ Bibtex ]

M.M. Zloof. Query-by-Example: a data base language. In: IBM Systems Journal, Nr: 4, Vol: 16, Pages: 324-343, 1977.

[ PDF ] [ Bibtex ]

Conference

J.A. Bergstra, A. Ollongren, and Th.P. van der Weide. An axiomatisation of the rational data objects. In: Fundamentals of Computation Theory, Berlin, Germany, EU, Lecture Notes in Computer Science edition, Vol: 56, Pages: 33-38, Springer, 1977.

[ Missing PDF ] [ Bibtex ]

J. Leeuwen, and Th.P. van der Weide. Alternative Path Compression Rules. Technical report, September, University of Utrecht, The Netherlands, 1977, An outline of the results were presented at the Fachtagung on Algorithms and Complexity Theory, Oberwolfach, Oct 1977..

UNION-FIND programs symbolize a large class of algorithms for merging and searching disjoint sets, which are represented as trees. In the "collapsing" rule for FIND's one must first locate a root and then traverse the same FIND-path a second time in order to attach each of its nodes to the root. In an attempt to find a more elegant implementation, we shall consider the problem of how the "second pass" can be eliminated while preserving good efficiency (with or without a balancing rule for UNIONs). We consider several alternative tree compression methods, including Rem's algorithm as presented by Dijkstra. We propose a simpler one-pass technique called "path halving", which performs well in both the balanced and unbalanced cases. We show that the time needed for executing O(n) UNIONs and FINDs is bounded by O(n log n) when only path halving is used. When the "weighted union" rule is used for set-merging and path-halving for FINDs, then the cost for O(n) UNIONs and FINDs is bounded by O(n log* n). We conclude that for all practical purposes path-halving is a viable alternative to the original collapsing rule.

[ PDF ] [ Bibtex ]

Reports

J.A. Bergstra, A. Ollongren, and Th.P. van der Weide. Multilevel Set Objects. Technical report, Institute of Applied Mathematics and Computer Science, Leiden, The Netherlands, 1977.

[ Missing PDF ] [ Bibtex ]

Th.P. van der Weide. PO Structures. Technical report, Institute of Applied Mathematics and Computer Science, Leiden, The Netherlands, 1977.

[ Missing PDF ] [ Bibtex ]