David K. Probst - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

1994

Programming, Compiling and Executing Partially-Ordered Instruction Streams on Scalable Shared-Memory MultiprocessorsDavid K. Probst. hicss 1994: 584-593

1993

Verifying Timed Behavior Automata with Input/Output Critical RacesDavid K. Probst, Hon F. Li. cav 1993: 424-437

1992

Verifying Timed Behavior Automata with Nonbinary Delay ConstraintsDavid K. Probst, Hon F. Li. cav 1993: 123-136

1991

Partial-Order Model Checking: A Guide for the PerplexedDavid K. Probst, Hon F. Li. cav 1992: 322-331

1990

Optimal VLSI Dictionary Machines Without Compress InstructionsHon F. Li, David K. Probst. TC, 39(5):676-693, 1990.

Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous SystemsDavid K. Probst, Hon F. Li. cav 1991: 146-155

Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous SystemsDavid K. Probst, Hon Fung Li. dimacs 1991: 15-24

1988

Abstract Specification of Synchronous Data Types for VLSI and Proving the Correctness of Systolic Network ImplementationsDavid K. Probst, Hon F. Li. TC, 37(6):710-720, 1988.

1987

A fast, low-space algorithm for multiplying dense multivariate polynomialsVangalur S. Alagar, David K. Probst. TOMS, 13(1):35-57, 1987. [doi]

1982

An Adaptive Hybrid Algorithm for Multiplying Dense PolynomialsDavid K. Probst, Vangalur S. Alagar. eurocal 1982: 16-23

1980

Corrigendum: A Family of Algorithms for Powering Sparse PolynomialsDavid K. Probst, Vangalur S. Alagar. SICOMP, 9(2):439, 1980.

1979

A Family of Algorithms for Powering Sparse PolynomialsDavid K. Probst, Vangalur S. Alagar. SICOMP, 8(4):626-644, 1979.

1977

Binomial-Expansion Algorithms for Copmuting Integer Powers of Sparse PolynomialsVangalur S. Alagar, David K. Probst. icsym 1977: 395-402

Sign in or sign up to see more results.

runs on WebDSL