Linear size finite automata for the set of all subwords of a word - an outline of results. - Anselm Blumer; J. Blumer; Andrzej Ehrenfeucht; David Haussler; Ross M. McConnell (Bull. EATCS, 1983)

Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time. - Anselm Blumer; J. Blumer; Andrzej Ehrenfeucht; David Haussler; Ross M. McConnell (ICALP, 1984)

Building a Complete Inverted File for a Set of Text Files in Linear Time - Anselm Blumer; J. Blumer; Andrzej Ehrenfeucht; David Haussler; Ross M. McConnell (STOC, 1984)

The Smallest Automaton Recognizing the Subwords of a Text. - Anselm Blumer; J. Blumer; David Haussler; Andrzej Ehrenfeucht; M. T. Chen; Joel I. Seiferas (Theor. Comput. Sci., 1985)

Complete inverted files for efficient text retrieval and analysis. - Anselm Blumer; J. Blumer; David Haussler; Ross M. McConnell; Andrzej Ehrenfeucht (J. ACM, 1987)