default search action
Anselm Blumer
Person information
- affiliation: Tufts University, Medford, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c4]Kapil Devkota
, Anselm Blumer
Fast Approximate IsoRank for Scalable Global Alignment of Biological Networks. RECOMB 2024: 1-16
2010 – 2019
- 2011
- [j11]Andrew D. Fox, Benjamin J. Hescott, Anselm Blumer, Donna K. Slonim
Connectedness of PPI network neighborhoods identifies regulatory hub proteins. Bioinform. 27(8): 1135-1142 (2011)
2000 – 2009
- 2006
- [j10]Jeongah Yoon, Anselm Blumer, Kyongbum Lee
An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality. Bioinform. 22(24): 3106-3108 (2006)
1980 – 1989
- 1989
- [j9]Anselm Blumer, Andrzej Ehrenfeucht, David Haussler:
Average sizes of suffix trees and DAWGs. Discret. Appl. Math. 24(1-3): 37-45 (1989) - [j8]Anselm Blumer, Nick Littlestone:
Learning faster than promised by the Vapnik-Chervonenkis dimension. Discret. Appl. Math. 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 Trans. Inf. 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 Trans. Inf. 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. Bull. EATCS 21: 12-20 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-26 18:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: