1997 |
13 | | Hon F. Li,
David K. Probst:
Advances in Hardware Design and Verification, IFIP WG 10.5 International Conference on Correct Hardware Design and Verification Methods, 16-18 October 1997, Montréal, Québec, Canada
Chapman & Hall 1997 |
1994 |
12 | | David K. Probst:
Programming, Compiling and Executing Partially-Ordered Instruction Streams on Scalable Shared-Memory Multiprocessors.
HICSS (1) 1994: 584-593 |
1993 |
11 | | Gregor von Bochmann,
David K. Probst:
Computer Aided Verification, Fourth International Workshop, CAV '92, Montreal, Canada, June 29 - July 1, 1992, Proceedings
Springer 1993 |
10 | | David K. Probst,
Hon F. Li:
Verifying Timed Behavior Automata with Input/Output Critical Races.
CAV 1993: 424-437 |
1992 |
9 | | David K. Probst,
Hon F. Li:
Verifying Timed Behavior Automata with Nonbinary Delay Constraints.
CAV 1992: 123-136 |
1991 |
8 | | David K. Probst,
Hon F. Li:
Partial-Order Model Checking: A Guide for the Perplexed.
CAV 1991: 322-331 |
1990 |
7 | | David K. Probst,
Hon F. Li:
Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems.
CAV 1990: 146-155 |
6 | | Hon F. Li,
David K. Probst:
Optimal VLSI Dictionary Machines Without Compress Instructions.
IEEE Trans. Computers 39(5): 676-693 (1990) |
1988 |
5 | | David K. Probst,
Hon F. Li:
Abstract Specification of Synchronous Data Types for VLSI and Proving the Correctness of Systolic Network Implementations.
IEEE Trans. Computers 37(6): 710-720 (1988) |
1982 |
4 | | David K. Probst,
Vangalur S. Alagar:
An Adaptive Hybrid Algorithm for Multiplying Dense Polynomials.
EUROCAM 1982: 16-23 |
1980 |
3 | | David K. Probst,
Vangalur S. Alagar:
Corrigendum: A Family of Algorithms for Powering Sparse Polynomials.
SIAM J. Comput. 9(2): 439 (1980) |
1979 |
2 | | David K. Probst,
Vangalur S. Alagar:
A Family of Algorithms for Powering Sparse Polynomials.
SIAM J. Comput. 8(4): 626-644 (1979) |
1977 |
1 | | Vangalur S. Alagar,
David K. Probst:
Binomial-Expansion Algorithms for Copmuting Integer Powers of Sparse Polynomials.
International Computing Symposium 1977: 395-402 |