# Communications of the ACM

### 121 - 130 of 135 for bentley

#### Programming pearls: Writing correct programs

In the late 1960s people were talking about the promise of programs that verify the correctness of other programs. Unfortunately, it is now the middle of the 1980s, and, with precious few exceptions, there is still little more than talk about automated verification systems. Despite unrealized expectations, however, the research on program verification has given us something far more valuable than a black box that gobbles programs and flashes “good” or “bad”—we now have a fundamental understanding of computer programming. The purpose of this column is to show how that fundamental understanding can help programmers write correct programs. But before we get to the subject itself, we must keep it in perspective. Coding skill is just one small part of writing correct programs. The majority of the task is the subject of the three previous columns: problem definition, algorithm design, and data structure selection. If you perform those tasks well, then writing correct code is usually easy.

1983-12-01
https://dl.acm.org/ft_gateway.cfm?id=358484&dwn=1

#### Programming pearls: data structures programs

1983-10-01
https://dl.acm.org/ft_gateway.cfm?id=383461&dwn=1

#### Approximation algorithms for convex hulls

1982-01-01
https://dl.acm.org/ft_gateway.cfm?id=358392&dwn=1

#### Optimal Expected-Time Algorithms for Closest Point Problems

1980-12-01
https://dl.acm.org/ft_gateway.cfm?id=355927&dwn=1

#### A general method for solving divide-and-conquer recurrences

The approximate complexity of divide-and-conquer algorithms is often described by recurrence relations of the formT(n) = kT(n/c) + f(n).The only well-defined method currently used for solving such recurrences consists of solution tables for fixed functions f and varying k and c. In this note we describe a unifying method for solving these recurrences that is both general in applicability and easy to apply. This method is appropriate both as a classroom technique and as a tool for practicing algorithm designers.

1980-09-01
https://dl.acm.org/ft_gateway.cfm?id=1008865&dwn=1

#### Generating Sorted Lists of Random Numbers

1980-09-01
https://dl.acm.org/ft_gateway.cfm?id=355907&dwn=1

#### Multidimensional divide-and-conquer

Most results in the field of algorithm design are single algorithms that solve single problems. In this paper we discuss multidimensional divide-and-conquer, an algorithmic paradigm that can be instantiated in many different ways to yield a number of algorithms and data structures for multidimensional problems. We use this paradigm to give best-known solutions to such problems as the ECDF, maxima, range searching, closest pair, and all nearest neighbor problems. The contributions of the paper are on two levels. On the first level are the particular algorithms and data structures given by applying the paradigm. On the second level is the more novel contribution of this paper: a detailed study of an algorithmic paradigm that is specific enough to be described precisely yet general enough to solve a wide variety of problems.

1980-04-01
https://dl.acm.org/ft_gateway.cfm?id=358850&dwn=1

#### Data Structures for Range Searching

1979-12-01
https://dl.acm.org/ft_gateway.cfm?id=356797&dwn=1

#### Algorithms on vector sets

1979-09-01
https://dl.acm.org/ft_gateway.cfm?id=1008624&dwn=1

#### On the Average Number of Maxima in a Set of Vectors and Applications

1978-10-01
https://dl.acm.org/ft_gateway.cfm?id=322095&dwn=1