#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1985

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Richard M. Karp, Michael Luby, Neal Madras
- J. Algorithms
- 1989

Monte-Carlo algorithm • Given finite set of known size U • Efficient method for sampling uniformly from U • Given f: U -> {0, 1} and efficient method for computing f(u), given u in U • G = f-1(1) (pre-image of 1 in U) • Goal is to estimate |G| • One trial: randomly choose u in U, compute f(u) and set Y = |U|∙f(u) • Monte-Carlo algorithms consists in running… (More)

- Albert G. Greenberg, Neal Madras
- J. ACM
- 1992

Fair Queuing is a novel queuing discipline with important applications to data networks that support variable-size packets and to systems where the cost of preempting jobs from service is high. The disciphne controls a single server shared by N job arrival streams with each stream allotted a separate queue. After every job completion, the server is assigned… (More)

- Jonathan Goodman, Albert G. Greenberg, Neal Madras, Peter March
- J. ACM
- 1988

Binary exponential backoff is a randomized protocol for regulating transmissions on a multiple-access broadcast channel. Ethernet, a local-area network, is built upon this protocol. The fundamental theoretical issue is stability: Does the backlog of packets awaiting transmission remain bounded in time, provided the rates of new packet arrivals are small… (More)

- Neal Madras, Zhongrong Zheng
- Random Struct. Algorithms
- 2003

The Metropolis-coupled Markov chain method (or “Swapping Algorithm”) is an empirically successful hybrid Monte Carlo algorithm. It alternates between standard transitions on parallel versions of the system at different parameter values, and swapping two versions. We prove rapid mixing for two bimodal examples, including the mean-field Ising model. © 2002… (More)

- Neal Madras, Dana Randall
- 2007

In this paper we develop tools for analyzing the rate at which a reversible Markov chain converges to stationarity. Our techniques are useful when the Markov chain can be decomposed into pieces which are themselves easier to analyze. The main theorems relate the spectral gap of the original Markov chains to the spectral gap of the pieces. In the first case… (More)

- Neal Madras, Dana Randall
- FOCS
- 1996

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in… (More)

- Neal Madras, Alison L. Gibbs, YINTING ZHOU, Peter W. Zandstra, Jane E. Aubin
- Stem cells
- 2002

The process of development of various cell types is often based on a linear or deterministic paradigm. This is true, for example, for osteoblast development, a process that occurs through the differentiation of a subset of primitive fibroblast progenitors called colony-forming unit-osteoblasts (CFU-Os). CFU-O differentiation has been subdivided into three… (More)

We consider the stochastic behavior of binary exponential backoff, a probabilistic algorithm for regulating transmissions on a multiple access channel. Ethernet, a local area network, is built upon this algorithm. The fundamental theoretical issue is stability: does the backlog of packets awaiting transmission remain bounded in time, provided the rates of… (More)

- Mahshid Atapour, Neal Madras
- Combinatorics, Probability & Computing
- 2014