Search the dblp DataBase

Publications of Author

1. Larry E. Stanfel
   Tree Structures for Optimal Searching. [Citation Graph (1, 0)][DBLP]
   J. ACM, 1970, v:17, n:3, pp:508-517 [Journal]
   
2. Larry E. Stanfel
   A comment on optimal tree structures. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:10, pp:582- [Journal]
   
3. Larry E. Stanfel
   On the Structure of Anagrammatic Encodings [Citation Graph (0, 0)][DBLP]
   Information and Control, 1969, v:14, n:1, pp:1-8 [Journal]
   
4. Larry E. Stanfel
   Mathematical Optimization and the Synchronizing Properties of Encodings [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1988, v:77, n:1, pp:57-76 [Journal]
   
5. Larry E. Stanfel
   On a quantitative approach to improving document retrieval performance*. [Citation Graph (0, 0)][DBLP]
   Information Storage and Retrieval, 1968, v:4, n:3, pp:281-286 [Journal]
   
6. Larry E. Stanfel
   Sequential adaptation of retrieval systems based on user inputs. [Citation Graph (0, 0)][DBLP]
   Information Storage and Retrieval, 1971, v:7, n:2, pp:69-78 [Journal]
   
7. Larry E. Stanfel
   Optimal trees for a class of information retrieval problems. [Citation Graph (0, 0)][DBLP]
   Information Storage and Retrieval, 1973, v:9, n:1, pp:43-59 [Journal]
   
8. Larry E. Stanfel
   A brief note on minimax optimal trees. [Citation Graph (0, 0)][DBLP]
   Information Storage and Retrieval, 1974, v:10, n:7-8, pp:279- [Journal]
   
9. Larry E. Stanfel
   Designing simple library hierarchies using linear programming. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Manage., 1979, v:15, n:2, pp:65-69 [Journal]
   
10. Larry E. Stanfel
    Applications of clustering to information system design. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Manage., 1983, v:19, n:1, pp:37-50 [Journal]
    
11. Larry E. Stanfel
    Optimal tree lists for information storage and retrieval. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1976, v:2, n:2, pp:65-70 [Journal]
    
12. Larry E. Stanfel
    A unimodality property of optimal exhaustive prefix codes and retrieval trees over alphabets of varying size. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1977, v:2, n:4, pp:199-205 [Journal]
    
13. Larry E. Stanfel
    Experiments with a very efficient heuristic for clustering problems. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1979, v:4, n:4, pp:285-292 [Journal]
    
14. Larry E. Stanfel, J. Y. Chen
    A counter-example to a clustering heuristic. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1981, v:6, n:3, pp:229-230 [Journal]
    
15. Larry E. Stanfel
    Practical Aspects of Doubly Chained Trees for Retrieval. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1972, v:19, n:3, pp:425-436 [Journal]