By Topic

Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on

Date 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
  • Author index

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (99 KB)
    Freely Available from IEEE
  • Single-source unsplittable flow

    Publication Year: 1996, Page(s):68 - 77
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    The max-flow min-cut theorem of Ford and Fulkerson is based on an even more foundational result, namely Menger's theorem on graph connectivity Menger's theorem provides a good characterization for the following single-source disjoint paths problem: given a graph G, with a source vertex s and terminals t1,...,tk, decide whether there exist edge-disjoint s-ti paths f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Potential of the approximation method

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

    Developing some techniques for the approximation method, we establish precise versions of the following statements concerning lower bounds for circuits that detect cliques of size s in a graph with m vertices. For 5⩽s⩽m/4, a monotone circuit computing CLIQUE(m, s) contains at least (1/2) 1.8min(√s-12,m/(4s))/ gates. If a non-monotone circuit computes CLIQUE using a “... View full abstract»

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

    Publication Year: 1996, Page(s):244 - 253
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    As increasingly large volumes of sophisticated options are traded in world financial markets, determining a “fair” price for these options has become an important and difficult computational problem. Many valuation codes use the binomial pricing model, in which the stock price is driven by a random walk. In this model, the value of an n-period option on a stock is the expected time-dis... 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 (2)
    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.
  • Static dictionaries on AC0 RAMs: query time &thetas;(√log n/log log n) is necessary and sufficient

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

    In this paper we consider solutions to the static dictionary problem on AC0 RAMs, i.e. random access machines where the only restriction on the finite instruction set is that all computational instructions are in AC0. Our main result is a tight upper and lower bound of θ(√log n/log log n) on the time for answering membership queries in a set of size n when reasona... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New coding techniques for improved bandwidth utilization

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

    The introduction of parallel models that account for communication between processors has shown that interprocessor bandwidth is often the limiting factor in parallel computing. In this paper, we introduce a new coding technique for transmitting the XOR of carefully selected patterns of bits to be communicated which greatly reduces bandwidth requirements in some settings. This technique has broade... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate checking of polynomials and functional equations

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

    The authors show how to check programs that compute polynomials and functions defined by addition theorems-in the realistic setting where the output of the program is approximate instead of exact. They present results showing how to perform approximate checking, self-testing, and self-correcting of polynomials, settling in the affirmative a question raised by Gemmell et al. (1991), and Rubinfeld a... 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 (4)
    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.
  • 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.
  • Median selection requires (2+ϵ)n comparisons

    Publication Year: 1996, Page(s):125 - 134
    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.
  • Universal stability results for greedy contention-resolution protocols

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

    In this paper we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We focus on a basic adversarial model of packet generation and path determination for which the time-averaged injection rate of packets requiring the use of any edge is limited to be less than 1. A crucial issue that arises in s... 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 (2)
    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.
  • Sampling according to the multivariate normal density

    Publication Year: 1996, Page(s):204 - 212
    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)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Short paths in expander graphs

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

    Graph expansion has proved to be a powerful general tool for analyzing the behavior of routing algorithms and the inter-connection networks on which they run. We develop new routing algorithms and structural results for bounded-degree expander graphs. Our results are unified by the fact that they are all based upon, and extend, a body of work: asserting that expanders are rich in short, disjoint p... 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
    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.
  • Probabilistic approximation of metric spaces and its algorithmic applications

    Publication Year: 1996, Page(s):184 - 193
    Cited by:  Papers (54)  |  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.
  • 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.
  • Fault-tolerant quantum computation

    Publication Year: 1996, Page(s):56 - 65
    Cited by:  Papers (27)  |  Patents (5)
    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.
  • Efficient approximate and dynamic matching of patterns using a labeling paradigm

    Publication Year: 1996, Page(s):320 - 328
    Cited by:  Papers (6)  |  Patents (6)
    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.
  • Faster deterministic sorting and searching in linear space

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

    We present a significant improvement on linear space deterministic sorting and searching. On a unit-cost RAM with word size w, an ordered set of n w-bit keys (viewed as binary strings or integers) can be maintained in O(min{[√(logn)][logn/logw+loglogn][logwloglogn]}) time per operation, including insert, delete, member search, and neighbour search. The cost for searching is worst-case while ... 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.
  • Learning linear transformations

    Publication Year: 1996, Page(s):359 - 368
    Cited by:  Papers (2)
    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.
  • Universal data compression and portfolio selection

    Publication Year: 1996, Page(s):534 - 538
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    The authors consider universal data compression, universal portfolio selection (online portfolio algorithms) and the relationship of both to information theory. Apparently the fundamental minimax redundancy game in data compression and the minimax regret game for the growth rate of wealth in investment have the same answer. There is also a duality between entropy rate and the growth rate of wealth View full abstract»

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