25th Annual Symposium onFoundations of Computer Science, 1984.

24-26 Oct. 1984

Filter Results

Displaying Results 1 - 25 of 61
  • 25th Annual Symposium on Foundations of Computer Science [front matter]

    Publication Year: 1984, Page(s):i - xii
    Request permission for commercial reuse | PDF file iconPDF (329 KB)
    Freely Available from IEEE
  • Log Depth Circuits For Division And Related Problems

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

    We present optimal depth Boolean circuits (depth O(log n)) for integer division, powering, and multiple products. We also show that these three problems are of equivalent uniform depth and space complexity. In addition, we describe an algorithm for testing divisibility that is optimal for both depth and space. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sublinear parallel algorithm for computing the greatest common divisor of two integers

    Publication Year: 1984, Page(s):7 - 11
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (481 KB)

    The advent of practical parallel processors has caused a reexamination of many existing algorithms with the hope of discovering a parallel implementation. One of the oldest and best known algorithms is Euclid's algorithm for computing the greatest common divisor (GCD). In this paper we present a parallel algorithm to compute the GCD of two integers. The two salient features of the algorithm are: t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding biconnected componemts and computing tree functions in logarithmic parallel time

    Publication Year: 1984, Page(s):12 - 20
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (859 KB)

    We propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in 0[n+m] time and space on a graph of n vertices and m edges. A parallel implmentation runs in 0[log n] time and 0[n+m] space using 0[n+m] processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in 0[n/sup 2/p] time and 0[n/sup ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Very Fast Parallel Matrix and Polynomial Arithmetic

    Publication Year: 1984, Page(s):21 - 30
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (854 KB)

    We present very efficient arithmetic circuits for the computation of the determinants and inverse of band matrices and for interpolation and polynomial arithmetic over arbitrary ground fields. For input size n the circuits for band matrix inversion (for constant band width) over infinite fields, and the circuits for polynomial arithmetic over arbitrary fields, have optimal depth 0(log n) and polyn... View full abstract»

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

    Publication Year: 1984, Page(s):31 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (455 KB)

    A fast parallel computation for large powers of an integer module another integer is presented, assuming that the modulus has only small prime factors View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polymorphic Arrays: A Novel VLSI Layout For Systolic Computers

    Publication Year: 1984, Page(s):37 - 45
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    This paper proposes a novel architecture for massively parallel systolic computers, which is based on results from lattice theory. In the proposed architecture, each processor is connected to four other processors via constant-lenght wires in an regular borderless pattern. The mapping of processes to processors is continuous, and the architecture guarantees exceptional load uniformity for rectangu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing Systolic Algorithms Using Sequential Machines

    Publication Year: 1984, Page(s):46 - 55
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (857 KB)

    We offer a methodology for simplifying the design and analysis of systolic systems. Specifically, we give characterization of systolic arrays in terms of (single processor) sequential machines which are easier to analyze and to program. We give several examples to illustrate the design methodology. In particular, we show how systolic arrays can be easily designed to implement priority queues, inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication

    Publication Year: 1984, Page(s):56 - 64
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    Lower bounds for sequential and parallel random access machines (RAM's, WRAM's) and distributed systems of RAM's (DRAM's) are proved. We show that, when p processors instead of one are available, the computation of certain functions cannot be speeded up by a factor p but only by a factor 0 (log(p)). For DRAM's with communication graph of degree c a maximal speedup 0 (log(c)) can be achieved for th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • River Routing Every Which Way, But Loose

    Publication Year: 1984, Page(s):65 - 73
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (909 KB)

    A solution to the 'Detailed Routing given a Homotopy' (DRH) problem is given in O(n + mlogm + D(m)) operations. The solution uses n + mlogm homotopy queries that are elementary; they are answerable based solely on "local properties" of modules, terminals, and wire connections. In addition, we need O(m) more complex queries, which are represented in the D(m) term. These queries must account for the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding Planar Graphs In Seven Pages

    Publication Year: 1984, Page(s):74 - 83
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (779 KB)

    This paper investigates the problem of embedding planar graphs in books of few pages. An efficient algorithm for embedding a planar graph in a book establishes an upper bound of seven pages for any planar graph. This disproves a conjecture of Bernhart and Kainen that the pagenumber of a planar graph can be arbitrarily large. It is also shown that the stellations of K/sub 3/ have pagenumber three, ... View full abstract»

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

    Publication Year: 1984, Page(s):84 - 88
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (474 KB)

    We show a nontrivial tradeoff between the communication c and time t required to compute a collection of values whose dependencies form a grid, i.e., value (i,j) depends on the values (i-1,j) and (i,j-1). No matter how we share the responsibility for computing the nodes of the n x n grid among processors, the law ct = /spl Omega/(n/sup 3/) must hold. Further, there must be a single path through th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Comparative Study Of X-Tree, Pyramid And Related Machines

    Publication Year: 1984, Page(s):89 - 99
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1110 KB)

    The intent of this paper was to investigate data movement techniques for some special networks which are derived from the binary tree and the mesh machines. We presented optimal bounds for some problems and close bounds for others. A new lower bound technique which incorporates the entire network topdogy was introduced. We believe that this technique is quite powerful and can be exploited to yield... View full abstract»

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

    Publication Year: 1984, Page(s):100 - 108
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (682 KB)

    Let X and Y be two random variables with probability distribution p(x,y), joint entropy H(X,Y) and conditional entropies H(X \ Y) and H(Y \ X) . Person P/sub x/ knows X and person P/sub Y/ knows Y. They communicate over a noiseless two-way channel so that both know X and Y. It is proved that, on the average, at least H(X \ Y) + H(Y \ X) bits must be exchanged and that H(X,Y) + 2 bits are sufficien... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower Bounds On Communication Complexity In Distributed Computer Networks

    Publication Year: 1984, Page(s):109 - 117
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (903 KB)

    We prove that for almost all boolean functions f , the conmunication complexity of f on a linear array with p+1 processors is approximately p times its commuication complexity on a system with two processors. We use this result to develop a technique for establishing lower bounds on communication complexity on general networks by simulating them on linear arrays. Using this technique, we derive op... View full abstract»

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

    Publication Year: 1984, Page(s):118 - 126
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (643 KB)

    We study (unbounded error) probabilistic communication complexity. Our new results include -one way and two complexities differ by at most 1 - certain functions like equality and the verification of Hamming distance have upper bounds that are considerably better than their counterparts in deterministic, nondeterministic, or bounded error probabilistic model - there exists a function which requires... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Communication With Limited Buffers

    Publication Year: 1984, Page(s):127 - 136
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (661 KB)

    Currently known parallel communication schemes allow n nodes interconnected by arcs (in such a way that each node meets only a fixed number of arcs) to transmit n packets according to an arbitrary permutation in such a way that (1) only one packet is sent over a given arc at any step, (2) at most 0(log n) packets reside at a given node at any time and (3) with high probability, each packet arrives... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Multi-Tree Approach To Reliability In Distributed Networks

    Publication Year: 1984, Page(s):137 - 147
    Cited by:  Papers (26)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (893 KB)

    Consider a network of asynchronous processors communicating by sending messages over unreliable lines. There are many advantages to restrict all communications to a spanning tree. To overcome the possible failure of k<k edges, we describe a communication protocol which uses k rooted spanning trees having the property that for every vertex v the paths from v to the root are edge-disjoint. A line... 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 Fault Diagnosability

    Publication Year: 1984, Page(s):148 - 156
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (641 KB)

    We present the first polynomial time algorithm for testing t-diagnosability. This is a significant advance in system level fault diagnosis. We also presented part of our analysis of t/s-diagnosability, including the fact that it is co-NP-complete and that there are polynomial algorithms for t/t and t/(t+1)-diagnosability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flipping Coins In Many Pockets (Byzantine Agreement On Uniformly Random Values)

    Publication Year: 1984, Page(s):157 - 170
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (983 KB)

    It was recently shown by Michael Rabin that a sequence of random 0-1 values, prepared and distributed by a trusted "dealer," can be used to achieve Byzantine agreement in constant expected time in a network of processors. A natural question is whether it is possible to generate these values uniformly at random within the network. In this paper we present a cryptography based protocol for agreernen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How To Share Memory In A Distributed System

    Publication Year: 1984, Page(s):171 - 180
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    We study the power of shared-memory in models of parallel computation. We describe a novel distributed data structure that eliminates the need for shared mernory without significantly increasing the run time of the parallel computation. We also show how a complete network of processors can deterministicly simulate one PRAM step in O(log n(loglog n)2) time, when both models use n process... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph Bisection Algorithins With Good Average Case Behavior

    Publication Year: 1984, Page(s):181 - 192
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1124 KB)

    We describe a polynomial time algorithm that, for every input graph, either outputs the minimum bisection of the graph or halts without output. More importantly, we show that the algorithm chooses the former course with high probability for many natural classes of graphs. In particular, for every fixed d⩾3, all suffciently large n and all b = o(n1-(1/[(d+1)/2]), the algorithm finds the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Average-Case Analysis of Some On-Line Algorithms for Bin Packing

    Publication Year: 1984, Page(s):193 - 200
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (807 KB)

    In this paper we give tighter bounds than were previously known for the performance of the bin packing algorithms Bets Fit and First Fit when the inputs are uniformly distributed on [0,1]. We also give a general lower bound for the performance of any on-line bin packing algorithm. These results are proven by analyzing problems concerning matching random points in a unit square. We give a new lower... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Verification For Spanning Trees

    Publication Year: 1984, Page(s):201 - 206
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (333 KB)

    Given a rooted tree with values associated with the n vertices and a set A of directed paths (queries), we describe an algorithm which finds the maximum value of every one of the given paths, and which uses only 5n + n log [(|A|+n)/n] comparisons. This leads to a spanning tree verification algorithm using O(n+e) comparisons in a graph with n vertices and e edges. No implementation is offered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Algrithm To Find All 'Bidirectional' Edges Of An Undirected Graph

    Publication Year: 1984, Page(s):207 - 216
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1043 KB)

    An efficient algorithm for the All-Bidirectional-Edges Problem is presented. The All-Bidirectional-Edges Problem is to find an edge-labelling of an undirected network, G = (V,E), with a source and a sink, such that an edge [u,v] /spl epsi/ E is labelled (u,v) or (v,u) (or both) depending on the existence of a (simple) path from the source to sink that visits the vertices u and v, in the order u,v ... View full abstract»

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