default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid K. Probst
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1997
[e2]Hon Fung 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. IFIP Conference Proceedings 105, Chapman & Hall 1997, ISBN 0-412-81330-0 [contents]- 1994
- [c8]David K. Probst:
Programming, Compiling and Executing Partially-Ordered Instruction Streams on Scalable Shared-Memory Multiprocessors. HICSS (1) 1994: 584-593 - 1993
- [c7]David K. Probst, Hon Fung Li:
Verifying Timed Behavior Automata with Input/Output Critical Races. CAV 1993: 424-437 - [e1]Gregor von Bochmann, David K. Probst:
Computer Aided Verification, Fourth International Workshop, CAV '92, Montreal, Canada, June 29 - July 1, 1992, Proceedings. Lecture Notes in Computer Science 663, Springer 1993, ISBN 3-540-56496-9 [contents] - 1992
- [c6]David K. Probst, Hon Fung Li:
Verifying Timed Behavior Automata with Nonbinary Delay Constraints. CAV 1992: 123-136 - 1991
- [c5]David K. Probst, Hon Fung Li:
Partial-Order Model Checking: A Guide for the Perplexed. CAV 1991: 322-331 - 1990
- [j5]Hon Fung Li, David K. Probst:
Optimal VLSI Dictionary Machines Without Compress Instructions. IEEE Trans. Computers 39(5): 676-693 (1990) - [c4]David K. Probst, Hon Fung Li:
Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems. CAV 1990: 146-155 - [c3]David K. Probst, Hon Fung Li:
Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems. CAV (DIMACS/AMS volume) 1990: 15-24
1980 – 1989
- 1988
- [j4]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): 710-720 (1988) - 1987
- [j3]Vangalur S. Alagar, David K. Probst:
A fast, low-space algorithm for multiplying dense multivariate polynomials. ACM Trans. Math. Softw. 13(1): 35-57 (1987) - 1982
- [c2]David K. Probst, Vangalur S. Alagar:
An Adaptive Hybrid Algorithm for Multiplying Dense Polynomials. EUROCAM 1982: 16-23 - 1980
- [j2]David K. Probst, Vangalur S. Alagar:
Corrigendum: A Family of Algorithms for Powering Sparse Polynomials. SIAM J. Comput. 9(2): 439 (1980)
1970 – 1979
- 1979
- [j1]David K. Probst, Vangalur S. Alagar:
A Family of Algorithms for Powering Sparse Polynomials. SIAM J. Comput. 8(4): 626-644 (1979) - 1977
- [c1]Vangalur S. Alagar, David K. Probst:
Binomial-Expansion Algorithms for Copmuting Integer Powers of Sparse Polynomials. International Computing Symposium 1977: 395-402
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
