Остановите войну!
for scientists:
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 34 matches
- 1985
- Daniel M. Berry:
A Denotational Semantics for Shared-Memory Parallelism and Nondeterminism. Acta Informatica 21: 599-627 (1985) - Marina C. Chen, Martin Rem:
Deadlock-Freedom in Resource Contentions. Acta Informatica 21: 585-598 (1985) - A. J. Fisher:
Practical LL(1)-Based Parsing of van Wijngaarden Grammars. Acta Informatica 21: 559-584 (1985) - Jacques Lenfant, Serge Tahé:
Permuting Data with the Omega Network. Acta Informatica 21: 629-641 (1985) - Rüdiger Valk, Matthias Jantzen:
The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. Acta Informatica 21: 643-674 (1985) - William E. Wright:
Some Average Performance Measures for the B-Tree. Acta Informatica 21: 541-557 (1985) - 1984
- Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Françoise Gire:
Bicentres de langages algébriques. Acta Informatica 21: 209-227 (1984) - Howard Barringer, J. H. Cheng, Cliff B. Jones:
A Logic Covering Undefinedness in Program Proofs. Acta Informatica 21: 251-269 (1984) - G. Bauer, Friedrich Otto:
Finite Complete Rewriting Systems and the Complexity of the Word Problem. Acta Informatica 21: 521-540 (1984) - Rudolf Bayer, Peter Schlichtiger:
Data Management Support for Database Management. Acta Informatica 21: 1-28 (1984) - Jan A. Bergstra, John V. Tucker:
The Axiomatic Semantics of Programs Based on Hoare's Logic. Acta Informatica 21: 293-320 (1984) - Eike Best, Klaus Voss:
Free Choice Systems Have Home States. Acta Informatica 21: 89-100 (1984) - Richard S. Bird:
Using Circular Programs to Eliminate Multiple Traversals of Data. Acta Informatica 21: 239-250 (1984) - Norbert Blum, Martin Seysen:
Characterization of all Optimal Networks for a Simultaneous Computation of AND and NOR. Acta Informatica 21: 171-181 (1984) - Mikhail A. Bulyonkov:
Polyvariant Mixed Computation for Analyzer Programs. Acta Informatica 21: 473-484 (1984) - Nigel P. Chapman:
LALR (1, 1) Parser Generation for Regular Right Part Grammars. Acta Informatica 21: 29-45 (1984) - Christian Choffrut, Karel Culík II:
On Real-Time Cellular Automata and Trellis Automata. Acta Informatica 21: 393-407 (1984) - Edward G. Coffman Jr., Michael A. Langston:
A Performance Guarantee for the Greedy Set-Partitioning Algorithm. Acta Informatica 21: 409-415 (1984) - Gerardo Costa, Colin Stirling:
A Fair Calculus of Communicating Systems. Acta Informatica 21: 417-441 (1984) - Pierre Deransart, Martin Jourdan, Bernard Lorho:
Speeding up Circularity Tests for Attribute Grammars. Acta Informatica 21: 375-391 (1984) - Luc Devroye:
A Probabilistic Analysis of the Height of Tries and of the Complexity of Triesort. Acta Informatica 21: 229-237 (1984) - Will D. Gillett:
On Binary Tree Encodements. Acta Informatica 21: 183-192 (1984) - Ralf Hartmut Güting:
Optimal Divide-and-Conquer to Compute Measure and Contour for a Set of Iso-Rectangles. Acta Informatica 21: 271-291 (1984) - Matthew Hennessy:
Axiomatising Finite Delay Operators. Acta Informatica 21: 61-88 (1984) - Stefan Hertel, Martti Mäntylä, Kurt Mehlhorn, Jürg Nievergelt:
Space Sweep Solves Intersection of Convex Polyhedra. Acta Informatica 21: 501-519 (1984) - Shou-Hsuan Stephen Huang, C. K. Wong:
Generalized Binary Split Trees. Acta Informatica 21: 113-123 (1984) - Oscar H. Ibarra, Sam M. Kim:
A Characterization of Systolic Binary Tree Automata and Applications. Acta Informatica 21: 193-207 (1984) - Donald L. Iglehart, Gerald S. Shedler:
Simulation Output Analysis for Local Area Computer Networks. Acta Informatica 21: 321-338 (1984) - Clement H. C. Leung, Qui Hoon Choo:
The Paging Drum Queue: A Uniform Perspective and Further Results. Acta Informatica 21: 485-500 (1984) - Boris D. Lubachevsky:
An Approach to Automating the Verification of Compact Parallel Coordination Programs I. Acta Informatica 21: 125-169 (1984)
skipping 4 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-05-28 18:29 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