The monotone and planar circuit value problems are log space complete for P. - Leslie M. Goldschlager (SIGACT News, 1977)

A Unified Approach to Models of Synchronous Parallel Machines - Leslie M. Goldschlager (STOC, 1978)

A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem. - Leslie M. Goldschlager (Inf. Process. Lett., 1980)

Varepsilon-Productions in Context-Free Grammars. - Leslie M. Goldschlager (Acta Informatica, 1981)

Recursion in Small Storage. - Leslie M. Goldschlager (Softw. Pract. Exp., 1981)

Short Algorithms for Space-Filling Curves. - Leslie M. Goldschlager (Softw. Pract. Exp., 1981)

A universal interconnection pattern for parallel computers. - Leslie M. Goldschlager (J. ACM, 1982)

Some Area-Time Tradeoffs for VLSI. - Richard P. Brent; Leslie M. Goldschlager (SIAM J. Comput., 1982)

The Maximum Flow Problem is Log Space Complete for P. - Leslie M. Goldschlager; Ralph A. Shaw; John Staples (Theor. Comput. Sci., 1982)

On the Construction of Parallel Computers from Various Bases of Boolean Functions. - Leslie M. Goldschlager; Ian Parberry (Theor. Comput. Sci., 1986)

Integrating gestures into the user-interface management system. - Xiao Yan Su; Leslie M. Goldschlager; Bala Srinivasan 002 (Vis. Comput., 1997)