Anselm Blumer

Orcid: 0009-0000-2802-3333

Affiliations:
  • Tufts University, Medford, USA


According to our database1, Anselm Blumer authored at least 15 papers between 1983 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast Approximate IsoRank for Scalable Global Alignment of Biological Networks.
Proceedings of the Research in Computational Molecular Biology, 2024

2011
Connectedness of PPI network neighborhoods identifies regulatory hub proteins.
Bioinform., 2011

2006
An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality.
Bioinform., 2006

1989
Learnability and the Vapnik-Chervonenkis dimension.
J. ACM, 1989

Learning faster than promised by the Vapnik-Chervonenkis dimension.
Discret. Appl. Math., 1989

Average sizes of suffix trees and DAWGs.
Discret. Appl. Math., 1989

1988
The Rényi redundancy of generalized Huffman codes.
IEEE Trans. Inf. Theory, 1988

1987
Minimax universal noiseless coding for unifilar and Markov sources.
IEEE Trans. Inf. Theory, 1987

Complete inverted files for efficient text retrieval and analysis.
J. ACM, 1987

Occam's Razor.
Inf. Process. Lett., 1987

1986
Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract)
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985
The Smallest Automaton Recognizing the Subwords of a Text.
Theor. Comput. Sci., 1985

1984
Building a Complete Inverted File for a Set of Text Files in Linear Time
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time.
Proceedings of the Automata, 1984

1983
Linear size finite automata for the set of all subwords of a word - an outline of results.
Bull. EATCS, 1983


  Loading...