- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j11 |      | Andrew D. Fox, Benjamin J. Hescott, Anselm Blumer, Donna K. Slonim: Connectedness of PPI network neighborhoods identifies regulatory hub proteins. Bioinformatics 27(8): 1135-1142 (2011) |
| 2006 | ||
| j10 | | 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 | ||
| j9 | | Anselm Blumer, Andrzej Ehrenfeucht, David Haussler: Average sizes of suffix trees and DAWGs. Discrete Applied Mathematics 24(1-3): 37-45 (1989) |
| j8 | | Anselm Blumer, Nick Littlestone: Learning faster than promised by the Vapnik-Chervonenkis dimension. Discrete Applied Mathematics 24(1-3): 47-53 (1989) |
| j7 | | Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth: Learnability and the Vapnik-Chervonenkis dimension. J. ACM 36(4): 929-965 (1989) |
| 1988 | ||
| j6 | | Anselm Blumer, Robert J. McEliece: The Rényi redundancy of generalized Huffman codes. IEEE Transactions on Information Theory 34(5): 1242-1249 (1988) |
| 1987 | ||
| j5 | | Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth: Occam's Razor. Inf. Process. Lett. 24(6): 377-380 (1987) |
| j4 | | 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) |
| j3 | | Anselm Blumer: Minimax universal noiseless coding for unifilar and Markov sources. IEEE Transactions on Information Theory 33(6): 925-930 (1987) |
| 1986 | ||
| c3 | | 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 | ||
| 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) |
Colors in the list of coauthors
Last update Thu May 23 00:55:22 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page