#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1993

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sharon A. Curtis
- Inf. Process. Lett.
- 2004

Dartboard design can be seen as an instance of the travelling salesman problem with maximum costs. This paper presents a simple yet optimal greedy algorithm to arrange numbers on both circular dartboards and linear hoopla boards. As a result, it identifies a class of polynomially solvable travelling salesman problems. 2004 Elsevier B.V. All rights… (More)

- C. E. Martin, Sharon A. Curtis
- Mathematical Structures in Computer Science
- 2013

- Clare E. Martin, Sharon A. Curtis, Ingrid Rewitzky
- Sci. Comput. Program.
- 2007

- Richard S. Bird, Sharon A. Curtis
- J. Funct. Program.
- 2006

- C. E. Martin, Sharon A. Curtis
- J. Funct. Program.
- 1993

- Clare E. Martin, Sharon A. Curtis
- UTP
- 2008

- Sharon A. Curtis, Shin-Cheng Mu
- J. Funct. Program.
- 2015

The problem of finding a densest segment of a list is similar to the well-known maximum segment sum problem, but its solution is surprisingly challenging. We give a general specification of such problems, and formally develop a linear-time online solution, using a sliding-window style algorithm. The development highlights some elegant properties of… (More)

- Clare E. Martin, Sharon A. Curtis
- MPC
- 2006

The problem of finding a maximally dense segment (MDS) of a list is a generalisation of the well-known maximum segment sum (MSS) problem, but its solution is more challenging. We extend and illuminate some recent work [2, 3, 7] on this problem with a formal development of a linear-time online algorithm, in the form of a sliding window zygomorphism. The… (More)