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 51 matches
- 1977
- Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
Code Generation for Expressions with Common Subexpressions. J. ACM 24(1): 146-160 (1977) - R. Attar, Aviezri S. Fraenkel:
Local Feedback in Full-Text Retrieval Systems. J. ACM 24(3): 397-417 (1977) - Brenda S. Baker:
An Algorithm for Structuring Flowgraphs. J. ACM 24(1): 98-120 (1977) - A. Michael Ballantyne, W. W. Bledsoe:
Automatic Proofs of Theorems in Analysis Using Nonstandard Techniques. J. ACM 24(3): 353-374 (1977) - Ian F. Blake, Alan G. Konheim:
Big Buckets Are (Are Not) Better! J. ACM 24(4): 591-606 (1977) - Francis T. Boesch, James F. Gimpel:
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization. J. ACM 24(2): 192-198 (1977) - Abraham Bookstein, Donald H. Kraft:
Operations Research Applied to Document Indexing and Retrieval Decisions. J. ACM 24(3): 418-427 (1977) - Alexandre Brandwajn:
A Queueing Model of Multiprogrammed Computer Systems Under Full Load Conditions. J. ACM 24(2): 222-240 (1977) - Tien Dai Bui:
Errata and Comments on a Paper by J. R. Cash. J. ACM 24(4): 623 (1977) - Rod M. Burstall, John Darlington:
A Transformation System for Developing Recursive Programs. J. ACM 24(1): 44-67 (1977) - Dennis de Champeaux, Lenie Sint:
An Improved Bidirectional Heuristic Search Algorithm. J. ACM 24(2): 177-191 (1977) - K. Mani Chandy, John H. Howard Jr., Donald F. Towsley:
Product Form and Local Balance in Queueing Networks. J. ACM 24(2): 250-263 (1977) - Douglas Comer, Ravi Sethi:
The Complexity of Trie Index Construction. J. ACM 24(3): 428-440 (1977) - Shawpawn Kumar Das:
A Machine Representation of Finite T0 Topologies. J. ACM 24(4): 676-692 (1977) - Philip J. Davis:
Proof, Completeness, Transcendentals, and Sampling. J. ACM 24(2): 298-310 (1977) - Richard A. DeMillo, K. Vairavan, Ekaterini Sycara-Cyranski:
A Study of Schedules as Models of Synchronous Parallel Computation. J. ACM 24(4): 544-565 (1977) - Guy Fayolle, Erol Gelenbe, Jacques Labetoulle:
Stability and Optimal Control of the Packet Switching Broadcast Channel. J. ACM 24(3): 375-386 (1977) - Charles M. Fiduccia, Yechezkel Zalcstein:
Algebras Having Linear Multiplicative Complexities. J. ACM 24(2): 311-331 (1977) - Joseph A. Goguen, James W. Thatcher, Eric G. Wagner, Jesse B. Wright:
Initial Algebra Semantics and Continuous Algebras. J. ACM 24(1): 68-95 (1977) - Susan L. Graham:
Special Editor's Note. J. ACM 24(1): 96-97 (1977) - Eric C. R. Hehner:
Information Content of Programs and Operation Encoding. J. ACM 24(2): 290-297 (1977) - Daniel S. Hirschberg:
Algorithms for the Longest Common Subsequence Problem. J. ACM 24(4): 664-675 (1977) - Micha Hofri:
On Certain Output-Buffer Management Techniques--A Stochastic Model. J. ACM 24(2): 241-249 (1977) - John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant:
On Time Versus Space. J. ACM 24(2): 332-337 (1977) - Edward C. Horvath, Shui Lam, Ravi Sethi:
A Level Algorithm for Preemptive Scheduling. J. ACM 24(1): 32-43 (1977) - Harry B. Hunt III, Daniel J. Rosenkrantz:
On Equivalence and Containment Problems for Formal Languages. J. ACM 24(3): 387-396 (1977) - K. Hwang, S. Bing Yao:
Optimal Batched Searching of Tree Structured Files in Multiprocessor Computer Systems. J. ACM 24(3): 441-454 (1977) - Laurent Hyafil, H. T. Kung:
The Complexity of Parallel Evaluation of Linear Recurrences. J. ACM 24(3): 513-521 (1977) - Toshihide Ibaraki:
The Power of Dominance Relations in Branch-and-Bound Algorithms. J. ACM 24(2): 264-279 (1977) - Oscar H. Ibarra, Chul E. Kim:
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors. J. ACM 24(2): 280-289 (1977)
skipping 21 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-11-13 10:30 CET 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