Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
J. Blumer
1980 – 1989
- 1987
[j3]Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht: Complete inverted files for efficient text retrieval and analysis. J. ACM 34(3): 578-595 (1987)- 1985
[j2]Anselm Blumer, J. Blumer, David Haussler, Andrzej Ehrenfeucht, M. T. Chen, Joel I. Seiferas: The Smallest Automaton Recognizing the Subwords of a Text. Theor. Comput. Sci. 40: 31-55 (1985)- 1984
[c2]Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell: Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time. ICALP 1984: 109-118
[c1]Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell: Building a Complete Inverted File for a Set of Text Files in Linear Time. STOC 1984: 349-358- 1983
[j1]Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell: Linear size finite automata for the set of all subwords of a word - an outline of results. Bulletin of the EATCS 21: 12-20 (1983)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:53 CET by the dblp team



