Archie C. McKellar

According to our database, Archie C. McKellar authored at least 9 papers between 1965 and 1978.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1978

Dynamic Placement of Records in Linear Storage.

A. C. McKellar, C. K. Wong

J. ACM, 1978

1975

Near-Optimal Solutions to a 2-Dimensional Placement Problem.

Richard M. Karp, A. C. McKellar, C. K. Wong

SIAM J. Comput., 1975

1972

Bounds on Algorithms for String Generation.

A. C. McKellar, C. K. Wong

Acta Informatica, 1972

1971

A Fast Algorithm for the Disjunctive Decomposition of Switching Functions.

Vincent Yun-Shen Shen, Archie C. McKellar, Peter Weiner

IEEE Trans. Computers, 1971

1970

An Algorithm for the Disjunctive Decomposition of Switching Functions.

Vincent Yun-Shen Shen, Archie C. McKellar

IEEE Trans. Computers, 1970

Samplesort: A Sampling Approach to Minimal Storage Tree Sorting.

W. Donald Frazer, A. C. McKellar

J. ACM, 1970

1969

Organizing Matrices and Matrix Operations for Paged Memory Systems.

A. C. McKellar, Edward G. Coffman Jr.

Commun. ACM, 1969

1968

On the Motion of an Unbounded, Markov Queue in Random Access Storage.

Edward G. Coffman Jr., A. C. McKellar

IEEE Trans. Computers, 1968

1965

A Procedure for Synthesis of Switching Networks

Archie C. McKellar

PhD thesis, 1965