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 27 matches
- 1980
- David R. Barstow:
Remarks on "A Synthesis of Several Sorting Algorithms" by John Darlington. Acta Informatica 13: 225-227 (1980) - Jon Louis Bentley, Hermann A. Maurer:
Efficient Worst-Case Data Structures for Range Searching. Acta Informatica 13: 155-168 (1980) - Alfs T. Berztiss:
Depth-First K-Trees and Critical Path Analysis. Acta Informatica 13: 325-346 (1980) - Hans Kleine Büning, Lutz Priese:
Universal Asynchronous Iterative Arrays of Mealy Automata. Acta Informatica 13: 269-285 (1980) - Edmund M. Clarke:
Proving Correctness of Coroutines Without History Variables. Acta Informatica 13: 169-188 (1980) - Edsger W. Dijkstra:
Some Beautiful Arguments Using Mathematical Induction. Acta Informatica 13: 1-8 (1980) - Charles N. Fischer, D. R. Milton, S. B. Quiring:
Efficient LL(1) Error Correction and Recovery Using Only Insertions. Acta Informatica 13: 141-154 (1980) - William R. Franta, Mark Benedict Bilodeau:
Analysis of a Prioritized CSMA Protocol Based on Staggered Delays. Acta Informatica 13: 299-324 (1980) - Zvi Galil:
Applications of Efficient Mergeable Heaps for Optimization Problems on Trees. Acta Informatica 13: 53-58 (1980) - Gaston H. Gonnet, Lawrence D. Rogers, J. Alan George:
An Algorithmic and Complexity Analysis of Interpolation Search. Acta Informatica 13: 39-52 (1980) - Philip Heidelberger:
Variance Reduction Techniques for the Simulation of Markov Process. Acta Informatica 13: 21-37 (1980) - Christoph M. Hoffmann:
Semantic Properties of Lucid's Compute Clause and its Compilation. Acta Informatica 13: 9-20 (1980) - Uwe Kastens:
Ordered Attributed Grammars. Acta Informatica 13: 229-256 (1980) - Chandra M. R. Kintala, Detlef Wotschke:
Amounts of Nondeterminism in Finite Automata. Acta Informatica 13: 199-204 (1980) - Michel Latteux:
Sur les générateurs algébriques et linéaires. Acta Informatica 13: 347-363 (1980) - Hermann A. Maurer, Maurice Nivat:
Rational Bijection of Rational Sets. Acta Informatica 13: 365-378 (1980) - Hermann A. Maurer, Arto Salomaa, Derick Wood:
On Generators and Generative Capacity of EOL Forms. Acta Informatica 13: 87-107 (1980) - Bernhard Mescheder:
On the Number of Active-Operations Needed to Compute the Discrete Fourier Transform. Acta Informatica 13: 383-408 (1980) - Susumu Morito, Harvey M. Salkin:
Using the Blankinship Algorithm to Find the General Solution of a Linear Diophantine Equation. Acta Informatica 13: 379-382 (1980) - Stefan Reisch:
Gobang ist PSPACE-vollständig. Acta Informatica 13: 59-66 (1980) - Christophe Reutenauer:
An Ogden-Like Iteration Lemma for Rational Power Series. Acta Informatica 13: 189-197 (1980) - Johannes Röhrich:
Methods for the Automatic Construction of Error Correcting Parsers. Acta Informatica 13: 115-139 (1980) - Hans-Anton Rollik:
Automaten in planaren Graphen. Acta Informatica 13: 287-298 (1980) - Grzegorz Rozenberg, Derick Wood:
Context-Free Grammars With Selective Rewriting. Acta Informatica 13: 257-268 (1980) - Jörg H. Siekmann, Graham Wrightson:
Paramodulated Connection Graphs. Acta Informatica 13: 67-86 (1980) - Frank Wm. Tompa:
A Practical Example of the Specification of Abstract Data Types. Acta Informatica 13: 205-224 (1980) - Ingo Wegener:
A new Lower Bound on the Monotone Network Complexity of Boolean Sums. Acta Informatica 13: 109-114 (1980)
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-10-02 06:56 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