Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

Proceedings., 33rd Annual Symposium on Foundations of Computer Science

24-27 Oct. 1992

Filter Results

Displaying Results 1 - 25 of 78
  • Proceedings 33rd Annual Symposium on Foundations of Computer Science (Cat. No.92CH3188-0)

    Publication Year: 1992
    Request permission for commercial reuse | PDF file iconPDF (83 KB)
    Freely Available from IEEE
  • Improved lower bounds for Shellsort

    Publication Year: 1992, Page(s):226 - 235
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    The authors give improved lower bounds for Shellsort based on a new and relatively simple proof idea. The lower bounds obtained are both stronger and more general than the previously known bounds. In particular, they hold for nonmonotone increment sequences and adaptive Shellsort algorithms, as well as for some recently proposed variations of Shellsort View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tighter bounds on the exact complexity of string matching

    Publication Year: 1992, Page(s):600 - 609
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    The paper considers how many character comparisons are needed to find all occurrences of a pattern of length m in a text of length n. The main contribution is to show an upper bound of the form n + O(n/m) character comparisons, following preprocessing. Specifically, the authors show an upper bound of n+8/3(m+1)(n-m) character comparisons. This bound is achieved by an online algorithm which perform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The asymptotic complexity of merging networks

    Publication Year: 1992, Page(s):236 - 246
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    Let M(m,n) be the minimum number of comparators needed in a comparator network that merges m elements x1x2⩽. . .⩽xm and n elements y1 y2. . .⩽yn, where nm. Batcher's odd-even merge yields th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tiling a polygon with rectangles

    Publication Year: 1992, Page(s):610 - 619
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    The authors study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles). They present a linear time algorithm for deciding if a polygon can be tiled with 1 × m and k × 1 tiles (and giving a tiling when it exists), and a quadratic algorithm for the same problem when the tile types are m × k and k × m View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic checking of proofs; a new characterization of NP

    Publication Year: 1992, Page(s):2 - 13
    Cited by:  Papers (62)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 KB)

    The authors give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilistically in polynomial time using logarithmic number of random bits and sub-logarithmic number of queries to the proof. This is a non-relativizing characterization of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconstructing algebraic functions from mixed data

    Publication Year: 1992, Page(s):503 - 512
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    The authors consider the task of reconstructing algebraic functions given by black boxes. Unlike traditional settings, they are interested in black boxes which represent several algebraic functions- f1, . . ., fk, where at each input x, the box arbitarrily chooses a subset of f1(x), . . ., fk(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Separating the communication complexities of MOD m and MOD p circuits

    Publication Year: 1992, Page(s):278 - 287
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    The author proves in this paper that it is much harder to evaluate depth-2, size-N circuits with MOD m gates than with MOD p gates by k-party communication protocols: he shows a k-party protocol which communicates O(1) bits to evaluate circuits with MOD p gates, while evaluating circuits with MOD m gates needs Ω(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomized geometric algorithms and pseudo-random generators

    Publication Year: 1992, Page(s):90 - 100
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    The so called randomized incremental algorithms in computational geometry can be thought of as a generalization of Quicksort to higher dimensional geometric problems. They all construct the geometric complex in the given problem, such as a Voronoi diagram or a convex polytope, by adding the objects in the input set, one at a time, in a random order. The author shows that the expected running times... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A mildly exponential approximation algorithm for the permanent

    Publication Year: 1992, Page(s):320 - 326
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    An approximation algorithm for the permanent of an n×n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp (0(n1/2 log2 n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time complexity of the form eθ(n) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Truly alphabet-independent two-dimensional pattern matching

    Publication Year: 1992, Page(s):247 - 256
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    A. Amir, G. Benson and M. Farach (see Proc. 24th STOC, p.59-68 (1992)) gave an algorithm for two-dimensional pattern matching (ABF for short) whose text processing is independent of the alphabet and takes O(n2) time, but whose pattern processing is dependent on the alphabet and takes O(m2log|Σ|) time. The authors present an algorithm ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mick gets some (the odds are on his side) [satisfiability]

    Publication Year: 1992, Page(s):620 - 627
    Cited by:  Papers (37)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    Consider a randomly generated boolean formula F (in the conjunctive normal form) with m clauses of size k over n variables; k is fixed at any value greater than 1, but n tends to infinity and m = (1 + o(1))cn for some c depending only on k. It is easy to see that F is unsatisfiable with probability 1-o(1) whenever c>(ln 2)2k; the authors complement this observation by proving that F ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomized consensus in expected O(n log2 n) operations per processor

    Publication Year: 1992, Page(s):137 - 146
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    The paper presents a new randomized algorithm for achieving consensus among asynchronous processors that communicate by reading and writing shared registers. The fastest previously known algorithm requires a processor to perform an expected O(n2 log n) read and write operations in the worst case. In the algorithm, each processor executes at most an expected ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proof verification and hardness of approximation problems

    Publication Year: 1992, Page(s):14 - 23
    Cited by:  Papers (136)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that used O(f(n)) random bits, queries O(g(n)) bits of its oracle and behaves as follows: If x∈L then there exists an oracle y such that the machine accepts for all random choices but if x∉L then for every oracle y the machine rejects with high probability. Arora an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate max flow on small depth networks

    Publication Year: 1992, Page(s):648 - 658
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    The author considers the maximum flow problem on directed acyclic networks with m edges and depth r (length of the longest s-t path). The main result is a new deterministic algorithm for solving the relaxed problem of computing an s-t flow of value at least (1-ε) of the maximum flow. For instances where r and ε-1 are small (i.e., O(polylog(m))), this algorithm is in NC and use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the exact learning of formulas in parallel

    Publication Year: 1992, Page(s):513 - 522
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    The authors investigate the parallel complexity of learning formulas from membership and equivalence queries. They consider a number of learning problems that can be solved sequentially in polynomial time. They prove some upper and lower bounds on the number of parallel steps required to solve these problems with a polynomial number of processors View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on the depth of monotone arithmetic computations

    Publication Year: 1992, Page(s):288 - 295
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Consider an arithmetic expression of length n involving only the operations {+,×} and non-negative constants. The authors prove lower bounds on the depth of any binary computation tree over the same set of operations and constants that computes such an expression. In their main result they exhibit a family of arithmetic expressions that requires computation trees of depth at least 1... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Drawing planar graphs using the lmc-ordering

    Publication Year: 1992, Page(s):101 - 110
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    The author introduces a method to optimize the required area, minimum angle and number of bends of planar drawings of graphs on a grid. The main tool is a new type of ordering on the vertices and faces of triconnected planar graphs. With this method linear time and space algorithms can be designed for many graph drawing problems. He shows that every triconnected planar graph G can be drawn convexl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to denest Ramanujan's nested radicals

    Publication Year: 1992, Page(s):447 - 456
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    The author presents a simple condition when nested radical expressions of depth two can be denested using real radicals or radicals of some bounded degree. He describes the structure of these denestings and determines an upper bound on the maximum size of a denesting. Also for depth two radicals he describes an algorithm that will find such a denesting whenever one exists. Unlike all previous dene... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Competitive analysis of financial games

    Publication Year: 1992, Page(s):327 - 333
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    In the unidirectional conversion problem an on-line player is given the task of converting dollars to yen over some period of time. Each day, a new exchange rate is announced and the player must decide how many dollars to convert. His goal is to minimize the competitive ratio. defined as supE (POPT(E)/PXE) where E ranges over exchange rate sequences. P... View full abstract»

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

    Publication Year: 1992, Page(s):208 - 217
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    This paper considers the problem of paging under the assumption that the sequence of pages accessed is generated by a Markov chain. The authors use this model to study the fault-rate of paging algorithms, a quantity of interest to practitioners. They first draw on the theory of Markov decision processes to characterize the paging algorithm that achieves optimal fault-rate on any Markov chain. They... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient minimum cost matching using quadrangle inequality

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

    The authors present efficient algorithms for finding a minimum cost perfect matching, and for solving the transportation problem in bipartite graphs, G = (Red ∪ Blue, Red × Blue), where |Red| = n, |Blue| = m, n ⩽ m, and the cost function obeys the quadrangle inequality. The first results assume that all the red points and all the blue points lie on a curve that is homeomorphic to eit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the randomized complexity of volume and diameter

    Publication Year: 1992, Page(s):482 - 492
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    The authors give an O(n7log2 n) randomised algorithm to approximate the volume of a convex body, and an O(n6log n) algorithm to sample a point from the uniform distribution over a convex body. For convex polytopes the algorithm runs in O(n 7log4n) steps. Several t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Amplification and percolation [probabilistic Boolean functions]

    Publication Year: 1992, Page(s):258 - 267
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    The authors extend R.B. Boppana's results (1989) in two ways. They first show that his two lower bounds hold for general read-once formulae, not necessarily monotone, that may even include exclusive-or gates. They are then able to join his two lower bounds together and show that any read-once, not necessarily monotone, formula that amplifies ( p-1/n,p+... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On four-connecting a triconnected graph

    Publication Year: 1992, Page(s):70 - 79
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    The author considers the problem of finding a smallest set of edges whose addition four-connects a triconnected graph. This is a fundamental graph-theoretic problem that has applications in designing reliable networks. He presents an O(nα(m,n)+m) time sequential algorithm for four-connecting an undirected graph G that is triconnected by adding the smallest number of edges, where n and m are ... View full abstract»

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