Остановите войну!
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 58 matches
- 1981
- Helmut Alt, Kurt Mehlhorn, J. Ian Munro:
Partial Match Retrieval in Implicit Data Structures. MFCS 1981: 156-161 - Hajnal Andréka, István Németi, Ildikó Sain:
A Characterization of Floyd-Provable Programs. MFCS 1981: 162-171 - Egidio Astesiano, Elena Zucca:
Semantics of CSP via Translation into CCS. MFCS 1981: 172-182 - Joffroy Beauquier, Jean Berstel:
More about the "Geography" of Context-Free Languages. MFCS 1981: 183-192 - Jon Louis Bentley, Thomas Ottmann:
The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. MFCS 1981: 1-15 - Jan A. Bergstra, Manfred Broy, John V. Tucker, Martin Wirsing:
On the Power of Algebraic Specifications. MFCS 1981: 193-204 - Alberto Bertoni, Marco Brambilla, Giancarlo Mauri, Nicoletta Sabadini:
An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages. MFCS 1981: 205-215 - Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó'Dúnlaing, Celia Wrathall:
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). MFCS 1981: 216-223 - Franz-Josef Brandenburg:
On the Tranformation of Derivation Graphs to Derivation Trees (Preliminary Report). MFCS 1981: 224-233 - Andreas Brandstädt:
Pushdown Automata with Restricted Use of Storage Symbols. MFCS 1981: 234-241 - Lothar Budach:
Two Pebbles Don't Suffice. MFCS 1981: 578-589 - Ludmila Cherkasova, Vadim E. Kotov:
Structured Nets. MFCS 1981: 242-251 - Robert P. Daley:
Retraceability, Repleteness and Busy Beaver Sets. MFCS 1981: 252-261 - Werner Damm, Irène Guessarian:
Combining T and level-N. MFCS 1981: 262-270 - Hans-Dieter Ehrich:
On Realization and Implementation. MFCS 1981: 271-280 - Andrei P. Ershov:
The Transformational Machine: Theme and Variations. MFCS 1981: 16-32 - Rusins Freivalds:
Probabilistic Two-Way Machines. MFCS 1981: 33-45 - Dima Grigoriev:
Multiplicative Complexity of a Bilinear Form over a Commutative Ring. MFCS 1981: 281-286 - Petr Hájek:
Making Dynamic Logic First-Order. MFCS 1981: 287-295 - Friedhelm Meyer auf der Heide:
Time-Processor Trade-offs for Universal Parallel Computers. MFCS 1981: 433-441 - J. Horejs:
Partial Interpretations of Program Schemata. MFCS 1981: 296-303 - Juraj Hromkovic:
Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata. MFCS 1981: 304-313 - Ladislav Janiga:
Another Hierarchy Defined by Multihead Finite Automata. MFCS 1981: 314-320 - Jerzy W. Jaromczyk:
An Extension of Rabin's Complete Proof Concept. MFCS 1981: 321-326 - Kurt Jensen:
How to Find Invariants for Coloured Petri Nets. MFCS 1981: 327-338 - Deborah Joseph, Paul Young:
A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic. MFCS 1981: 46-60 - H. Jung:
Relationships between Probabilistic and Deterministic Tape Complexity. MFCS 1981: 339-346 - Akira Kanda:
Constructive Category Theory (No. 1). MFCS 1981: 563-577 - Alica Kelemenová:
Grammatical Levels of the Position Restricted Grammars. MFCS 1981: 347-359 - H. C. M. Kleijn, Grzegorz Rozenberg:
A General Framework for Comparing Sequential and Parallel Rewriting. MFCS 1981: 360-368
skipping 28 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-19 00: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