![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Caxton C. Foster
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1997
- [j22]Caxton C. Foster:
Drawbacks of the One-Time Pad. Cryptologia 21(4): 350-352 (1997) - 1995
- [j21]Caxton C. Foster:
Secret Musical codewords. Cryptologia 19(2): 216 (1995) - 1992
- [j20]Caxton C. Foster:
A Comparison of vowel Identification Methods. Cryptologia 16(3): 282-286 (1992) - 1990
- [j19]Caxton C. Foster:
Vowel Distribution as a Clue to vowel Identification. Cryptologia 14(4): 355-362 (1990)
1980 – 1989
- 1982
- [c5]Steven P. Levitan, Caxton C. Foster:
Finding an extremum in a network. ISCA 1982: 321-325
1970 – 1979
- 1978
- [j18]Caxton C. Foster:
Cryptanalysis and Computers. Cryptologia 2(3): 236-237 (1978) - 1976
- [j17]Fanya S. Montalvo, Caxton C. Foster:
An Algorithm for Intercell Communication in a Tesselated Automaton. IEEE Trans. Computers 25(1): 99-102 (1976) - 1975
- [c4]Caxton C. Foster, Edward M. Riseman, Fred G. Stockton, Conrad Wogrin:
A novel multiply-by-three circuit. IEEE Symposium on Computer Arithmetic 1975: 185-187 - 1974
- [c3]Caxton C. Foster:
Socrates. ISCA 1974: 165-169 - 1973
- [j16]Caxton C. Foster:
A Generalization of AVL Trees. Commun. ACM 16(8): 513-517 (1973) - [j15]Caxton C. Foster:
Computer architecture. SIGARCH Comput. Archit. News 2(1): 13-18 (1973) - 1972
- [j14]Caxton C. Foster:
A View of Computer Architecture. Commun. ACM 15(7): 557-565 (1972) - [j13]Caxton C. Foster:
Computer Architecture. Computer 5(2): 18-19 (1972) - [j12]Caxton C. Foster:
The Next Three Generations. Computer 5(2): 39-42 (1972) - [j11]Caxton C. Foster:
A review of Dynamic memories with enhanced data access by Harold S. Stone. IEEETC Vol. C-21, #4, p 359-386, April 1972. SIGARCH Comput. Archit. News 1(2): 3-7 (1972) - [j10]Caxton C. Foster:
Something new: the Intel MCS-4 micro computer set. SIGARCH Comput. Archit. News 1(2): 16-17 (1972) - [j9]Edward M. Riseman, Caxton C. Foster:
The Inhibition of Potential Parallelism by Conditional Jumps. IEEE Trans. Computers 21(12): 1405-1411 (1972) - [j8]Caxton C. Foster, Edward M. Riseman:
Percolation of Code to Enhance Parallel Dispatching and Execution. IEEE Trans. Computers 21(12): 1411-1415 (1972) - 1971
- [j7]Caxton C. Foster:
Uncoupling Central Processor and Storage Device Speeds. Comput. J. 14(1): 45-48 (1971) - [j6]Caxton C. Foster:
An Unclever Time-Sharing System. ACM Comput. Surv. 3(1): 23-48 (1971) - [j5]Caxton C. Foster, Robert H. Gonter:
Conditional Interpretation of Operation Codes. IEEE Trans. Computers 20(1): 108-111 (1971) - [j4]Caxton C. Foster, Robert H. Gonter, Edward M. Riseman:
Measures of Op-Code Utilization. IEEE Trans. Computers 20(5): 582-584 (1971) - [j3]Caxton C. Foster, Fred D. Stockton:
Counting Responders in an Associative Memory. IEEE Trans. Computers 20(12): 1580-1583 (1971) - [c2]Caxton C. Foster:
A refutation of Carlson's Conjecture, or UMASS re-moulded. ACM Annual Conference 1971: 263-266
1960 – 1969
- 1968
- [j2]Caxton C. Foster:
Sorting Almost Ordered Arrays. Comput. J. 11(2): 134-137 (1968) - [j1]Caxton C. Foster:
Determination of Priority in Associative Memories. IEEE Trans. Computers 17(8): 788-789 (1968) - 1965
- [c1]Caxton C. Foster:
Information retrieval: information storage and retrieval using AVL trees. ACM National Conference 1965: 192-205
![](https://dblp.org/img/cog.dark.24x24.png)
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-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint