24th Annual Symposium on Foundations of Computer Science (sfcs 1983)

7-9 Nov. 1983

Filter Results

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

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

    Publication Year: 1983, Page(s):ix - xii
    Request permission for commercial reuse | PDF file iconPDF (433 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 1983, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • Machtey Award

    Publication Year: 1983, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (16 KB)
    Freely Available from IEEE
  • Solving low density subset sum problems

    Publication Year: 1983, Page(s):1 - 10
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1192 KB)

    The subset sum problem is to decide whether or not the 0-1 integer programming problem Σi=1n aixi = M; all xi = 0 or 1; has a solution, where the ai and M are given positive integers. This problem is NP-complete, and the difficulty of solving it is the basis of public key cryptosystems of knapsack type. We propose an algorithm which when given an instance of the subset sum problem searches for a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin

    Publication Year: 1983, Page(s):11 - 22
    Cited by:  Papers (8)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1417 KB)

    We present a cryptographic protocol allowing two mutually distrusting parties, A and B, each having a secret bit, to "simultaneously" exchange the values of those bits. It is assumed that initially each party presents a correct encryption of his secret bit to the other party. We develop a new tool to implement our protocol: a slightly biased symmetric coin. The key property of this coin is that fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trapdoor pseudo-random number generators, with applications to protocol design

    Publication Year: 1983, Page(s):23 - 30
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1116 KB)

    We define the class of trapdoor pseudo-random number generators, and introduce a new technique for using these in cryptography. As an application for this technique, we present a provably secure protocol for One-Bit Disclosures i.e. for giving a one-bit message in exchange for receipt. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A topological approach to evasiveness

    Publication Year: 1983, Page(s):31 - 33
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (417 KB)

    The complexity of a digraph property is the number of entries of the vertex adjacency matrix of a digraph which must be examined in worst case to determine whether the digraph has the property. Rivest and Vuillemin proved the result (conjectured by Aanderaa and Rosenberg) that every graph property that is monotone (preserved by addition of edges) and nontrivial (holds for some but not all graphs) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the security of multi-party ping-pong protocols

    Publication Year: 1983, Page(s):34 - 39
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (475 KB)

    We define a p-party ping-pong protocol and its security problem, along the lines of Dolev and Yao's definition for twoparty ping-pong protocol. In the case of two parties, it was assumed, with no loss of generality, that there exists a single saboteur in the net and the protocol was defined to be secure iff it was secure against the active interventions of one saboteur. We show that for more than ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The program complexity of searching a table

    Publication Year: 1983, Page(s):40 - 47
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1119 KB)

    Given a fixed set S of n keys, we would like to store them so that queries of the form "Is x ∈ S?" can be answered quickly. A commonly employed scheme to solve this problem uses a table to store the keys, and a special purpose program depending on S which probes the table. We analyze the tradeoff between the maximum number of probes allowable to answer a query, and the information-theoretic comple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved upper bounds on shellsort

    Publication Year: 1983, Page(s):48 - 55
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    The running time of Shellsort, with the number of passes restricted to O(log N), was thought for some time to be Θ(N3/2), due to general results of Pratt. Sedgewick recently gave an O(N4/3) bound, but extensions of his method to provide better bounds seem to require new results on a classical problem in number theory. In this paper, we use a different approach to achieve O(N1+4/√2lgN). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monte-Carlo algorithms for enumeration and reliability problems

    Publication Year: 1983, Page(s):56 - 64
    Cited by:  Papers (56)
    Request permission for commercial reuse | PDF file iconPDF (942 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum algorithms for two random sampling problems

    Publication Year: 1983, Page(s):65 - 75
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1477 KB)

    Several fast new algorithms are presented for sampling n records at random from a file containing N records. The first problem we solve deals with sampling when N is known, and the the second problem considers the case when N is unknown. The two main results in this paper are Algorithms D and Z. Algorithm D solves the first problem by doing the sampling with a small constant amount of space and in... View full abstract»

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

    Publication Year: 1983, Page(s):76 - 82
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    We present here a class of probabilistic algorithms with which one can estimate the number of distinct elements in a collection of data (typically a large file stored on disk) in a single pass, using only 0(1) auxiliary storage and 0(1) operations per element. We precisely quantify the accuracy-storage trade-offs: for instance a typical accuracy of about 5% can be achieved using only 256 binary wo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing arrangements of lines and hyperplanes with applications

    Publication Year: 1983, Page(s):83 - 91
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1588 KB)

    An optimal algorithm is presented for constructing an arrangement of hyperplanes in arbitrary dimensions. It relies on a combinatorial result that is of interest in its own right. The algorithm is shown to improve known worst-case time complexities for five problems: computing all order-k Voronoi diagrams, computing the λ-matrix, estimating halfspace queries, degeneracy testing, and finding the mi... View full abstract»

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

    Publication Year: 1983, Page(s):92 - 99
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1316 KB)

    We consider problems in computational geometry when every one of the input points is moving in a prescribed manner. We present and analyze efficient algorithms for a number of problems and prove lower bounds for some of them. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A kinetic framework for computational geometry

    Publication Year: 1983, Page(s):100 - 111
    Cited by:  Papers (43)  |  Patents (3)
    Request permission for commercial reuse | PDF file iconPDF (1813 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometric retrieval problems

    Publication Year: 1983, Page(s):112 - 121
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1130 KB)

    A large class of geometric retrieval problems has the following form. Given a set X of geometric objects, preprocess to obtain a data structure D(X). Now use D(X) to rapidly answer queries on X. We say an algorithm for such a problem has (worst-case) space-time complexity O(f(n),g(n)) if the space requirement for D(X) is O(f) and the 'locate run-time' required for each retrieval is O(g). We show t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Filtering search: A new approach to query-answering

    Publication Year: 1983, Page(s):122 - 132
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1743 KB)

    We introduce a new technique for solving problems of the following form: preprocess a set of objects so that those satisfying a given property with respect to a query object can be listed very effectively. Among well-known problems to fall into this category we find range query, point enclosure, intersection, near-neighbor problems, etc. The approach which we take is very general and rests on a ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representations of rational functions

    Publication Year: 1983, Page(s):133 - 137
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (690 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logarithmic depth circuits for algebraic functions

    Publication Year: 1983, Page(s):138 - 145
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (927 KB)

    This paper describes circuits for computation of various algebraic functions on polynomials, power series, integers, and reals for which it has been a long standing open problem to compute in depth less then (log n)2. Let R[x] be the polynomials and power series over a commutative ring which supports a fast Fourier transform and let L[x] be the polynomials and power series over the rationals L. Fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trade-offs between depth and width in parallel computation

    Publication Year: 1983, Page(s):146 - 153
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1034 KB)

    A new technique for proving lower bounds for parallel computation is introduced. This technique enables us to obtain, for the first time. non-trivial tight lower bounds for shared-memory models of parallel computation that allow simultaneous read/write access to the same memory location. The size m of the common memory is called communication width or width in short. For a wide variety of problems... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The parallel complexity of the abelian permutation group membership problem

    Publication Year: 1983, Page(s):154 - 161
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (977 KB)

    We show that the permutation group membership problem can be solved in depth (logn)3 on a Monte Carlo Boolean circuit of polynomial size in the restricted case in which the group is abelian. We also show that this restricted problem is NC1-hard for NSPACE(logn). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational complexity and the classification of finite simple groups

    Publication Year: 1983, Page(s):162 - 171
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1758 KB)

    We address the graph isomorphism problem and related fundamental complexity problems of computational group theory. The main results are these: A1. A polynomial time algorithm to test simplicity and find composition factors of a given permutation group (COMP). A2. A polynomial time algorithm to find elements of given prime order p in a permutation group of order divisible by p. A3. A polynomial ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Factoring sparse multivariate polynomials

    Publication Year: 1983, Page(s):172 - 179
    Request permission for commercial reuse | PDF file iconPDF (1056 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.