#### Filter Results:

- Full text PDF available (79)

#### Publication Year

1948

2017

- This year (5)
- Last 5 years (26)
- Last 10 years (40)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Richard J. Anderson, Paul Beame, +4 authors Jon Damon Reese
- SIGSOFT FSE
- 1996

In this paper we present our results and experiences of using symbolic model checking to study the specification of an aircraft collision avoidance system. Symbolic model checking has been highly successful when applied to hardware systems. We are interested in the question of whether or not model checking techniques can be applied to large software… (More)

- Richard J. Anderson, Gary L. Miller
- Algorithmica
- 1988

In this paper we describe a simple parallel algorithm for list ranking. The algorithm is deterministic and runs inO(logn) time on an EREW PRAM withn/logn processors. The algorithm matches the performance of the Cole-Vishkin [CV3] algorithm but is simple and has reasonable constant factors.

- Richard J. Anderson, Heather Woll
- SIAM J. Comput.
- 1997

In this paper, we prove new upper bounds on the complexity of the certified write-all problem with respect to an adaptive adversary. Our strongest result is that for any ǫ > 0, there exists an O(p) work algorithm for the p-processor p-memory cell write-all. We also give a randomized O(p log p) work algorithm for a p-processor p-memory cell write-all.

- Richard J. Anderson, Gary L. Millery
- 1988

In this paper we study the Local Memory PRAM. This model allows unit cost communication but assumes that the shared memory is divided into modules. This model is motivated by a consideration of potential optical computers. We show that fundamental problems such as list-ranking and parallel tree contraction can be implemented on this model in O(log n) time… (More)

- Richard J. Anderson, Heather Woll
- STOC
- 1991

We are interested in designing efficient data structures for a shared memory multiprocessor. In this paper we focus on the union-find data structure. Our machine model is asynchronous and allows stopping faults. Thus we require our solutions to the data structure problem have the wait-free property, meaning that each thread continues to make progress on its… (More)

- Alok Aggarwal, Richard J. Anderson
- Combinatorica
- 1987

In this paper we present a fast parallel algorithm for constructing a depth first search tree for an undirected graph. The algorithm is an <italic>RNC</italic> algorithm, meaning that it is a probabilistic algorithm that runs in polylog time using a polynomial number of processors on a P-RAM. The run time of the algorithm is… (More)

- Richard J. Anderson, João Carlos Setubal
- SPAA
- 1992

We describe an efficient parallel implementation of Goldberg’s maximum flow algorithm for a shared-memory multiprocessor. Our main technical innovation is a method that allows a “global relabeling” heuristic to be executed concurrently with the main algorithm; this heuristic is essential for good performance in practice. We present performance results from… (More)

- Richard J. Anderson, Sumeet Sobti
- Symposium on Computational Geometry
- 1999

In this paper we study a geometric problem arising in typography: the problem of laying out a two dimensional table. Each cell of the table has content associated with it. We may have choices on the geometry of cells (e.g., number of rows to use for the text in a cell.) The problem is to choose configurations for the cells to optimize an objective function… (More)

- Richard J. Anderson, Gary L. Miller
- Inf. Process. Lett.
- 1990

- Richard J. Anderson, Ernst W. Mayr, Manfred K. Warmuth
- Inf. Comput.
- 1989

We study the parallel complexity of polynomial heuristics for the bin packing problem. We show that some well-known (and simple) methods like first-fit-decreasing are P-complete, and it is hence very unlikely that they can be efficiently parallelized. On the other hand, we exhibit an optimal NC algorithm that achieves the same performance bound as does FFD.… (More)