David K. Probst

According to our database1, David K. Probst authored at least 12 papers between 1977 and 1994.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1994
Programming, Compiling and Executing Partially-Ordered Instruction Streams on Scalable Shared-Memory Multiprocessors.
Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

1993
Verifying Timed Behavior Automata with Input/Output Critical Races.
Proceedings of the Computer Aided Verification, 5th International Conference, 1993

1992
Verifying Timed Behavior Automata with Nonbinary Delay Constraints.
Proceedings of the Computer Aided Verification, Fourth International Workshop, 1992

1991
Partial-Order Model Checking: A Guide for the Perplexed.
Proceedings of the Computer Aided Verification, 3rd International Workshop, 1991

1990
Optimal VLSI Dictionary Machines Without Compress Instructions.
IEEE Trans. Computers, 1990

Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems.
Proceedings of the Computer Aided Verification, 2nd International Workshop, 1990

1988
Abstract Specification of Synchronous Data Types for VLSI and Proving the Correctness of Systolic Network Implementations.
IEEE Trans. Computers, 1988

1987
A fast, low-space algorithm for multiplying dense multivariate polynomials.
ACM Trans. Math. Softw., 1987

1982
An Adaptive Hybrid Algorithm for Multiplying Dense Polynomials.
Proceedings of the Computer Algebra, 1982

1980
Corrigendum: A Family of Algorithms for Powering Sparse Polynomials.
SIAM J. Comput., 1980

1979
A Family of Algorithms for Powering Sparse Polynomials.
SIAM J. Comput., 1979

1977
Binomial-Expansion Algorithms for Copmuting Integer Powers of Sparse Polynomials.
Proceedings of the International Computing Symposium 1977, 1977


  Loading...