Proceedings., 33rd Annual Symposium on Foundations of Computer Science

24-27 Oct. 1992

Filter Results

Displaying Results 1 - 25 of 78
  • Proceedings 33rd Annual Symposium on Foundations of Computer Science (Cat. No.92CH3188-0)

    Publication Year: 1992
    Request permission for commercial reuse | PDF file iconPDF (83 KB)
    Freely Available from IEEE
  • Fully dynamic biconnectivity in graphs

    Publication Year: 1992, Page(s):50 - 59
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    The author presents an algorithm for maintaining the bi-connected components of a graph during a sequence of edge insertions and deletions. It requires linear storage and preprocessing time. The amortized running time for insertions and for deletions is O(m2/3 ), where m is the number of edges in the graph. Each query of the form `Are the vertices u and v biconnected?' can be answered i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A mildly exponential approximation algorithm for the permanent

    Publication Year: 1992, Page(s):320 - 326
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    An approximation algorithm for the permanent of an n×n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp (0(n1/2 log2 n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time complexity of the form eθ(n) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Waste makes haste: tight bounds for loose parallel sorting

    Publication Year: 1992, Page(s):628 - 637
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    Conventional parallel sorting requires the n input keys to be output in an array of size n, and is known to take Ω(log n/log log n) time using any polynomial number of processors. The lower bound does not apply to the more `wasteful' convention of padded sorting, which requires the keys to be output in sorted order in an array of size (1+o(1))n. The authors give very fast randomised CRCW PRA... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sparsification-a technique for speeding up dynamic graph algorithms

    Publication Year: 1992, Page(s):60 - 69
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    The authors provide data structures that maintain a graph as edges are inserted and deleted, and keep track of the following properties: minimum spanning forests, best swap, graph connectivity, and graph 2-edge-connectivity, in time O(n1/2log(m/n)) per change; 3-edge-connectivity, in time O(n2/3) per change; 4-edge-connect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Amplification and percolation [probabilistic Boolean functions]

    Publication Year: 1992, Page(s):258 - 267
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    The authors extend R.B. Boppana's results (1989) in two ways. They first show that his two lower bounds hold for general read-once formulae, not necessarily monotone, that may even include exclusive-or gates. They are then able to join his two lower bounds together and show that any read-once, not necessarily monotone, formula that amplifies ( p-1/n,p+1... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theory of wormhole routing in parallel computers

    Publication Year: 1992, Page(s):563 - 572
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    Virtually all theoretical work on message routing in parallel computers has dwelt on packet routing: messages are conveyed as packets, an entire packet can reside at a node of the network, and a packet is sent from the queue of one node to the queue of another node until its reaches its destination. The current trend in multicomputer architecture, however, is to use wormhole routing. In wormhole r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Competitive analysis of financial games

    Publication Year: 1992, Page(s):327 - 333
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    In the unidirectional conversion problem an on-line player is given the task of converting dollars to yen over some period of time. Each day, a new exchange rate is announced and the player must decide how many dollars to convert. His goal is to minimize the competitive ratio. defined as supE (POPT(E)/PXE) where E ranges over exchange rate sequences. POPT View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of parallel prefix problems on small domains

    Publication Year: 1992, Page(s):638 - 647
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The authors study the complexity of some prefix problems in the CRCW PRAM model. The main result is an Ω(α(n)) lower bound for chaining, matching a previous upper bound and solving an open problem. They give reductions to show an Ω(α(n)) lower bound on the complexity of the prefix maxima and range maxima problems even when the domain is {1,...,n}. An interesting consequence... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-knowledge proofs of knowledge without interaction

    Publication Year: 1992, Page(s):427 - 436
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    A zero-knowledge proof system of knowledge is a protocol between two parties called the prover and the verifier. The prover wants to convince the verifier that he `knows' the proof of a given theorem without revealing any additional information. This is different from a zero-knowledge proof system of membership where the prover convinces the verifier only of the veridicity of the statement. Zero-k... View full abstract»

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

    Publication Year: 1992, Page(s):363 - 371
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Partial types for the λ-calculus were introduced by Thatte (1988) as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persistent data. He showed that type inference for partial types was semidecidable. Decidability remained open until O'Keefe and Wand gave an exponential time algorithm for type inference. The authors give an O(n3) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On four-connecting a triconnected graph

    Publication Year: 1992, Page(s):70 - 79
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    The author considers the problem of finding a smallest set of edges whose addition four-connects a triconnected graph. This is a fundamental graph-theoretic problem that has applications in designing reliable networks. He presents an O(nα(m,n)+m) time sequential algorithm for four-connecting an undirected graph G that is triconnected by adding the smallest number of edges, where n and m are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic decision trees and Euler characteristics

    Publication Year: 1992, Page(s):268 - 277
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    For any set S⊆Rn, let χ(S) denote its Euler characteristic. The author shows that any algebraic computation tree or fixed-degree algebraic decision tree must have height Ω(log|χ(S)|)for deciding the membership question of a compact semi-algebraic set S. This extends a result by A. Bjorner, L. Lovasz and A. Yao where it was ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing a shortest k-link path in a polygon

    Publication Year: 1992, Page(s):573 - 582
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    The authors consider the problem of finding a shortest polygonal path from s to t within a simple polygon P, subject to the restriction that the path have at most k links (edges). They give an algorithm to compute a k-link path with length at most (1 + ε) times the length of a shortest k-link path, for any error tolerance ε>0. The algorithm runs in time O(n3k3 lo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling

    Publication Year: 1992, Page(s):334 - 343
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    The authors prove a lower bound of Ω(log n/log log n) on the competitive ratio of any (deterministic or randomised) distributed algorithm for solving the mobile user problem on certain networks of n processors. The lower bound holds for various networks, including the hypercube, any network with sufficiently large girth, and any highly expanding graph. A similar Ω(log n/log log n) lowe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate max flow on small depth networks

    Publication Year: 1992, Page(s):648 - 658
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    The author considers the maximum flow problem on directed acyclic networks with m edges and depth r (length of the longest s-t path). The main result is a new deterministic algorithm for solving the relaxed problem of computing an s-t flow of value at least (1-ε) of the maximum flow. For instances where r and ε-1 are small (i.e., O(polylog(m))), this algorithm is in NC and use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast unimodular reduction: planar integer lattices

    Publication Year: 1992, Page(s):437 - 446
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    The author shows that a shortest basis for the 2-dimensional lattice Λ(u, v) generated by an input pair u, v∈Z 2 can be computed in O(M(n) log n) where n is the bit-size of the input numbers and M(n) is the complexity of multiplying two n-bit integers. This generalizes Schonhage's technique (1971) for fast integer GCD to a higher dimension View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the completeness of object-creating query languages

    Publication Year: 1992, Page(s):372 - 379
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    Recently, various database query languages have been considered that have the ability to create new domain elements. These languages, however, are not complete in the sense of Abiteboul and Kanellakis (1989). They provide a precise characterization for the class of queries that can be expressed in these languages. They call this class the constructive queries and motivate this term by establishing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximizing non-linear concave functions in fixed dimension

    Publication Year: 1992, Page(s):676 - 685
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    Consider a convex set P in Rd and a piece wise polynomial concave function F: P→R. Let A be an algorithm that given a point x ∈ IRd computes F(x) if x ∈ P, or returns a concave polynomial p such that p(x) <0 but for any y ∈ P, p(y) ⩾ 0. The author assumes that d is fixed and that all comparisons in A depend on the sign of polynomia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A subexponential algorithm for abstract optimization problems

    Publication Year: 1992, Page(s):464 - 472
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    An abstract optimization problem (AOP) is a triple (H,<,φ) where H is a finite set, < a linear order on 2H and φ an oracle that, for given F⊆G⊆H, determines whether F=min(2 G), and if not, returns a smaller set. To solve the problem means to find min(2H). The author presents a randomized algorithm that solves any AOP with an expected number ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proof verification and hardness of approximation problems

    Publication Year: 1992, Page(s):14 - 23
    Cited by:  Papers (137)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that used O(f(n)) random bits, queries O(g(n)) bits of its oracle and behaves as follows: If x∈L then there exists an oracle y such that the machine accepts for all random choices but if x∉L then for every oracle y the machine rejects with high probability. Arora an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Read-thrice DNF is hard to learn with membership and equivalence queries

    Publication Year: 1992, Page(s):523 - 532
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    A general technique is developed to obtain nonlearnability results in the model of exact learning from equivalence and membership queries. The technique is applied to show that, assuming NP≠co-NP, there does not exist a polynomial-time membership and equivalence query algorithm for exactly learning read-thrice DNF formulas-boolean formulas in disjunctive normal form where each variable appears ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic half-space reporting, geometric optimization, and minimum spanning trees

    Publication Year: 1992, Page(s):80 - 89
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    The authors describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, they obtain efficient dynamic algorithms for a number of geometric problems, including closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, diameter, and Euclidean minimum spanning tree View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Separating the communication complexities of MOD m and MOD p circuits

    Publication Year: 1992, Page(s):278 - 287
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    The author proves in this paper that it is much harder to evaluate depth-2, size-N circuits with MOD m gates than with MOD p gates by k-party communication protocols: he shows a k-party protocol which communicates O(1) bits to evaluate circuits with MOD p gates, while evaluating circuits with MOD m gates needs Ω(N View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient minimum cost matching using quadrangle inequality

    Publication Year: 1992, Page(s):583 - 592
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    The authors present efficient algorithms for finding a minimum cost perfect matching, and for solving the transportation problem in bipartite graphs, G = (Red ∪ Blue, Red × Blue), where |Red| = n, |Blue| = m, n ⩽ m, and the cost function obeys the quadrangle inequality. The first results assume that all the red points and all the blue points lie on a curve that is homeomorphic to eit... View full abstract»

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