The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Anselm Blumer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth
    Learnability and the Vapnik-Chervonenkis dimension. [Citation Graph (6, 0)][DBLP]
    J. ACM, 1989, v:36, n:4, pp:929-965 [Journal]
  2. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth
    Occam's Razor. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:6, pp:377-380 [Journal]
  3. Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht
    Complete inverted files for efficient text retrieval and analysis. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1987, v:34, n:3, pp:578-595 [Journal]
  4. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:109-118 [Conf]
  5. 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 [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:349-358 [Conf]
  6. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth
    Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:273-282 [Conf]
  7. Jeongah Yoon, Anselm Blumer, Kyongbum Lee
    An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:24, pp:3106-3108 [Journal]
  8. 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. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1983, v:21, n:, pp:12-20 [Journal]
  9. Anselm Blumer, J. Blumer, David Haussler, Andrzej Ehrenfeucht, M. T. Chen, Joel I. Seiferas
    The Smallest Automaton Recognizing the Subwords of a Text. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:40, n:, pp:31-55 [Journal]
  10. Anselm Blumer
    Minimax universal noiseless coding for unifilar and Markov sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:6, pp:925-0 [Journal]
  11. Anselm Blumer, Robert J. McEliece
    The Rényi redundancy of generalized Huffman codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1242-1249 [Journal]

  12. Average sizes of suffix trees and DAWGs. [Citation Graph (, )][DBLP]


  13. Learning faster than promised by the Vapnik-Chervonenkis dimension. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002