#### Filter Results:

- Full text PDF available (39)

#### Publication Year

1959

2016

- This year (0)
- Last 5 years (25)
- Last 10 years (37)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sheldon M. Ross, Rachel S. Reeve, Christina Lepre, Diane Peirano
- 2008

- Sheldon M. Ross
- Technometrics
- 2000

- Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross
- SIAM J. Comput.
- 2000

A typical approach to estimate an unknown quantity is to design an experiment that produces a random variable Z distributed in 0; 1] with EZ] = , run this experiment independently a number of times and use the average of the outcomes as the estimate. In this paper, we consider the case when no a priori information about Z is known except that is distributed… (More)

- Ilan Adler, Noga Alon, Sheldon M. Ross
- Random Struct. Algorithms
- 2001

By using the probabilistic method, we show that the maximum number of directed Hamiltonian paths in a complete directed graph with n vertices is at least (e− o(1)) n! 2n−1 .

- Sheldon M. Ross, GEORGE SHANTHIKUMAR, ZEGANG ZHU
- 2005

We provide sufficient conditions for the following types of random variable to have the increasing-failure-rate (IFR) property: sums of a random number of random variables; the time at which a Markov chain crosses a random threshold; the time until a random number of events have occurred in an inhomogeneous Poisson process; and the number of events of a… (More)

- Kyle Y. Lin, Sheldon M. Ross
- Operations Research
- 2003

- Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross
- FOCS
- 1995

A typical approach t o estimate an unknown quantity p is t o design an experiment that produces a random variable Z distributed in [0,1] with E[Z] = p, run this experiment independently a number of times and use the average of the outcomes as the estimate. In this paper, we consider the case when no a priori information about Z is known except that is… (More)

- Sheldon M. Ross
- Operations Research
- 1969

We are told that an object is hidden in one of m(m < ») boxes and we are given prior probabilities p. that the object is In the i box. A search of box i costs c. and finds the object with probability a. if the object is in the box. Also, we suppose that a reward R. is earned if the object Is found in the i box. A strategy is any rule for determining when to… (More)

- Sheldon M. Ross
- 2001

The coupon subset collection problem is a generalization of the classical coupon collecting problem, in that rather than collecting individual coupons we obtain, at each time point, a random subset of coupons. The problem of interest is to determine the expected number of subsets needed until each coupon is contained in at least one of these subsets. We… (More)

- Samim Ghamami, Sheldon M. Ross
- J. Applied Probability
- 2012