default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGary D. Knott
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2017
[b2]Gary D. Knott:
Interpreting LISP - Programming and Data Structures, Second Edition. Apress 2017, ISBN 978-1-4842-2706-0- 1975
- [b1]Gary D. Knott:
Deletion in binary storage trees. Stanford University, USA, 1975
Journal Articles
- 2001
- [j17]Gerhard Opfer, Gary D. Knott:
Interpolating Cubic Splines. J. Approx. Theory 112(2): 319-321 (2001) - 2000
- [j16]Masaaki Yoshigi, Gary D. Knott, Bradley B. Keller:
Lumped parameter estimation for the embryonic chick vascular system: a time-domain approach using MLAB. Comput. Methods Programs Biomed. 63(1): 29-41 (2000) - 1994
- [j15]Jiang-Hsing Chu, Gary D. Knott:
An Analysis of Spiral Hashing. Comput. J. 37(8): 715-719 (1994) - 1993
- [j14]Jiang-Hsing Chu, Gary D. Knott:
A New Method for Computing Page-Fault Rates. SIAM J. Comput. 22(6): 1319-1330 (1993) - 1989
- [j13]Avraham Margalit, Gary D. Knott:
An algorithm for computing the union, intersection or difference of two polygons. Comput. Graph. 13(2): 167-183 (1989) - [j12]Jiang-Hsing Chu, Gary D. Knott:
An Analysis of B-trees and their Variants. Inf. Syst. 14(5): 359-370 (1989) - [j11]Gary D. Knott, Pilar de la Torre:
Hash Table Collision Resolution with Direct Chaining. J. Algorithms 10(1): 20-34 (1989) - 1987
- [j10]Gary D. Knott:
Computing polygon fill-lines. Comput. Graph. 11(1): 21-25 (1987) - 1984
- [j9]Gary D. Knott:
Direct-Chaining with Coalescing Lists. J. Algorithms 5(1): 7-21 (1984) - 1982
- [j8]Gary D. Knott:
Fixed-Bucket Binary Storage Trees. J. Algorithms 3(3): 276-287 (1982) - 1981
- [j7]Gary D. Knott:
Procedures for Managing Extendible Array Files. Softw. Pract. Exp. 11(1): 63-84 (1981) - 1977
- [j6]Gary D. Knott:
A Numbering System for Binary Trees. Commun. ACM 20(2): 113-115 (1977) - 1976
- [j5]Gary D. Knott:
A Numbering System for Permutations of Combinations. Commun. ACM 19(6): 355-356 (1976) - 1975
- [j4]Gary D. Knott:
Hashing Functions. Comput. J. 18(3): 265-278 (1975) - [j3]Gary D. Knott:
A proposal for certain process management and intercommunication primitives. ACM SIGOPS Oper. Syst. Rev. 9(1): 19-41 (1975) - 1974
- [j2]Gary D. Knott:
A Numbering Systems for Combinations. Commun. ACM 17(1): 45-46 (1974) - [j1]Gary D. Knott:
A proposal for certain process management and intercommunication primitives. ACM SIGOPS Oper. Syst. Rev. 8(4): 7-44 (1974)
Conference and Workshop Papers
- 2001
- [c5]Vladimir A. Kuznetsov, Gary D. Knott:
A Prediction Method for Multi-Class Systems Based on Limited Data. CBMS 2001: 279-284 - 1998
- [c4]Vladimir A. Kuznetsov, Gary D. Knott, Anna V. Ivshina:
Artificial immune system based on syndromes-response approach: recognition of the patterns of immune response and prognosis of therapy outcome. SMC 1998: 3804-3809 - 1972
- [c3]Gary D. Knott, Richard I. Shrager:
On-line modeling by curve-fitting. SIGGRAPH Seminar on Computer Graphics in Medicine 1972: 138-151 - 1971
- [c2]Gary D. Knott:
A Balanced Tree Storage and Retrieval Algorithm. SIGIR 1971: 175-196 - [c1]Gary D. Knott:
Expandable Open Addressing Hash Table Storage and Retrieval. SIGFIDET Workshop 1971: 187-206
Coauthor Index
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:
