David K. Probst

Publication Activity (10 Years)

Years Active: 1977-1994
Publications (10 Years): 0

Publications

David K. Probst
Programming, Compiling and Executing Partially-Ordered Instruction Streams on Scalable Shared-Memory Multiprocessors. HICSS (1) (1994)
David K. Probst, Hon Fung Li
Verifying Timed Behavior Automata with Input/Output Critical Races. CAV (1993)
David K. Probst, Hon Fung Li
Verifying Timed Behavior Automata with Nonbinary Delay Constraints. CAV (1992)
David K. Probst, Hon Fung Li
Partial-Order Model Checking: A Guide for the Perplexed. CAV (1991)
David K. Probst, Hon Fung Li
Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems. CAV (DIMACS/AMS volume) (1990)
Hon Fung Li, David K. Probst
Optimal VLSI Dictionary Machines Without Compress Instructions. IEEE Trans. Computers 39 (5) (1990)
David K. Probst, Hon Fung Li
Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems. CAV (1990)
David K. Probst, Hon Fung Li
Abstract Specification of Synchronous Data Types for VLSI and Proving the Correctness of Systolic Network Implementations. IEEE Trans. Computers 37 (6) (1988)
Vangalur S. Alagar, David K. Probst
A fast, low-space algorithm for multiplying dense multivariate polynomials. ACM Trans. Math. Softw. 13 (1) (1987)
David K. Probst, Vangalur S. Alagar
An Adaptive Hybrid Algorithm for Multiplying Dense Polynomials. EUROCAM (1982)
David K. Probst, Vangalur S. Alagar
Corrigendum: A Family of Algorithms for Powering Sparse Polynomials. SIAM J. Comput. 9 (2) (1980)
David K. Probst, Vangalur S. Alagar
A Family of Algorithms for Powering Sparse Polynomials. SIAM J. Comput. 8 (4) (1979)
Vangalur S. Alagar, David K. Probst
Binomial-Expansion Algorithms for Copmuting Integer Powers of Sparse Polynomials. International Computing Symposium (1977)