How Discreet is the Discrete Log? - Douglas L. Long; Avi Wigderson (STOC, 1983)

The Discrete Logarithm Hides O(log n) Bits. - Douglas L. Long; Avi Wigderson (SIAM J. Comput., 1988)

Task Interaction Graphs for Concurrency Analysis. - Douglas L. Long; Lori A. Clarke (ICSE, 1989)

Ada language considerations for concurrency analysis. - Douglas L. Long; Lori A. Clarke; Joseph Fialli (WADAS, 1989)

Data Flow Analysis of Concurrent Systems that Use the Rendezvous Model of Synchronization. - Douglas L. Long; Lori A. Clarke (Symposium on Testing, Analysis, and Verification, 1991)

A Prototype Secure Workflow Server. - Douglas L. Long; Julie Baker; Francis Fung (ACSAC, 1999)