2006 |
13 | EE | Jeongah Yoon,
Anselm Blumer,
Kyongbum Lee:
An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality.
Bioinformatics 22(24): 3106-3108 (2006) |
1989 |
12 | EE | Anselm Blumer,
Andrzej Ehrenfeucht,
David Haussler:
Average sizes of suffix trees and DAWGs.
Discrete Applied Mathematics 24(1-3): 37-45 (1989) |
11 | EE | Anselm Blumer,
Nick Littlestone:
Learning faster than promised by the Vapnik-Chervonenkis dimension.
Discrete Applied Mathematics 24(1-3): 47-53 (1989) |
10 | EE | Anselm Blumer,
Andrzej Ehrenfeucht,
David Haussler,
Manfred K. Warmuth:
Learnability and the Vapnik-Chervonenkis dimension.
J. ACM 36(4): 929-965 (1989) |
1988 |
9 | | Anselm Blumer,
Robert J. McEliece:
The Rényi redundancy of generalized Huffman codes.
IEEE Transactions on Information Theory 34(5): 1242-1249 (1988) |
1987 |
8 | | Anselm Blumer:
Minimax universal noiseless coding for unifilar and Markov sources.
IEEE Transactions on Information Theory 33(6): 925- (1987) |
7 | | Anselm Blumer,
Andrzej Ehrenfeucht,
David Haussler,
Manfred K. Warmuth:
Occam's Razor.
Inf. Process. Lett. 24(6): 377-380 (1987) |
6 | EE | 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) |
1986 |
5 | | Anselm Blumer,
Andrzej Ehrenfeucht,
David Haussler,
Manfred K. Warmuth:
Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract)
STOC 1986: 273-282 |
1985 |
4 | | 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 |
3 | | 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 |
2 | | 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 |
1 | | 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) |