#### Filter Results:

#### Publication Year

2003

2009

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Nayantara Bhatnagar, Sam Greenberg, Dana Randall
- SODA
- 2008

We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "<i>k</i>-attribute model," each man is valued in each of <i>k</i> attributes, and each woman's ranking of the men is determined by a linear function, representing her relative ranking of those attributes;… (More)

- Sam Greenberg, Amanda Pascoe Streib, Dana Randall
- SODA
- 2009

Monotonic surfaces spanning finite regions of Z d arise in many contexts, including DNA-based self-assembly, card-shuffling and lozenge tilings. We explore how we can sample these surfaces when the distribution is biased to favor higher surfaces. We show that a natural local chain is rapidly mixing with any bias for regions in Z 2 , and for bias λ > d 2 in… (More)

- Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan
- Discrete Mathematics
- 2005

A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that every face is bounded by a walk of 4 edges. We consider the following classes of simple quadrangulations: arbitrary, minimum degree 3, 3-connected, and 3-connected without non-facial 4-cycles. In each case we show how the class can be generated by starting with… (More)

- Sam Greenberg, Dana Randall
- Theor. Comput. Sci.
- 2009

Algorithms based on Markov chains are ubiquitous across scientific disciplines as they provide a method for extracting statistical information about large, complicated systems. For some self-assembly models, Markov chains can be used to predict both equilibrium and non-equilibrium dynamics. In fact, the efficiency of these self-assembly algorithms can be… (More)

- Craig A. Tovey, Sam Greenberg, Sven Koenig
- ICRA
- 2003

— D* is a planning method that always routes a robot in initially unknown terrain from its current location to a given goal location along a shortest presumed unblocked path. The robot moves along the path until it discovers new obstacles and then repeats the procedure. D* has been used on a large number of robots. It is therefore important to analyze the… (More)

- Apurva Mudgal, Craig A. Tovey, Sam Greenberg, Sven Koenig
- SIAM J. Discrete Math.
- 2005

D * is a greedy heuristic planning method that is widely used in robotics, including several Nomad class robots and the Mars rover prototype, to reach a destination in unknown terrain. We obtain nearly sharp lower and upper bounds of Ω(n log n/ log log n) and O(n log n), respectively, on the worst-case total distance traveled by the robot, for the grid… (More)

- Sam Greenberg, Dana Randall
- Algorithmica
- 2007

We show that local dynamics require exponential time for two sampling problems motivated by statistical physics: independent sets on the triangular lattice (the hard-core lattice gas model) and weighted even ori-entations of the two-dimensional Cartesian lattice (the 8-vertex model). For each problem, there is a parameter λ known as the fugacity, such that… (More)

- Nayantara Bhatnagar, Sam Greenberg, Dana Randall
- APPROX-RANDOM
- 2006

We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the " k-attribute model, " each man is valued in each of k attributes, and each woman's ranking of the men is determined by a linear function, representing her relative ranking of those attributes; men's… (More)

- ‹
- 1
- ›