Anil Kamath, Rajeev Motwani, et al.  Home/Search
Context Related
| stanford.edu/people/rajeev...tail.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/people/raje...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The classical occupancy problem is concerned with studying the number of empty bins resulting from a random allocation of m balls to n bins. We provide a series of tail bounds on the distribution of the number of empty bins. These tail bounds should find application in randomized algorithms and probabilistic analysis. Our motivating application is the following well-known conjecture on threshold phenomenon for the satisfiability problem. Consider random 3-SAT formulas with cn clauses over n... (Update)
Cited by: More
Robust Parallel Computations through Randomization - Kontogiannis, Pantziou.. (2000) (Correct)
"Dynamic-Fault-Prone BSP": a paradigm for robust.. - Kontogiannis.. (Correct)
Backbones in Optimization and Approximation - John Slaney Automated (2001) (Correct)
Related documents from co-citation: More All
17: Analysis of two simple heuristics for random instances of k-SAT - Frieze, Suen - 1996
17: Probabilistic analysis of a generalization of the unit-clause literal selection .. (context) - Chao, Franco - 1990
17: Approximating the Unsatisfiability Threshold of Random Formulas - Kirousis, Kranakis et al. - 1995
BibTeX entry: (Update)
A. Kamath, R. Motwani, K. Palem, and P. Spirakis, "Tail bounds for occupancy and the satisfiability threshold conjecture," Random Structures and Algorithms 7, pp 59--80, 1995. http://citeseer.ist.psu.edu/kamath95tail.html More
@article{ kamath95tail,
author = "A. P. Kamath and R. Motwani and K. Palem and P. Spirakis",
title = "Tail bounds for occupancy and the satisfiability threshold conjecture",
journal = "Random Structures and Algorithms",
volume = "7",
pages = "59--80",
year = "1995",
url = "citeseer.ist.psu.edu/kamath95tail.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.stanford.edu/people/rajeev/papers.html): More
Approximation Algorithms for the Largest Common Subtree Problem - Sanjeev Khanna (1995) (Correct)
Lecture Notes on Approximation Algorithms - Volume I - Motwani (1992) (Correct)
Approximation Techniques for Average Completion Time.. - Chekuri, Motwani.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC