Proceedings of 37th Conference on Foundations of Computer Science

14-16 Oct. 1996

Filter Results

Displaying Results 1 - 25 of 67
  • Proceedings of 37th Conference on Foundations of Computer Science

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (355 KB)
    Freely Available from IEEE
  • Approximate strip packing

    Publication Year: 1996, Page(s):31 - 36
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    We present an approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm finds a packing of n rectangles whose total height is within a factor of (1+/spl epsiv/) of optimal, and has running time polynomial both in n and in 1//spl epsiv/. It is based on a reduction to fractional bin-packi... View full abstract»

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

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (99 KB)
    Freely Available from IEEE
  • The Boolean isomorphism problem

    Publication Year: 1996, Page(s):422 - 430
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    We investigate the computational complexity of the Boolean isomorphism problem (BI): on input of two Boolean formulas F and G decide whether there exists a permutation of the variables of G such that F and G become equivalent. Our main result is a one-round interactive proof for BI, where the verifier has access to an NP oracle. To obtain this, we use a recent result from learning theory by N. Bsh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient approximate and dynamic matching of patterns using a labeling paradigm

    Publication Year: 1996, Page(s):320 - 328
    Cited by:  Papers (15)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    A key approach in string processing algorithmics has been the labeling paradigm which is based on assigning labels to some of the substrings of a given string. If these labels are chosen consistently, they can enable fast comparisons of substrings. Until the first optimal parallel algorithm for suffix tree construction was given by the authors in 1994 the labeling paradigm was considered not to be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrepancy sets and pseudorandom generators for combinatorial rectangles

    Publication Year: 1996, Page(s):412 - 421
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space that approximates the volume of any combinatorial rectangle in [n]n to within o(1) error. The construction extends the previous techniques for the analogous hitting set problem, most notably via discrepancy pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic routing with bounded buffers: turning offline into online protocols

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

    In this paper we present a deterministic protocol for routing arbitrary permutations in arbitrary networks. The protocol is analyzed in terms of the size of the network and the routing number of the network. Given a network H of size n, the routing number of H is defined as the maximum over all permutations π on [n] of the minimal number of steps to route π offline in H. We can show that for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An 8-approximation algorithm for the subset feedback vertex set problem

    Publication Year: 1996, Page(s):310 - 319
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    We present an 8-approximation algorithm for the problem of finding a minimum weight subset feedback vertex set. The input in this problem consists of an undirected graph G=(V,E) with vertex weights w(v) and a subset of vertices S called special vertices. A cycle is called interesting if it contains at least one special vertex. A subset of vertices is called a subset feedback vertex set with respec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path coloring on the mesh

    Publication Year: 1996, Page(s):400 - 409
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edge disjoint. Our objective is to minimize the number of colors used. This problem was raised by A. Aggarwal et al. (1994) and P. Raghavan and E. Upfal (1994) as a model for routing in all-optical networks. It is also relat... View full abstract»

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

    Publication Year: 1996, Page(s):612 - 616
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    The authors provide an O˜(n2) time randomized algorithm to check whether a given operation f:S×S→S is associative (letting n=|S|). They prove this performance is optimal (up to polylogarithmic factors) even in case the operation is “cancellative”. No sub-n3 algorithm was previously known for this task. More generally they give an O(nc )... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant quantum computation

    Publication Year: 1996, Page(s):56 - 65
    Cited by:  Papers (51)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer making long computations impossible. A further dif... View full abstract»

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

    Publication Year: 1996, Page(s):359 - 368
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    We present a polynomial time algorithm to learn (in Valiant's PAC model) an arbitrarily oriented cube in n-space, given uniformly distributed sample points from it. In fact, we solve the more general problem of learning, in polynomial time, a linear (affine) transformation of a product distribution View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A 3-approximation for the minimum tree spanning k vertices

    Publication Year: 1996, Page(s):302 - 309
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    In this paper we give a 3-approximation algorithm for the problem of finding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximation algorithm for the minimum tour that visits any k-vertices View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivalence in finite-variable logics is complete for polynomial time

    Publication Year: 1996, Page(s):264 - 273
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB)

    How difficult is it to decide whether two finite structures can be distinguished in a given logic? For first order logic, this question is equivalent to the graph isomorphism problem with its well-known complexity theoretic difficulties. Somewhat surprisingly, the situation is much clearer when considering the fragments Lk of first-order logic whose formulae contain at most k (free or b... View full abstract»

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

    Publication Year: 1996, Page(s):580 - 589
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    The authors consider the tolerance of data structures to memory faults. They observe that many pointer-based data structures (e.g. linked lists, trees, etc.) are highly nonresilient to faults. A single fault in a linked list or tree may result in the loss of the entire set of data. They present a formal framework for studying the fault tolerance properties of pointer-based data structures, and pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sampling according to the multivariate normal density

    Publication Year: 1996, Page(s):204 - 212
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    This paper deals with the normal density of n dependent random variables. This is a function of the form: ce(-xTAx) where A is an n×n positive definite matrix, a: is the n-vector of the random variables and c is a suitable constant. The first problem we consider is the (approximate) evaluation of the integral of this function over the positive orthant ∫(x1=0)&i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general approach to dynamic packet routing with bounded buffers

    Publication Year: 1996, Page(s):390 - 399
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    We prove a sufficient condition for the stability of dynamic packet routing algorithms. Our approach reduces the problem of steady state analysis to the easier and better understood question of static routing. We show that certain high probability and worst case bounds on the quasistatic (finite past) performance of a routing algorithm imply bounds on the performance of the dynamic version of that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The optimal path-matching problem

    Publication Year: 1996, Page(s):78 - 85
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we present results implying the polynomial-time solvability of the two problems. We also use our results to give the first strongly polynomial separation algorithm for the convex hull of matchable sets of a graph, and the first polynomial-time algorithm to compute the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient self-testing/self-correction of linear recurrences

    Publication Year: 1996, Page(s):602 - 611
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    The authors consider the problem of designing self-testers/self-correctors for functions defined by linear recurrences. They present the first complete package of efficient and simple self-testers, self-correctors, and result-checkers for such functions. The results are proved by demonstrating an efficient reduction from this problem to the problem of testing linear functions over certain matrix g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial simulations of decohered quantum computers

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

    Recently it has become clear, that a key issue in quantum computation is understanding how interaction with the environment, or “decoherence”, affects the computational power of quantum computers. We adopt the standard physical method of describing systems which are interwound with their environment by “density matrices”, and within this framework define a model of decohere... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree data structures for N-body simulation

    Publication Year: 1996, Page(s):224 - 233
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    In this paper, we study data structures for use in N-body simulation. We concentrate on the spatial decomposition tree used in particle-cluster force evaluation algorithms such as the Barnes-Hut algorithm. We prove that a k-d tree is asymptotically inferior to a spatially balanced tree. We show that the worst case complexity of the force evaluation algorithm using a k-d tree is Θ(nlog3<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral partitioning works: planar graphs and finite element meshes

    Publication Year: 1996, Page(s):96 - 105
    Cited by:  Papers (30)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Spectral partitioning methods use the Fiedler vector-the eigenvector of the second-smallest eigenvalue of the Laplacian matrix-to find a small separator of a graph. These methods are important components of many scientific numerical algorithms and have been demonstrated by experiment to work extremely well. In this paper, we show that spectral partitioning methods work well on bounded-degree plana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New lower bounds for halfspace emptiness

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

    The author derives a lower bound of Ω(n4/3) for the halfspace emptiness problem: given a set of n points and n hyperplanes in R5, is every point above every hyperplane? This matches the best known upper bound to within polylogarithmic factors, and improves the previous best lower bound of Ω(nlogn). The lower bound applies to partitioning algorithms in whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • All pairs almost shortest paths

    Publication Year: 1996, Page(s):452 - 461
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Let G=(V,E) be an unweighted undirected graph on n vertices. A simple argument shows that computing all distances in G with an additive one-sided error of at most 1 is as hard as Boolean matrix multiplication. Building on recent work of D. Aingworth et al. (1996), we describe an O˜(min{n3/2m1/2,n7/3 }) time algorithm APASP2 for computing all distan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the applications of multiplicity automata in learning

    Publication Year: 1996, Page(s):349 - 358
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    The learnability of multiplicity automata has attracted a lot of attention, mainly because of its implications on the learnability of several classes of DNF formulae. The authors further study the learnability of multiplicity automata. The starting point is a known theorem from automata theory relating the number of states in a minimal multiplicity automaton for a function f to the rank of a certa... View full abstract»

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