Binomial-Expansion Algorithms for Copmuting Integer Powers of Sparse Polynomials. - Vangalur S. Alagar; David K. Probst (International Computing Symposium, 1977)

A Family of Algorithms for Powering Sparse Polynomials. - David K. Probst; Vangalur S. Alagar (SIAM J. Comput., 1979)

Corrigendum: A Family of Algorithms for Powering Sparse Polynomials. - David K. Probst; Vangalur S. Alagar (SIAM J. Comput., 1980)

An Adaptive Hybrid Algorithm for Multiplying Dense Polynomials. - David K. Probst; Vangalur S. Alagar (EUROCAM, 1982)

A fast, low-space algorithm for multiplying dense multivariate polynomials. - Vangalur S. Alagar; David K. Probst (ACM Trans. Math. Softw., 1987)

Abstract Specification of Synchronous Data Types for VLSI and Proving the Correctness of Systolic Network Implementations. - David K. Probst; Hon Fung Li (IEEE Trans. Computers, 1988)

Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems. - David K. Probst; Hon Fung Li (CAV, 1990)

Optimal VLSI Dictionary Machines Without Compress Instructions. - Hon Fung Li; David K. Probst (IEEE Trans. Computers, 1990)

Partial-Order Model Checking: A Guide for the Perplexed. - David K. Probst; Hon Fung Li (CAV, 1991)

Verifying Timed Behavior Automata with Nonbinary Delay Constraints. - David K. Probst; Hon Fung Li (CAV, 1992)

Verifying Timed Behavior Automata with Input/Output Critical Races. - David K. Probst; Hon Fung Li (CAV, 1993)

Programming, Compiling and Executing Partially-Ordered Instruction Streams on Scalable Shared-Memory Multiprocessors. - David K. Probst (HICSS (1), 1994)