Proceedings 38th Annual Symposium on Foundations of Computer Science

20-22 Oct. 1997

Filter Results

Displaying Results 1 - 25 of 65
  • Proceedings 38th Annual Symposium on Foundations of Computer Science

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (277 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1997, Page(s):605 - 606
    Request permission for commercial reuse | PDF file iconPDF (94 KB)
    Freely Available from IEEE
  • Hamiltonian cycles in solid grid graphs

    Publication Year: 1997, Page(s):496 - 505
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    A grid graph is a finite node induced subgraph of the infinite two dimensional integer grid. A solid grid graph is a grid graph without holes. For general grid graphs, the Hamiltonian cycle problem is known to be NP complete. We give a polynomial time algorithm for the Hamiltonian cycle problem in solid grid graphs, resolving a longstanding open question posed by A. Itai et al. (1982). In fact, ou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing flow time nonclairvoyantly

    Publication Year: 1997, Page(s):345 - 352
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    We consider the problem of scheduling a collection of dynamically arriving jobs with unknown execution times so as to minimize the average response/flow time. This is the classic CPU scheduling problem faced by time sharing operating systems. In the standard 3-field scheduling notation this is the nonclairvoyant version of 1|pmtn, rj|ΣFj. Its easy to see that every algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge-connectivity augmentation preserving simplicity

    Publication Year: 1997, Page(s):486 - 495
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    Given a simple graph G=(V, E), the goal is to find a smallest set F of new edges such that G=(V, E∪F) is κ edge connected and simple. Very recently this problem was shown to be NP hard by T. Jordan (1997). We prove that if OPTPκ is high enough-depending on κ only-then OPTSκ=OPTPκ holds, where OPT View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic superimposed coding with applications to pattern matching

    Publication Year: 1997, Page(s):127 - 136
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    A superimposed code is a set of binary vectors having the property that no vector is contained in a boolean sum (i.e. bitwise OR) of a small number of others. Such codes are used in information retrieval for constructing so-called signature files; they also have applications in other areas. In this paper we introduce a new notion of data-dependent superimposed codes and give a deterministic algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The competitive analysis of risk taking with applications to online trading

    Publication Year: 1997, Page(s):336 - 344
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Competitive analysis is concerned with minimizing a relative measure of performance. When applied to financial trading strategies, competitive analysis leads to the development of strategies with minimum relative performance risk. This approach is too inflexible. Many investors are interested in managing their risk: they may be willing to increase their risk for some form of reward. They may also ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding an even hole in a graph

    Publication Year: 1997, Page(s):480 - 485
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    A hole in a graph is a chordless cycle of length greater than three. In this paper we present a decomposition theorem for graphs that contain no even hole. This theorem yields a polytime algorithm to recognize whether a graph contains an even hole View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Succinct representation of balanced parentheses, static trees and planar graphs

    Publication Year: 1997, Page(s):118 - 126
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree and balanced parenthesis expression. Our representations use an amount of space within a lower order term of the information theoretic minimum and support, in constant time, a richer set of navigational operations than has previously been considered in similar work. In the case of binary ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constant depth circuits and the Lutz hypothesis

    Publication Year: 1997, Page(s):595 - 604
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    Resource-bounded measure theory is a study of complexity classes via an adaptation of the probabilistic method. The central hypothesis in this theory is the assertion that NP does not have measure zero in Exponential Time. This is a quantitative strengthening of NP≠P. We show that the analog in P of this hypothesis fails dramatically. In fact, we show that NTIME[n1/11] has measure ze... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nearly tight bounds on the learnability of evolution

    Publication Year: 1997, Page(s):524 - 533
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    Evolution is often modeled as a stochastic process which modifies DNA. One of the most popular and successful such processes are the Cavender-Farris (CF) trees, which are represented as edge weighted trees. The Phylogeny Construction Problem is that of, given κ samples drawn from a CF tree, output a CF tree which is close to the original. Each CF tree naturally defines a random variable, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Truly online paging with locality of reference

    Publication Year: 1997, Page(s):326 - 335
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    The access graph model for paging, defined by (Borodin et al., 1991) and studied in (Irani et al., 1992) has a number of troubling aspects. The access graph has to be known in advance to the paging algorithm and the memory required to represent the access graph itself may be very large. We present a truly online strongly competitive paging algorithm in the access graph model that does not have any... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved worst-case to average-case connection for lattice problems

    Publication Year: 1997, Page(s):468 - 477
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    We improve a connection of the worst-case complexity and the average-case complexity of some well-known lattice problems. This fascinating connection was first discovered by Ajtai (1995). We improve the exponent of this connection from 8 to 3.5+ε View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of a set-union problem

    Publication Year: 1997, Page(s):110 - 115
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    We consider a simple data structure supporting the following operations: (i) create a new singleton set; (ii) create a new set which is the union of two pre-existing sets; (iii) determine whether a given element is in a particular set. We prove both lower and upper bounds for an implementation of such a data structure. In a restricted model we show that no deterministic implementation can be bette... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General dynamic routing with per-packet delay guarantees of O(distance+1/session rate)

    Publication Year: 1997, Page(s):294 - 302
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support read-time traffic such as voice and video. The most critical performance parameter to bound is the delay experienced by a packet as it travels from its source to its destination. We study dynamic routing in a connection-oriented pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tight bounds for depth-two superconcentrators

    Publication Year: 1997, Page(s):585 - 594
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    We show that the minimum size of a depth-two N-superconcentrator is Θ(Nlog2N/loglogN). Before this work, optimal bounds were known for all depths except two. For the upper bound, we build superconcentrators by putting together a small number of disperser graphs; these disperser graphs are obtained using a probabilistic argument. We present two different methods for showing lower b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning noisy perceptrons by a perceptron in polynomial time

    Publication Year: 1997, Page(s):514 - 523
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    Learning perceptrons (linear threshold functions) from labeled examples is an important problem in machine learning. We consider the problem where labels are subjected to random classification noise. The problem was known to be PAC learnable via a hypothesis that consists of a polynomial number of linear thresholds (due to A. Blum, A. Frieze, R. Kannan, and S. Vempala (1996)). The question of whet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replication is not needed: single database, computationally-private information retrieval

    Publication Year: 1997, Page(s):364 - 373
    Cited by:  Papers (134)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    We establish the following, quite unexpected, result: replication of data for the computational private information retrieval problem is not necessary. More specifically, based on the quadratic residuosity assumption, we present a single database, computationally private information retrieval scheme with O(nε) communication complexity for any ε>0 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern matching with swaps

    Publication Year: 1997, Page(s):144 - 153
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    Let a text string T of n symbols and a pattern string P of m symbols from alphabet Σ be given. A swapped version T' of T is a length n string derived from T by a series of local swaps, (i.e. t' l←tl+1 and t'l+1←tl) where each element can participate in no more than one swap. The Pattern Matching with Swaps problem is that of fi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Buy-at-bulk network design

    Publication Year: 1997, Page(s):542 - 547
    Cited by:  Papers (51)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    The essence of the simplest buy-at-bulk network design problem is buying network capacity “wholesale” to guarantee connectivity from all network nodes to a certain central network switch. Capacity is sold with “volume discount”: the more capacity is bought, the cheaper is the price per unit of bandwidth. We provide O(log2n) randomized approximation algorithm for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven)

    Publication Year: 1997, Page(s):314 - 324
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    Diffie and Hellman (1976) published their fundamental paper on new directions in cryptography, in which they announced that “we stand on the brink of a revolution in cryptography”. Twenty some years later, we survey some of the progress made in cryptography during this time. We especially focus on the successful interplay between complexity theory and cryptography, witnessed perhaps mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing integral points in convex semi-algebraic sets

    Publication Year: 1997, Page(s):162 - 171
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    Let Y be a convex set in Rk defined by polynomial inequalities and equations of degree at most d⩾2 with integer coefficients of binary length l. We show that if Y∩Zk≠θ, then Y contains an integral point of binary length ldO((k4)). For fixed k, our bound implies a polynomial-time algorithm for computing an integral point y∈Y. In part... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating shortest paths on a nonconvex polyhedron

    Publication Year: 1997, Page(s):182 - 191
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB)

    We present an approximation algorithm that, given the boundary P of a simple, nonconvex polyhedron in R3, and two points s and t on P, constructs a path on P between s and t whose length is at most 7(1+ε)dP(s,t), where dP(s,t) is the length of the shortest path between s and t on P, and ε>0 is an arbitrarily small positive constant. The algorithm runs ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The analysis of a list-coloring algorithm on a random graph

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

    We introduce a natural k-coloring algorithm and analyze its performance on random graphs with constant expected degree c (Gn,p=cn/). For k=3 our results imply that almost all graphs with n vertices and 1.923 n edges are 3-colorable. This improves the lower bound on the threshold for random 3-colorability significantly and settles the last case of a long-standing open question of Bolloba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path coupling: A technique for proving rapid mixing in Markov chains

    Publication Year: 1997, Page(s):223 - 231
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    The main technique used in algorithm design for approximating heart of the method is the study of the convergence (mixing) rates of particular Markov chains of interest. In this paper we illustrate a new approach to the coupling technique, which we call path coupling, for bounding mixing rates. Previous applications of coupling have required detailed insights into the combinatorics of the problem ... View full abstract»

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