On the time required for retention. - Daniel M. Berry; Laurian M. Chirica; John B. Johnston; David F. Martin; Arthur Sorkin (HLLCA, 1973)

Two PARALLEL EULER run time models: The dangling reference, impostor environment, and label problems. - Laurian M. Chirica; David F. Martin; Timothy A. Dreisbach; J. G. Peetz; Arthur Sorkin (HLLCA, 1973)

Time required for reference count management in retention block-structured languages. Part 1. - Daniel M. Berry; Laurian M. Chirica; John B. Johnston; David F. Martin; Arthur Sorkin (Int. J. Parallel Program., 1978)

On the time required for reference count management in retention block-structured languages. Part 2. - Daniel M. Berry; Laurian M. Chirica; John B. Johnston; David F. Martin; Arthur Sorkin (Int. J. Parallel Program., 1978)

Time required for garbage collection in retention block-structured languages. - Daniel M. Berry; Arthur Sorkin (Int. J. Parallel Program., 1978)

Requirements for a secure terminal switch. - Arthur Sorkin (Comput. Secur., 1983)

Measurement of cryptographic capability protection algorithms. - Arthur Sorkin; C. James Buchanan (Comput. Secur., 1984)

Lucifer, a Cryptographic Algorithm. - Arthur Sorkin (Cryptologia, 1984)

Some Comments on ''A Solution to a Problem with Morel and Renvoise's 'Global Optimization by Suppression of Partial Redundancies'. - Arthur Sorkin (ACM Trans. Program. Lang. Syst., 1989)

Some Comments on Moral and Renvoise's "Global Optimization by Suppression of Partial Redundancies". - Arthur Sorkin (ACM SIGPLAN Notices, 1996)

Some Comments on 'The Priority-Based Coloring Approach to Register Allocation'. - Arthur Sorkin (ACM SIGPLAN Notices, 1996)

LR(1) parser generation system: LR(1) error recovery, oracles, and generic tokens. - Arthur Sorkin; Peter Donovan (ACM SIGSOFT Softw. Eng. Notes, 2011)