By Topic

Foundations of Computer Science, 1979., 20th Annual Symposium on

Date 29-31 Oct. 1979

Filter Results

Displaying Results 1 - 25 of 47
  • [Front cover]

    Publication Year: 1979, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (1308 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 1979, Page(s):v - vii
    Request permission for commercial reuse | PDF file iconPDF (335 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 1979, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • Some theoretical aspects of position-location problems

    Publication Year: 1979, Page(s):1 - 8
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (857 KB)

    The position-location problem is that of computing the coordinates of a set of objects in space (usually a plane) from a sparse set of distance measurements. Because the problem is analogous to that of constructing a pin-Jointed structure from rigid bars (of given respective lengths), it is intimately linked to problems of structural rigidity. In addition to its practical significance, the problem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a general method for maximizing and minimizing among certain geometric problems

    Publication Year: 1979, Page(s):9 - 17
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (786 KB)

    Problems concerned with finding inscribing or circumscribing polygons that maximize some measurement are considered such as: Find an area maximizing triangle inscribed in a given convex polygon. Algorithms solving a number of these problems in linear time are presented. They use the common approach of finding an initial solution with respect to a fixed bounding point and then iteratively transform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient computation of continuous skeletons

    Publication Year: 1979, Page(s):18 - 27
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1161 KB)

    An O(n lgn) algorithm is presented for the construction of skeletons of arbitrary n-line polygonal figures. This algorithm is based on an O(n lgn) algorithm for the construction of generalized Voronoi diagrams (our generalization replaces point sets by sets of line segments constrained to intersect only at end points). The generalized Voronoi diagram algorithm employs a linear time algorithm for t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Field extension and trilinear aggregating, uniting and canceling for the acceleration of matrix multiplications

    Publication Year: 1979, Page(s):28 - 38
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1023 KB)

    The acceleration of matrix multiplication MM, is based on the combination of the method of algebraic field extension due to D. Bini, M. Capovani, G. Lotti, F. Romani and S. Winograd and of trilinear aggregating, uniting and canceling due to the author. A fast algorithm of O(N2.7378) complexity for N × N matrix multiplication is derived. With A. Schönhage's Theorem about partial and tot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Canonical labelling of graphs in linear average time

    Publication Year: 1979, Page(s):39 - 46
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (755 KB)

    Canonical labelling of graphs (CL, for short) can be used, e.g., to test isomorphism. We prove that a simple vertex classification procedure results after only two refinement steps in a CL of random graphs with probability 1 - exp(-cn). With a slight modification we obtain a linear time CL algorithm with only exp(-cn log n/log log n) probability of failure. An additional depth-first search yields ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Succinct certificates for the solvability of binary quadratic Diophantine equations

    Publication Year: 1979, Page(s):47 - 54
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A subexponential algorithm for the discrete logarithm problem with applications to cryptography

    Publication Year: 1979, Page(s):55 - 60
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational complexity in algebraic function fields

    Publication Year: 1979, Page(s):61 - 65
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal languages: Origins and directions

    Publication Year: 1979, Page(s):66 - 90
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3965 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The decidability of the equivalence of context-free grammar forms

    Publication Year: 1979, Page(s):91 - 96
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (755 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bijective A-transducers

    Publication Year: 1979, Page(s):97 - 100
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB)

    In this paper we study bijective a-transducers. We derive necessary and sufficient conditions on pairs of regular sets (R,S) such that a bijective a-transducer, mapping R cnto S exists. The results obtained allow the systematic construction of an a-transducer, mapping a set R onto a set S bijectively for surprisingly "different" regular sets R and S. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantics of probabilistic programs

    Publication Year: 1979, Page(s):101 - 114
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1368 KB)

    Two complementary but equivalent semantic interpretations of a high level probabilistic programming language are given. One of these interprets programs as partial measurable functions on a measurable space. The other interprets programs as continuous linear operators on a Banach space of measures. It is shown how the ordered domains of Scott and others are embedded naturally into these spaces. Tw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Models of program logics

    Publication Year: 1979, Page(s):115 - 122
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (969 KB)

    We briefly survey the major proposals for models of programs and show that they all lead to the same propositional theory of programs. Methods of algebraic logic dominate in the proofs. One of the connections made between the models, that involving language models, is quite counterintuitive. The common theory has already been shown to be complete in deterministic exponential time; we give here a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orderings for term-rewriting systems

    Publication Year: 1979, Page(s):123 - 131
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (963 KB)

    Methods of proving that a term-rewriting system terminates are presented. They are based on the notion of "simplification orderings", orderings in which any term that is homeomorphically embeddable in another is smaller than the other. A particularly useful class of simplification orderings, the "recursive path orderings", is defined. Several examples of the use of such orderings in termination pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of partial satisfaction

    Publication Year: 1979, Page(s):132 - 139
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    A conjunctive normal form (cnf) is 2-satisfiable, iff any 2 of its clauses are satisfiable. It is shown that every 2-satisfiable cnf s has an interpretation which satisfies at least h¿length(s) clauses (h=(√5-1)/2∼0.618). This result is optimal, insofar as the given constant h is maximal. The proof is polynomially constructive, i.e., it yields a polynomial algorithm, which compute... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The cube-connected-cycles: A versatile network for parallel computation

    Publication Year: 1979, Page(s):140 - 147
    Cited by:  Papers (77)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (909 KB)

    We introduce a network of processing elements, the cube-connected-cycles (CCC), complying with the present technological constraints of VLSI design. By combining the principles of parallelism and pipelining, the CCC can emulate the cube-connected machine with no significant degradation of performance but with a much more compact structure. We describe in detail how to program the CCC for efficient... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transforming static data structures to dynamic structures

    Publication Year: 1979, Page(s):148 - 168
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2091 KB)

    In this paper we will investigate transformations that serve as tools in the design of new data structures. Specifically, we study general methods for converting static structures (in which all elements are known before any searches are performed) to dynamic structures (in which the insertion of a new element can be mixed with searches). We will see three classes of such transformations (each base... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward self-organizing linear search

    Publication Year: 1979, Page(s):169 - 174
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (530 KB)

    We consider techniques for adapting linear lists so that the more frequently accessed elements are found near the front, even though we are not told the probabilities of various elements being accessed. The main results are discussed in two sections. Perhaps the most interesting deals with techniques which move an element toward the front only after it has been requested k times in a row. The othe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New classes and applications of hash functions

    Publication Year: 1979, Page(s):175 - 182
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (866 KB)

    In this paper we exhibit several new classes of hash functions with certain desirable properties, and introduce two novel applications for hashing which make use of these functions. One class of functions is small, yet is almost universal2. If the functions hash n-bit long names into m-bit indices, then specifying a member of the class requires only O((m + log2log2(n)) log2(n)) bits as compared to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards analysing sequences of operations for dynamic data structures

    Publication Year: 1979, Page(s):183 - 195
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1142 KB)

    This paper presents the average case performance analysis of dynamic data structures subjected to arbitrary sequences of insert, delete and query operations. To such sequences of operations are associated, for each data type, a specific continued fraction and a familly of orthogonal polynomials : Tchebycheff for stacks, Laguerre for dictionaries, Hermite for priority queues, Meixner for linear lis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for simple matroid intersection problems

    Publication Year: 1979, Page(s):196 - 204
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1071 KB)

    Given a matroid, where each element has a realvalued cost and is colored red or green; we seek a minimum cost base with exactly q red elements. This is a simple case of the matroid intersection problem. A general algorithm is presented. Its efficiency is illustrated in the special case of finding a minimum spanning tree with q red edges; the time is O(m log log n + n α (n,n) log n). Efficie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality

    Publication Year: 1979, Page(s):205 - 217
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1743 KB)

    We present a constructive algorithm for solving systems of linear inequalities (LI) with at most two variables per inequality. The algorithm is polynomial in the size of the input. The LI problem is of importance in complexity theory since it is polynomial time (Turing) equivalent to linear programming. The subclass of LI treated in this paper is also of practical interest in mechanical verificati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.