Остановите войну!
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 36 matches
- 1987
- Henk Alblas:
One-Pass Transformations of Attributed Program Trees. Acta Informatica 24(3): 299-352 (1987) - J. W. de Bakker, John-Jules Ch. Meyer:
Order and Metric in the Stream Semantics of Elemental Concurrency. Acta Informatica 24(5): 491-511 (1987) - Bernd Becker:
An Easily Testable Optimal-Time VLSI-Multiplier. Acta Informatica 24(4): 363-380 (1987) - Edward A. Bender, Cheryl E. Praeger, Nicholas C. Wormald:
Optimal Worst Case Trees. Acta Informatica 24(4): 475-489 (1987) - Jacek Blazewicz, Wieslaw Kubiak, Hans Röck, Jayme Luiz Szwarcfiter:
Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. Acta Informatica 24(5): 513-524 (1987) - Bernard Chazelle:
Some Techniques for Geometric Searching with Implicit Set Representations. Acta Informatica 24(5): 565-582 (1987) - Shyamal K. Chowdhury, Pradip K. Srimani:
Worst Case Performance of Weighted Buddy Systems. Acta Informatica 24(5): 555-564 (1987) - Patrick Cousot, Radhia Cousot:
Sometime = Always + Recursion = Always on the Equivalence of the Intermittent and Invariant Assertions Methods for Proving Inevitability Properties of Programs. Acta Informatica 24(1): 1-31 (1987) - Walter Cunto, Jose Luis Gascon:
Improving Time and Space Efficiency in Generalized Binary Search Trees. Acta Informatica 24(5): 583-594 (1987) - Luc Devroye:
Branching Processes in the Analysis of the Heights of Trees. Acta Informatica 24(3): 277-298 (1987) - Andrzej Duda, Tadeusz Czachórski:
Performance Evaluation of Fork and Join Synchronization Primitives. Acta Informatica 24(5): 525-553 (1987) - Paul E. S. Dunne:
A Result on k -Valent Graphs and Its Application to a Graph Embedding Problem. Acta Informatica 24(4): 447-459 (1987) - Oded Goldreich, Liuba Shrira:
Electing a Leader in a Ring with Link Failures. Acta Informatica 24(1): 79-91 (1987) - Lawrence A. Harris:
SLR(1) and LALR(1) Parsing for Unrestricted Grammars. Acta Informatica 24(2): 191-209 (1987) - Stephan Heilbrunner, Steffen Hölldobler:
The Undecidability of the Unification and Matching Problem for Canonical Theories. Acta Informatica 24(2): 157-171 (1987) - Albert Hoogewijs:
Partial-Predicate Logic in Computer Science. Acta Informatica 24(4): 381-393 (1987) - Susan Horwitz, Alan J. Demers, Tim Teitelbaum:
An Efficient General Iterative Algorithm for Dataflow Analysis. Acta Informatica 24(6): 679-694 (1987) - Chua-Huang Huang, Christian Lengauer:
The Derivation of Systolic Implementations of Programs. Acta Informatica 24(6): 595-632 (1987) - Ryszard Janicki:
A Formal Semantics for Concurrent Systems with a Priority Relation. Acta Informatica 24(1): 33-55 (1987) - Samuel N. Kamin:
The Expressive Theory of Stacks. Acta Informatica 24(6): 695-709 (1987) - Deepak Kapur, Paliath Narendran, Hantao Zhang:
On Sufficient-Completeness and Related Properties of Term Rewriting Systems. Acta Informatica 24(4): 395-415 (1987) - Uwe Kastens:
Lifetime Analysis for Attributes. Acta Informatica 24(6): 633-651 (1987) - M. Kempf, Rudolf Bayer, Ulrich Güntzer:
Time Optimal Left to Right Construction of Position Trees. Acta Informatica 24(4): 461-474 (1987) - S. Kiran Kumar, C. Pandu Rangan:
A Linear Space Algorithm for the LCS Problem. Acta Informatica 24(3): 353-362 (1987) - Manfred Kunde:
Lower Bounds for Sorting on Mesh-Connected Architectures. Acta Informatica 24(2): 121-130 (1987) - Marek J. Lao:
Combinator-Based Compilation of Recursive Functions with Different Parameter Passing Modes. Acta Informatica 24(6): 653-678 (1987) - Clement H. C. Leung:
Analysis of Space Allocation in a Generally Fragmented Linear Store. Acta Informatica 24(1): 93-104 (1987) - George Loizou, Peter Thanisch:
Losslessness and Project-Join Constructibility in Relational Databases. Acta Informatica 24(2): 131-144 (1987) - Ali Mili, Jules Desharnais, Fatma Mili:
Relational Heuristics for the Design of Deterministic Programs. Acta Informatica 24(3): 239-276 (1987) - Thomas P. Murtagh:
Redundant Proofs of Non-Interference in Levin-Gries CSP Program Proofs. Acta Informatica 24(2): 145-156 (1987)
skipping 6 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-05 17:58 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