Introduction to special issue on randomized and derandomized algorithms

[1]  Ketan Mulmuley.  Randomized geometric algorithms and pseudorandom generators , 2005, Algorithmica.

[2]  Leonidas J. Guibas,et al.  A method for obtaining randomized algorithms with small tail probabilities , 1996, Algorithmica.

[3]  Noga Alon,et al.  Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions , 1994, Algorithmica.

[4]  A. Sinclair,et al.  Approximating the number of monomer-dimer coverings of a lattice , 1996 .

[5]  Richard M. Karp,et al.  An optimal algorithm for Monte Carlo estimation , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[6]  Wolfgang Ertel,et al.  Optimal parallelization of Las Vegas algorithms , 1993, Forschungsberichte, TU Munich.

[7]  Bernard Chazelle,et al.  On linear-time deterministic algorithms for optimization problems in fixed dimension , 1996, SODA '93.

[8]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[9]  Martin E. Dyer,et al.  A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem , 1993, Combinatorics, Probability and Computing.

[10]  Prabhakar Raghavan,et al.  Randomized algorithms and pseudorandom numbers , 1993, JACM.

[11]  David Zuckerman,et al.  Optimal speedup of Las Vegas algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[12]  Avi Wigderson,et al.  Deterministic approximate counting of depth-2 circuits , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[13]  Michael E. Saks,et al.  Efficient construction of a small hitting set for combinatorial rectangles in high dimension , 1993, Comb..

[14]  Claire Mathieu,et al.  Matchings in lattice graphs , 1993, STOC.

[15]  Richard J. Lipton,et al.  A Monte-Carlo Algorithm for Estimating the Permanent , 1993, SIAM J. Comput..

[16]  Mark Jerrum,et al.  A mildly exponential approximation algorithm for the permanent , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[17]  Ketan Mulmuley.  Randomized geometric algorithms and pseudo-random generators , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[18]  Michael Luby,et al.  Approximating the Permanent of Graphs with Large Factors , 1992, Theor. Comput. Sci..

[19]  Gil Kalai,et al.  A subexponential randomized simplex algorithm (extended abstract) , 1992, STOC '92.

[20]  Noam Nisan,et al.  Approximations of general independent distributions , 1992, STOC '92.

[21]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[22]  Friedhelm Meyer auf der Heide,et al.  Efficient PRAM simulation on a distributed memory machine , 1992, STOC '92.

[23]  Bonnie Berger,et al.  Simulating (logcn)-wise independence in NC , 1991, JACM.

[24]  David Zuckerman,et al.  Simulating BPP using a general weak random source , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[25]  Raimund Seidel,et al.  Small-dimensional linear programming and convex hulls made easy , 1991, Discret. Comput. Geom..

[26]  Yossi Matias,et al.  Fast hashing on a PRAM—designing by expectation , 1991, SODA '91.

[27]  Marek Karpinski,et al.  Approximating the number of zeroes of a GF[2] polynomial , 1991, SODA '91.

[28]  Uzi Vishkin,et al.  Converting high probability into nearly-constant time—with applications to parallel hashing , 1991, STOC '91.

[29]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[30]  Friedhelm Meyer auf der Heide,et al.  A New Universal Class of Hash Functions and Dynamic Hashing in Real Time , 1990, ICALP.

[31]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[32]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[33]  Alan Siegel,et al.  On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications , 1989, 30th Annual Symposium on Foundations of Computer Science.

[34]  Bonnie Berger,et al.  Simulating (log/sup c/n)-wise independence in NC , 1989, 30th Annual Symposium on Foundations of Computer Science.

[35]  Cecilia R. Aragon,et al.  Randomized search trees , 1989, 30th Annual Symposium on Foundations of Computer Science.

[36]  Moni Naor,et al.  The probabilistic method yields deterministic parallel algorithms , 1989, 30th Annual Symposium on Foundations of Computer Science.

[37]  Richard M. Karp,et al.  Monte-Carlo Approximation Algorithms for Enumeration Problems , 1989, J. Algorithms.

[38]  Martin E. Dyer,et al.  A randomized algorithm for fixed-dimensional linear programming , 1989, Math. Program..

[39]  Oded Goldreich,et al.  On the power of two-point based sampling , 1989, J. Complex..

[40]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[41]  V. Vazirani,et al.  Random Polynomial Time is Equal to Semi-Random Polynomial Time , 1988 .

[42]  M. Luby,et al.  Polytopes, permanents and graphs with large factors , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[43]  Kenneth L. Clarkson,et al.  A Las Vegas algorithm for linear programming when the dimension is small , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[44]  Friedhelm Meyer auf der Heide,et al.  Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[45]  M. Luby.  Removing randomness in parallel computation without a processor penalty , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[46]  Umesh V. Vazirani,et al.  Efficiency considerations in using semi-random sources , 1987, STOC.

[47]  Andrei Z. Broder,et al.  How hard is it to marry at random? (On the approximation of the permanent) , 1986, STOC '86.

[48]  Martin E. Dyer,et al.  On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem , 1986, SIAM J. Comput..

[49]  Miklos Santha,et al.  Generating Quasi-random Sequences from Semi-random Sources , 1986, J. Comput. Syst. Sci..

[50]  Kenneth L. Clarkson,et al.  Linear Programming in O(n * (3_d)_2) Time , 1986, Inf. Process. Lett..

[51]  Manuel Blum.  Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1986, Comb..

[52]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[53]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[54]  Vijay V. Vazirani,et al.  Random polynomial time is equal to slightly-random polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[55]  Oded Goldreich,et al.  Unbiased bits from sources of weak randomness and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[56]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[57]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1984, STOC '84.

[58]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[59]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[60]  Avi Wigderson,et al.  Improving the performance guarantee for approximate graph coloring , 1983, JACM.

[61]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[62]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[63]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[64]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[65]  P. Elias.  The Efficient Construction of an Unbiased Random Sequence , 1972 .

[66]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .