Larry E. Stanfel

According to our database, Larry E. Stanfel authored at least 16 papers between 1968 and 1993.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of six.

1993

A methodology for designing large private line transmission networks with multiple facilities.

Martin J. Fischer, Gregor W. Swinsky, D. P. Garland, Larry E. Stanfel

Telecommun. Syst., 1993

1988

Mathematical Optimization and the Synchronizing Properties of Encodings

Larry E. Stanfel

Inf. Comput., April, 1988

1983

Applications of clustering to information system design.

Larry E. Stanfel

Inf. Process. Manag., 1983

1981

A counter-example to a clustering heuristic.

Larry E. Stanfel, Jason Jen-Yen Chen

Inf. Syst., 1981

1979

Experiments with a very efficient heuristic for clustering problems.

Larry E. Stanfel

Inf. Syst., 1979

Designing simple library hierarchies using linear programming.

Larry E. Stanfel

Inf. Process. Manag., 1979

1977

A unimodality property of optimal exhaustive prefix codes and retrieval trees over alphabets of varying size.

Larry E. Stanfel

Inf. Syst., 1977

1976

Optimal tree lists for information storage and retrieval.

Larry E. Stanfel

Inf. Syst., 1976

1974

A brief note on minimax optimal trees.

Larry E. Stanfel

Inf. Storage Retr., 1974

1973

Optimal trees for a class of information retrieval problems.

Larry E. Stanfel

Inf. Storage Retr., 1973

1972

Practical Aspects of Doubly Chained Trees for Retrieval.

Larry E. Stanfel

J. ACM, 1972

1971

Sequential adaptation of retrieval systems based on user inputs.

Larry E. Stanfel

Inf. Storage Retr., 1971

1970

Tree Structures for Optimal Searching.

Larry E. Stanfel

J. ACM, 1970

1969

On the Structure of Anagrammatic Encodings

Larry E. Stanfel

Inf. Control., January, 1969

A comment on optimal tree structures.

Larry E. Stanfel

Commun. ACM, 1969

1968

On a quantitative approach to improving document retrieval performance*.

Larry E. Stanfel

Inf. Storage Retr., 1968