| Learnability and the Vapnik-Chervonenkis dimension A Blumer, A Ehrenfeucht, D Haussler, MK Warmuth Journal of the ACM (JACM) 36 (4), 929-965, 1989 | 2612 | 1989 |
| Occam's razor A Blumer, A Ehrenfeucht, D Haussler, MK Warmuth Information processing letters 24 (6), 377-380, 1987 | 1538 | 1987 |
| The smallest automation recognizing the subwords of a text A Blumer, J Blumer, D Haussler, A Ehrenfeucht, MT Chen, J Seiferas Theoretical computer science 40, 31-55, 1985 | 490 | 1985 |
| Complete inverted files for efficient text retrieval and analysis A Blumer, J Blumer, D Haussler, R McConnell, A Ehrenfeucht Journal of the ACM (JACM) 34 (3), 578-595, 1987 | 327 | 1987 |
| An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality J Yoon, A Blumer, K Lee Bioinformatics 22 (24), 3106-3108, 2006 | 281 | 2006 |
| Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension A Blumer, A Ehrenfeucht, D Haussler, M Warmuth Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986 | 279 | 1986 |
| Average sizes of suffix trees and DAWGs A Blumer, A Ehrenfeucht, D Haussler Discrete Applied Mathematics 24 (1-3), 37-45, 1989 | 89 | 1989 |
| Linear size finite automata for the set of all subwords of a word - an outline of results A Blumer, J Blumer, A Ehrenfeucht, D Haussler, RM McConnell Bulletin of the EATCS 21, 12-20, 1983 | 84 | 1983 |
| The Rényi redundancy of generalized Huffman codes AC Blumer, RJ McEliece IEEE Transactions on Information Theory 34 (5), 1242-1249, 1988 | 50 | 1988 |
| Connectedness of PPI network neighborhoods identifies regulatory hub proteins AD Fox, BJ Hescott, AC Blumer, DK Slonim Bioinformatics 27 (8), 1135-1142, 2011 | 41 | 2011 |
| Building a complete inverted file for a set of text files in linear time A Blumer, J Blumer, A Ehrenfeucht, D Haussler, R McConnell Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984 | 31 | 1984 |
| Building the minimal DFA for the set of all subwords of a word on-line in linear time A Blumer, J Blumer, A Ehrenfeucht, D Haussler, R McConnell Automata, Languages and Programming: 11th Colloquium Antwerp, Belgium, July …, 1984 | 30 | 1984 |
| Learning faster than promised by the Vapnik-Chervonenkis dimension A Blumer, N Littlestone Discrete Applied Mathematics 24 (1-3), 47-53, 1989 | 12 | 1989 |
| Minimax universal noiseless coding for unifilar and Markov sources (Corresp.) A Blumer IEEE transactions on information theory 33 (6), 925-930, 1987 | 9 | 1987 |
| Applications of DAWGs to data compression A Blumer Sequences: Combinatorics, compression, security, and transmission, 303-311, 1990 | 4 | 1990 |
| Bounds on the redundancy of noiseless source coding AC Blumer University of Illinois at Urbana-Champaign, 1982 | 4 | 1982 |
| Classifylearnablegeometricconceptwith the vapnik-chervonenkis dimension A Blumer, A Ehrenfeucht, D Haussler, M Warmuth Proc. 18th AnnualACM Symp. onTheoryofComputing, 1986 | 3 | 1986 |
| MHV recombination in vitro and in silico K Duca, A Blumer, M Locuta, J Fleming Proc. Second Intl. Conf. Systems Biology, 49-50, 2001 | 2 | 2001 |
| Noiseless compression using non-Markov models A Blumer Proc. Scientific Data Compression Workshop, 367-375, 1989 | 2 | 1989 |
| Fast approximate isorank for scalable global alignment of biological networks K Devkota, A Blumer, L Cowen, X Hu bioRxiv, 2023.03. 13.532445, 2023 | 1 | 2023 |
