Formal Aspects of Computing 5(1):61-78, 1994.

Authors: Richard S. Bird and Oege de Moor
>

Abstract

A partition of a list is a division of that list into contiguous segments. Many problems in computer science can be conveniently specified in terms of list partitions, including paragraph formatting and various datacompression problems. In this paper, we develop a theory for deriving efficient algorithms from such specifications.

BIBTEX:

           @article{facs94bird, 
           author = "Richard S. Bird and De Moor, Oege", 
           title = "List Partitions",
           journal = "Formal Aspects of Computing",
           volume =   "5",
           number = "1",
           pages = "61-78",
           year = "1994"}