Proceedings 41st Annual Symposium on Foundations of Computer Science

12-14 Nov. 2000

Filter Results

Displaying Results 1 - 25 of 67
  • Proceedings 41st Annual Symposium on Foundations of Computer Science

    Publication Year: 2000
    Request permission for commercial reuse | PDF file iconPDF (259 KB)
    Freely Available from IEEE
  • Private quantum channels

    Publication Year: 2000, Page(s):547 - 553
    Cited by:  Papers (23)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (571 KB)

    We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In particular, we show that in order to transmit n qubits privately, 2n bits of shared private key are necessary and sufficient. This result may be viewed as the quantum analogue of the classical one-time pad encryption sc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • “Soft-decision” decoding of Chinese remainder codes

    Publication Year: 2000, Page(s):159 - 168
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    Given n relatively prime integers p1<...<pn and an integer k<n, the Chinese Remainder Code, CRTp1,...,pnik, has as its message space M={0,...,Πi=1k,pi-1}, and encodes a message m ∈M as the vector ⟨m1,...,mn⟩, where mi=m(mod pi). The soft-decision decoding problem for the C... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardness of approximate hypergraph coloring

    Publication Year: 2000, Page(s):149 - 158
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    We introduce the notion of covering complexity of a probabilistic verifier. The covering complexity of a verifier on a given input is the minimum number of proofs needed to “satisfy” the verifier on every random string, i.e., on every random string, at least one of the given proofs must be accepted by the verifier. The covering complexity of PCP verifiers offers a promising route to ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The product replacement algorithm is polynomial

    Publication Year: 2000, Page(s):476 - 485
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The product replacement algorithm is a heuristic designed to generate random group elements. The idea is to run a random walk on generating κ-tuples of the group, and then output a random component. The algorithm was designed by C.R. Leedham-Green, and further investigated by F. Cellar et al. (1995). It was found to have an outstanding performance, much better than the previously known algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using expander graphs to find vertex connectivity

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

    The (vertex) connectivity κ of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known algorithm for finding κ. For a digraph with n vertices, m edges and connectivity κ the time bound is O((n+min(κ5/2,κn3/4))m). This improves the previous best bound of O((n+min(κ3... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating the single source unsplittable min-cost flow problem

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

    In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path and the total cost must not exceed a given budget. This problem has been introduced by J.M. Kleinberg (1996) and generalizes sev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The cover time, the blanket time, and the Matthews bound

    Publication Year: 2000, Page(s):467 - 475
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    We prove upper and lower bounds and give an approximation algorithm for the cover time of the random walk on a graph. We introduce a parameter M motivated by the well-known Matthews bounds (P. Matthews, 1988) on the cover time, C, and prove that M/2<C= O(M(lnlnn)2 ). We give a deterministic-polynomial time algorithm to approximate M within a factor of 2; this then approximates C with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache-oblivious B-trees

    Publication Year: 2000, Page(s):399 - 409
    Cited by:  Papers (10)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the number of memory levels, the block sizes and number of blocks at each level, or the relative speeds of memory access. In particular between any pair of levels in the memory hierarchy, where transfers between the levels ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nested graph dissection and approximation algorithms

    Publication Year: 2000, Page(s):126 - 135
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    This paper considers approximation algorithms for graph completion problems using the nested dissection paradigm. Given a super-additive function of interest (the smallest planar or chordal extension for example) and a test that relates it to an upper bound of the smallest separator, we provide a framework how to dissect the graph recursively such that no subgraph has more than half the value of i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved quantum Fourier transform algorithm and applications

    Publication Year: 2000, Page(s):515 - 525
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    We give an algorithm for approximating the quantum Fourier transform over an arbitrary Zp which requires only O(n log n) steps where n=log p to achieve an approximation to within an arbitrary inverse polynomial in n. This improves the method of A.Y. Kitaev (1995) which requires time quadratic in n. This algorithm also leads to a general and efficient Fourier sampling technique which imp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topological persistence and simplification

    Publication Year: 2000, Page(s):454 - 463
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens during growth as either a feature or noise, depending on its life-time or persistence within the filtration. We give fast algorithms for completing persistence and experimental evidence for their speed and utility View full abstract»

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

    Publication Year: 2000, Page(s):390 - 398
    Cited by:  Papers (140)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    We address the issue of compressing and indexing data. We devise a data structure whose space occupancy is a function of the entropy of the underlying data set. We call the data structure opportunistic since its space occupancy is decreased when the input is compressible and this space reduction is achieved at no significant slowdown in the query performance. More precisely, its space occupancy is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximability and in-approximability results for no-wait shop scheduling

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

    We investigate the approximability of no-wait shop scheduling problems under the makespan criterion. In a flow shop, all jobs pass through the machines in the same ordering. In the more general job shop, the routes of the jobs are job-dependent. We present a polynomial time approximation scheme (PTAS) for the no-wait flow shop problem on any fixed number of machines. Unless P=NP, this result canno... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New data structures for orthogonal range searching

    Publication Year: 2000, Page(s):198 - 207
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the general range reporting problem in R3, we achieve query time O(log n+k) using space O(n log1+ε n), where n denotes the number of stored points and k the number of points to be reported. For the range reporting problem on an n×n grid, we achieve que... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extracting randomness via repeated condensing

    Publication Year: 2000, Page(s):22 - 31
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    On an input probability distribution with some (min-)entropy an extractor outputs a distribution with a (near) maximum entropy rate (namely the uniform distribution). A natural weakening of this concept is a condenser, whose output distribution has a higher entropy rate than the input distribution (without losing much of the initial entropy). We construct efficient explicit condensers. The condens... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The randomness recycler: a new technique for perfect sampling

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

    For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples from these distributions. The primary drawback to traditional Markov chain methods is that the mixing time of the chain is usually unknown, which makes it impossible to determine how close the output samples are to having the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A combinatorial approach to planar non-colliding robot arm motion planning

    Publication Year: 2000, Page(s):443 - 453
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB)

    We propose a combinatorial approach to plan noncolliding motions for a polygonal bar-and-joint framework. Our approach yields very efficient deterministic algorithms for a category of robot arm motion planning problems with many degrees of freedom, where the known general roadmap techniques would give exponential complexity. It is based on a novel class of one-degree-of-freedom mechanisms induced ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomizing polynomials: A new representation with applications to round-efficient secure computation

    Publication Year: 2000, Page(s):294 - 304
    Cited by:  Papers (21)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    Motivated by questions about secure multi-party computation, we introduce and study a new natural representation of functions by polynomials, which we term randomizing polynomials. “Standard” low-degree polynomials over a finite field are easy to compute with a small number of communication rounds in virtually any setting for secure computation. However, most Boolean functions cannot b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing that distributions are close

    Publication Year: 2000, Page(s):259 - 269
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    Given two distributions over an n element set, we wish to check whether these distributions are statistically close by only sampling. We give a sublinear algorithm which uses O(n2/3ε-4 log n) independent samples from each distribution, runs in time linear in the sample size, makes no assumptions about the structure of the distributions, and distinguishes the cases when ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detecting a network failure

    Publication Year: 2000, Page(s):231 - 239
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    Measuring the properties of a large, unstructured network can be difficult: one may not have full knowledge of the network topology, and detailed global measurements may be infeasible. A valuable approach to such problems is to take measurements from selected locations within the network and then aggregate them to infer large-scale properties. One sees this notion applied in settings that range fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fully dynamic transitive closure: breaking through the O(n2 ) barrier

    Publication Year: 2000, Page(s):381 - 389
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    We introduce a general framework for casting fully dynamic transitive closure into the problem of reevaluating polynomials over matrices. With this technique, we improve the best known bounds for fully dynamic transitive closure, in particular we devise a deterministic algorithm for general directed graphs that achieves O(n 2) amortized time for updates, while preserving unit worst-case... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the hardness of graph isomorphism

    Publication Year: 2000, Page(s):180 - 186
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    We show that the graph isomorphism problem is hard under logarithmic space many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space), for every logarithmic space modular class ModkL and for the class DET of problems NC1 reducible to the determinant. These are the strongest existing hardness results for the graph isomorphism problem, and imply a r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic models for the Web graph

    Publication Year: 2000, Page(s):57 - 65
    Cited by:  Papers (86)  |  Patents (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The Web may be viewed as a directed graph each of whose vertices is a static HTML Web page, and each of whose edges corresponds to a hyperlink from one Web page to another. We propose and analyze random graph models inspired by a series of empirical observations on the Web. Our graph models differ from the traditional Gn,p models in two ways: 1. Independently chosen edges do not result ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A polylogarithmic approximation of the minimum bisection

    Publication Year: 2000, Page(s):105 - 115
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. Finding the bisection of minimum cost is NP-hard. We present an algorithm that finds a bisection whose cost is within ratio of O(log2 n) from the optimal. For graphs excluding any fixed graph as a minor (e.g. planar gra... View full abstract»

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