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 67 matches
- 1976
- Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman:
Bounds on the Complexity of the Longest Common Subsequence Problem. J. ACM 23(1): 1-12 (1976) - Alfred V. Aho, Stephen C. Johnson:
Optimal Code Generation for Expression Trees. J. ACM 23(3): 488-501 (1976) - Richard P. Brent:
Fast Multiple-Precision Evaluation of Elementary Functions. J. ACM 23(2): 242-251 (1976) - John L. Bruno:
Sequencing Jobs with Stochastic Task Structures on a Single Machine. J. ACM 23(4): 655-664 (1976) - John L. Bruno, Ravi Sethi:
Code Generation for a One-Register Machine. J. ACM 23(3): 502-510 (1976) - William H. Burge:
An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys. J. ACM 23(3): 451-454 (1976) - Jeff R. Cash:
Semi-Implicit Runge-Kutta Procedures with Error Estimates for the Numerical Integration of Stiff Systems of Ordinary Differential Equations. J. ACM 23(3): 455-460 (1976) - Lena Chang, James F. Korsh:
Canonical Coin Changing and Greedy Solutions. J. ACM 23(3): 418-422 (1976) - R. A. Cody, Edward G. Coffman Jr.:
Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices. J. ACM 23(1): 103-115 (1976) - R. A. Cody, Edward G. Coffman Jr.:
Errata: "Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices". J. ACM 23(3): 572 (1976) - Kenny S. Crump:
Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation. J. ACM 23(1): 89-96 (1976) - Narsingh Deo:
Note on Hopcroft and Tarjan's Planarity Algorithm. J. ACM 23(1): 74-75 (1976) - Mark J. Eisner, Dennis G. Severance:
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases. J. ACM 23(4): 619-635 (1976) - Maarten H. van Emden, Robert A. Kowalski:
The Semantics of Predicate Logic as a Programming Language. J. ACM 23(4): 733-742 (1976) - Shimon Even, Robert Endre Tarjan:
A Combinatorial Problem Which Is Complete in Polynomial Space. J. ACM 23(4): 710-719 (1976) - Ronald Fagin, Malcolm C. Easton:
The independence of miss ratio on page size. J. ACM 23(1): 128-146 (1976) - Alan Feldstein, Richard Goodman:
Convergence Estimates for the Distribution of Trailing Digits. J. ACM 23(2): 287-297 (1976) - Donald Fraser:
Array Permutation by Index-Digit Permutation. J. ACM 23(2): 298-309 (1976) - Harold N. Gabow:
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs. J. ACM 23(2): 221-234 (1976) - M. R. Garey, David S. Johnson:
The Complexity of Near-Optimal Graph Coloring. J. ACM 23(1): 43-49 (1976) - M. R. Garey, David S. Johnson:
Scheduling Tasks with Nonuniform Deadlines on Two Processors. J. ACM 23(3): 461-467 (1976) - Seymour Ginsburg, Nancy A. Lynch:
Size complexity in context-free grammars forms. J. ACM 23(4): 582-598 (1976) - Teofilo F. Gonzalez, Sartaj Sahni:
Open Shop Scheduling to Minimize Finish Time. J. ACM 23(4): 665-679 (1976) - Susan L. Graham, Mark N. Wegman:
A Fast and Usually Linear Algorithm for Global Flow Analysis. J. ACM 23(1): 172-202 (1976) - Britton Harris:
A Code for the Transportation Problem of Linear Programming. J. ACM 23(1): 155-157 (1976) - John P. Hayes:
Enumeration of Fanout-Free Boolean Functions. J. ACM 23(4): 700-709 (1976) - Don Eric Heller, D. K. Stevenson, Joseph F. Traub:
Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers. J. ACM 23(4): 636-654 (1976) - Daniel S. Hirschberg, C. K. Wong:
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables. J. ACM 23(1): 147-154 (1976) - Christoph M. Hoffmann, Lawrence H. Landweber:
A Completeness Theorem for Straight-Line Programs with Structured Variables. J. ACM 23(1): 203-220 (1976) - Steven L. Horowitz, Theodosios Pavlidis:
Picture Segmentation by a Tree Traversal Algorithm. J. ACM 23(2): 368-388 (1976)
skipping 37 more matches
loading more results
failed to load more results, please try again later
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-09-29 08:24 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