![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 49 matches
- 1963
- J. L. Allard, A. R. Dobell, Thomas E. Hull:
Mixed Congruential Random Number Generators for Decimal Machines. J. ACM 10(2): 131-141 (1963) - R. L. Baber:
Tape Searching Techniques. J. ACM 10(4): 478-486 (1963) - Adi Ben-Israel, Stephen J. Wersan:
An Elimination Method for Computing the Generalized Inverse of an Arbitrary Complex Matrix. J. ACM 10(4): 532-537 (1963) - Elwyn R. Berlekamp:
Program for Double-Dummy Bridge Problems--A New Strategy for Mechanical Game Playing. J. ACM 10(3): 357-364 (1963) - Harold Borko, Myrna D. Bernick:
Automatic Document Classification. J. ACM 10(2): 151-162 (1963) - Fernando J. Corbató:
On the Coding of Jacobi's Method for Computing Eigenvalues and Eigenvectors of Real Symmetric Matrices. J. ACM 10(2): 123-125 (1963) - H. Allen Curtis:
Use of Decomposition Theory in the Solution of the State Assignment Problem of Sequential Machines. J. ACM 10(3): 386-411 (1963) - H. Allen Curtis:
Generalized Tree Circuit - The Basic Building Block of an Extended Decomposition Theory. J. ACM 10(4): 562-581 (1963) - George Emanuel:
The Wilf Stability Criterion for Numerical Integration. J. ACM 10(4): 557-561 (1963) - Edwin H. Farr:
Lattice Properties of Sequential Machines. J. ACM 10(3): 365-385 (1963) - Robert W. Floyd:
Syntactic Analysis and Operator Precedence. J. ACM 10(3): 316-333 (1963) - Ferdinand Freudenstein, Bernhard Roth:
Numerical Solution of Systems of Nonlinear Equations. J. ACM 10(4): 550-556 (1963) - Joyce Friedman:
A Semi-Decision Procedure for the Functional Calculus. J. ACM 10(1): 1-24 (1963) - Joyce Friedman:
A Computer Program for a Solvable Case of the Decision Problem. J. ACM 10(3): 348-356 (1963) - Arthur Gill:
On a Weight Distribution Problem, with Application to the Design of Stochastic Generators. J. ACM 10(1): 110-121 (1963) - Seymour Ginsburg, Gene F. Rose:
Some Recursively Unsolvable Problems in ALGOL-Like Languages. J. ACM 10(1): 29-47 (1963) - Seymour Ginsburg, Gene F. Rose:
Operations Which Preserve Definability in Languages. J. ACM 10(2): 175-195 (1963) - Seymour Ginsburg, Edwin H. Spanier:
Quotients of Context-Free Languages. J. ACM 10(4): 487-492 (1963) - Brian Gluss:
A Method for Obtaining Suboptimal Group-Testing Policies Using Dynamic Programming and Information Theory. J. ACM 10(1): 89-96 (1963) - Saul Gorn:
Detection of Generative Ambiguities in Context-Free Mechanical Languages. J. ACM 10(2): 196-208 (1963) - Albert A. Grau:
On the Reduction of Number Range in the Use of the Graeffe Process. J. ACM 10(4): 538-544 (1963) - Eldon R. Hansen:
On the Danilewski Method. J. ACM 10(1): 102-109 (1963) - Michael A. Harrison:
The Number of Classes of Invertible Boolean Functions. J. ACM 10(1): 25-28 (1963) - H. O. Hartley, D. L. Harris:
Monte Carlo Computations in Normal Correlation Problems. J. ACM 10(3): 302-306 (1963) - Juris Hartmanis:
Further Results on the Structure of Sequential Machines. J. ACM 10(1): 78-88 (1963) - Thomas N. Hibbard:
A Simple Sorting Algorithm. J. ACM 10(2): 142-150 (1963) - Robert W. House, Tibor Rado:
On a Computer Program for Obtaining Irreducible Representations for Two-Level Multiple Input-Output Logical Systems. J. ACM 10(1): 48-77 (1963) - Robert W. House, Tibor Rado:
Erratum: "On a Computer Program for Obtaining Irreducible Representations for Two-Level Multiple Input-Output Logical Systems". J. ACM 10(2): 256 (1963) - Thomas E. Hull, A. L. Creemer:
Efficiency of Predictor-Corrector Procedures. J. ACM 10(3): 291-301 (1963) - Sheldon Klein, Robert F. Simmons:
A Computational Approach to Grammatical Coding of English Words. J. ACM 10(3): 334-347 (1963)
skipping 19 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/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.
retrieved on 2024-07-08 19:48 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint