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 (10)
    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
  • A decision procedure for unitary linear quantum cellular automata

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

    Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quantum machine: it has to be unitary, that is its time evolution operator has to be a unitary transformation. In this paper we give an efficient algorithm to decide if a linear quantum cellular automaton is unitary. The comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

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

    We present a randomized procedure for rounding fractional perfect matchings to (integral) matchings. If the original fractional matching satisfies any linear inequality, then with high probability, the new matching satisfies that linear inequality in an approximate sense. This extends the well-known LP rounding procedure of Raghavan and Thompson (1987), which is usually used to round fractional so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The regularity lemma and approximation schemes for dense problems

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

    There are two main contributions of the present paper. In the first, we use the constructive version of the Regularity Lemma to give directly simple polynomial time approximation schemes for several graph “subdivision” problems in dense graphs including the Max Cut problem, the Graph Bisection problem, the Min l-way cut problem and Graph Separator problem. Arora, Karger and Karpinski (... View full abstract»

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

    Publication Year: 1996, Page(s):504 - 513
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    Current secure multiparty protocols have the following deficiency. The public transcript of the communication can be used as an involuntary commitment of the parties to their inputs and outputs. Thus parties can be later coerced by some authority to reveal their private data. Previous work that has pointed this interesting problem out contained only partial treatment. The authors present the first... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial time approximation schemes for Euclidean TSP and other geometric problems

    Publication Year: 1996, Page(s):2 - 11
    Cited by:  Papers (44)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 KB)

    We present a polynomial time approximation scheme for Euclidean TSP in ℜ2. Given any n nodes in the plane and ε>0, the scheme finds a (1+ε)-approximation to the optimum traveling salesman tour in time n0(1/ε). When the nodes are in ℜd, the running time increases to n(O˜(logd-2n)/εd-1) The previous best appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gadgets, approximation, and linear programming

    Publication Year: 1996, Page(s):617 - 626
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    The authors present a linear-programming based method for finding “gadgets”, i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A key step in this method is a simple observation which limits the search space to a finite one. Using this new method they present a number of new, computer-constructed gadgets for several different redu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simplified and improved resolution lower bounds

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

    We give simple new lower bounds on the lengths of resolution proofs for the pigeonhole principle and for randomly generated formulas. For random formulas, our bounds significantly extend the range of formula sizes for which non-trivial lower bounds are known. For example, we show that with probability approaching 1, any resolution refutation of a randomly chosen 3-CNF formula with at most n6/... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the knowledge complexity of 𝒩𝒫

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

    The authors show that if a language has an interactive proof of logarithmic statistical knowledge-complexity, then it belongs to the class 𝒜ℳ∩co-𝒜ℳ. Thus, if the polynomial time hierarchy does not collapse, then 𝒩𝒫-complete languages do not have logarithmic knowledge complexity. Prior to this work, there was no indication that would contradict 𝒩𝒫 languag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast fault-tolerant concurrent access to shared objects

    Publication Year: 1996, Page(s):570 - 579
    Cited by:  Papers (7)  |  Patents (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 KB)

    The authors consider a synchronous model of distributed computation in which n nodes communicate via point-to-point messages, subject to the following constraints: (i) in a single “step”, a node can only send or receive O(logn) words, and (ii) communication is unreliable in that a constant fraction of all messages are lost at each step due to node and/or link failures. They design and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Median selection requires (2+ϵ)n comparisons

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

    Improving a long standing result of Bent and John (1985), we obtain a (2+ε)n lower bound (for some fixed ε>0) on the number of comparisons required, in the worst case, for selecting the median of n elements. The new lower bound is obtained using a weight function that allows us to combine leaf counting and adversary arguments 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 (2)
    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.
  • Factoring graphs to bound mixing rates

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

    This paper develops a new technique for bounding the mixing rate of a Markov chain by decomposing the state space into factors. The first application is an efficient Monte Carlo Markov chain algorithm for generating random three-colorings of 2-dimensional lattice regions. This provides a rigorous tool for studying some properties of the 3-state Potts model and the ice model from statistical mechan... 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.
  • Maximum likelihood decoding of Reed Solomon codes

    Publication Year: 1996, Page(s):164 - 172
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    We present a randomized algorithm which takes as input n distinct points {(xi,yi)}i=1n from F×F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable a of degree at most d which agree with the given set of points in at least t places (i.e., yi=f(xi) for at... 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.
  • Binary space partitions for fat rectangles

    Publication Year: 1996, Page(s):482 - 491
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    The authors consider the practical problem of constructing binary space partitions (BSPs) for a set S of n orthogonal, nonintersecting, two-dimensional rectangles in R3 such that the aspect ratio of each rectangle in S is at most α, for some constant a α⩾1. They present an n2O(√logn)-time algorithm to build a binary space partition of size n2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal dynamic interval management in external memory

    Publication Year: 1996, Page(s):560 - 569
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB)

    The authors present a space- and I/O-optimal external-memory data structure for answering stabbing queries on a set of dynamically maintained intervals. The data structure settles an open problem in databases and I/O algorithms by providing the first optimal external-memory solution to the dynamic interval management problem, which is a special case of 2-dimensional range searching and a central p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving systems of polynomial congruences modulo a large prime

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

    We consider the following polynomial congruences problem: given a prime p, and a set of polynomials f1,...,fm∈ Fp[x1,...,xn] of total degree at most d, solve the system f1=...=fm=0 for solution(s) in Fpn. We give a randomized algorithm for the decision version of this problem. ... 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 (44)  |  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.
  • Load balancing and density dependent jump Markov processes

    Publication Year: 1996, Page(s):213 - 222
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    We provide a new approach for analyzing both static and dynamic randomized load balancing strategies. We demonstrate the approach by providing the first analysis of the following model: customers arrive as a Poisson stream of rate λn, λ<1, at a collection of n servers. Each customer chooses some constant d servers independently and uniformly at random from the n servers... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic approximation of metric spaces and its algorithmic applications

    Publication Year: 1996, Page(s):184 - 193
    Cited by:  Papers (94)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    This paper provides a novel technique for the analysis of randomized algorithms for optimization problems on metric spaces, by relating the randomized performance ratio for any, metric space to the randomized performance ratio for a set of “simple” metric spaces. We define a notion of a set of metric spaces that probabilistically-approximates another metric space. We prove that any met... 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 (14)
    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.