![](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 52 matches
- 1971
- Nabih N. Abdelmalek:
Linear L1 Approximation for a Discrete Point Set and L1 Solutions of Overdetermined Linear Equations. J. ACM 18(1): 41-47 (1971) - Igal Adiri:
A Dynamic Time-Sharing Priority Queue. J. ACM 18(4): 603-610 (1971) - Igal Adiri:
A Note on Some Mathematical Models of Time-Sharing Systems. J. ACM 18(4): 611-615 (1971) - Alfred V. Aho, Peter J. Denning, Jeffrey D. Ullman:
Principles of Optimal Page Replacement. J. ACM 18(1): 80-93 (1971) - James C. Alexander, A. I. Thaler:
The Boundary Count of Digital Pictures. J. ACM 18(1): 105-112 (1971) - Nico F. Benschop, H. C. Ratz:
A Mean Square Estimate of the Generated Roundoff Error in Constant Matrix Iterative Processes. J. ACM 18(1): 48-62 (1971) - U. Narayan Bhat, Richard E. Nance:
Busy Period Analysis of a Time-Sharing System Modeled as a Semi-Markov Process. J. ACM 18(2): 221-238 (1971) - Manuel Blum:
On Effective Procedures for Speeding Up Algorithms. J. ACM 18(2): 290-305 (1971) - W. S. Brown:
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors. J. ACM 18(4): 478-504 (1971) - W. S. Brown, Joseph F. Traub:
On Euclid's Algorithm and the Theory of Subresultants. J. ACM 18(4): 505-514 (1971) - James R. Bunch:
Equilibration of Symmetric Matrices in the Max-Norm. J. ACM 18(4): 566-572 (1971) - William H. Burge, Alan G. Konheim:
An Accessing Model. J. ACM 18(2): 400-404 (1971) - John Case:
A Note on Degrees of Self-Describing Turing Machines. J. ACM 18(2): 329-338 (1971) - Chin-Liang Chang, James R. Slagle:
Completeness of Linear Refutation for Theories with Equality. J. ACM 18(1): 126-136 (1971) - Stephen N. Cole:
Deterministic Pushdown Store Machines and Real-Time Computation. J. ACM 18(2): 306-328 (1971) - George E. Collins:
The Calculation of Multivariate Polynomial Resultants. J. ACM 18(4): 515-532 (1971) - Stephen A. Cook:
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers. J. ACM 18(1): 4-18 (1971) - Colin W. Cryer:
Topological Problems Arising When Solving Boundary Value Problems for Elliptic Partial Differential Equations by the Method of Finite Differences. J. ACM 18(1): 63-74 (1971) - C. Dill, C. William Gear:
A Graphical Search for Stiffly Stable Methods for Ordinary Differential Equations. J. ACM 18(1): 75-79 (1971) - Donald P. Gaver:
Analysis of Remote Terminal Backlogs under Heavy Demand Conditions. J. ACM 18(2): 405-415 (1971) - Donald P. Gaver, Peter A. W. Lewis:
Probability Models for Buffer Storage Allocation Problems. J. ACM 18(2): 186-198 (1971) - William Goffman:
A Mathematical Method for Analyzing the Growth of a Scientific Discipline. J. ACM 18(2): 173-185 (1971) - Michael A. Harrison, Mario Schkolnick:
A Grammatical Characterization of One-Way Nondeterministic Stack Languages. J. ACM 18(2): 148-172 (1971) - Juris Hartmanis, John E. Hopcroft:
An Overview of the Theory of Computational Complexity. J. ACM 18(2): 444-475 (1971) - Lee E. Heindel:
Integer Arithmetic Algorithms for Polynomial Real Zero Determination. J. ACM 18(4): 533-548 (1971) - Manfred H. Hueckel:
An Operator Which Locates Edges in Digitized Pictures. J. ACM 18(1): 113-125 (1971) - Keki B. Irani, Victor L. Wallace:
On Network Linguistics and the Conversational Design of Queueing Networks. J. ACM 18(4): 616-629 (1971) - Stephen C. Johnson:
On the Problem of Recognizing Zero. J. ACM 18(4): 559-565 (1971) - M. A. Kaplan, R. A. Papetti:
A Note on Quadrilateral Interpolation. J. ACM 18(4): 576-585 (1971) - William H. Kautz:
An Augmented Content-Addressed Memory Array for Implementation With Large-Scale Integration. J. ACM 18(1): 19-33 (1971)
skipping 22 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-08-20 06:05 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