![](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 63 matches
- 1970
- Hiroshi Akima:
A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures. J. ACM 17(4): 589-602 (1970) - Robert Anderson, W. W. Bledsoe:
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness. J. ACM 17(3): 525-534 (1970) - Harry C. Andrews, J. Kane:
Kronecker Matrices, Computer Implementation, and Generalized Spectra. J. ACM 17(2): 260-268 (1970) - J. Gary Augustson, Jack Minker:
An Analysis of Some Graph Theoretical Cluster Techniques. J. ACM 17(4): 571-588 (1970) - Jean-Loup Baer, Daniel P. Bovet, Gerald Estrin:
Legality and Other Properties of Graph Models of Computations. J. ACM 17(3): 543-554 (1970) - Zamir Bavel, David E. Muller:
Connectivity and Reversibility in Automata. J. ACM 17(2): 231-240 (1970) - H. Lynn Beus:
The Use of Information in Sorting. J. ACM 17(3): 482-495 (1970) - Pierre E. Bonzon:
Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type. J. ACM 17(4): 675-682 (1970) - James M. Boyle, Albert A. Grau:
An Algorithmic Semantics for ALGOL 60 Identifier Denotation. J. ACM 17(2): 361-382 (1970) - Melvin A. Breuer:
Simplification of the Covering Problem with Application to Boolean Expressions. J. ACM 17(1): 166-181 (1970) - Bob F. Caviness:
On Canonical Forms and Simplification. J. ACM 17(2): 385-396 (1970) - Donald R. Chand, Sham S. Kapur:
An Algorithm for Convex Polytopes. J. ACM 17(1): 78-86 (1970) - Chin-Liang Chang:
The Unit Proof and the Input Proof in Theorem Proving. J. ACM 17(4): 698-707 (1970) - S. K. Chang, Arthur Gill:
Algorithmic Solution of the Change-Making Problem. J. ACM 17(1): 113-122 (1970) - Edward G. Coffman Jr., Richard R. Muntz, Hale F. Trotter:
Waiting Time Distributions for Processor-Sharing Systems. J. ACM 17(1): 123-130 (1970) - Alain Colmerauer:
Total Precedence Relations. J. ACM 17(1): 14-30 (1970) - Derek G. Corneil, C. C. Gotlieb:
An Efficient Algorithm for Graph Isomorphism. J. ACM 17(1): 51-64 (1970) - Colin W. Cryer:
On the Approximate Solution of Free Boundary Problems Using Finite Differences. J. ACM 17(3): 397-411 (1970) - Dennis F. Cudia:
General Problems of Formal Grammars. J. ACM 17(1): 31-43 (1970) - L. E. N. Delbrouck:
A Feedback Queueing System With Batch Arrivals, Bulk Service, and Queue-Dependent Service Time. J. ACM 17(2): 314-323 (1970) - Bennett L. Fox:
Accelerating List Processing in Discrete Programming. J. ACM 17(2): 383-384 (1970) - W. Donald Frazer, A. C. McKellar:
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting. J. ACM 17(3): 496-507 (1970) - Seymour Ginsburg, John E. Hopcroft:
Two-way balloon automata and AFL. J. ACM 17(1): 3-13 (1970) - Donald I. Good, Ralph L. London:
Computer Interval Arithmetic: Definition and Proof of Correct Implementation. J. ACM 17(4): 603-612 (1970) - William B. Gruttke:
Pseudo-Runge-Kutta Methods of the Fifth Order. J. ACM 17(4): 613-628 (1970) - Jerzy W. Grzymala-Busse:
Errata: "On the Periodic Representations and the Reducibility of Periodic Automata". J. ACM 17(4): 739 (1970) - Herbert M. Gurk, Jack Minker:
Storage Requirements for Information Handling Centers. J. ACM 17(1): 65-77 (1970) - Fred G. Gustavson, Werner Liniger, R. Willoughby:
Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations. J. ACM 17(1): 87-109 (1970) - Seymour Haber:
Sequences of Numbers That Are Approximately Completely Equidistributed. J. ACM 17(2): 269-272 (1970) - Masahiro Hashimoto:
A Method for Solving Large Matrix Equations Reduced From Fredholm Integral Equations of the Second Kind. J. ACM 17(4): 629-636 (1970)
skipping 33 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-06-30 14:40 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