![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 54 matches
- 1988
- Farid M. Ablayev:
Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability. MFCS 1988: 154-161 - E. Allevi, Alessandra Cherubini, Stefano Crespi-Reghizzi:
Breadth-First Phrase Structure Grammars and Queue Automata. MFCS 1988: 162-170 - Frank Bauernöppel
, Hermann Jung:
Implementing Abstract Data Structures in Hardware. MFCS 1988: 171-179 - Joffroy Beauquier, Antoine Petit:
Distribution of Sequential Processes. MFCS 1988: 180-189 - Corrado Böhm:
Functional Programming and Combinatory Algebras. MFCS 1988: 14-26 - Ronald V. Book:
Sparse Sets, Tally Sets, and Polynomial Reducibilities. MFCS 1988: 1-13 - Francis Bossut, Max Dauchet, Bruno Warin:
Automata and Rational Expressions on Planar Graphs. MFCS 1988: 190-200 - Véronique Bruyère:
On Maximal Prefix Sets of Words. MFCS 1988: 201-209 - Heino Carstensen:
Infinite Behaviour if Deterministic Petri Nets. MFCS 1988: 210-219 - Philippe le Chenadec:
On Positive Occur-Checks in Unification. MFCS 1988: 433-444 - Ludmila Cherkasova:
On Models and Algebras for Concurrent Processes. MFCS 1988: 27-43 - Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik:
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. MFCS 1988: 231-239 - Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik:
Testing Isomorphism of Outerplanar Graphs in Parallel. MFCS 1988: 220-230 - Maxime Crochemore:
String Matching with Constraints. MFCS 1988: 44-58 - Alessandro D'Atri, Marina Moscarini, Antonio Sassano:
The Steiner Tree Problem and Homogeneous Sets. MFCS 1988: 249-261 - Ryszard Danecki:
Multiple Propositional Dynamic Logic of Parallel Programs (Extended Abstract). MFCS 1988: 240-248 - Max Dauchet:
Termination of Rewriting is Undecidable in the One-Rule Case. MFCS 1988: 262-270 - Volker Diekert, Walter Vogler:
Local Checking of Trace Synchroniziability. MFCS 1988: 271-279 - Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto:
Edge Separators for Planar Graphs and Their Applications. MFCS 1988: 280-290 - Michael A. Frumkin:
A Fast Parallel Algorithm for Eigenvalue Problem of Jacobi Matrices. MFCS 1988: 291-299 - Ricard Gavaldà
, José L. Balcázar:
Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets. MFCS 1988: 300-308 - Viliam Geffert:
Context-Free-Like Forms for the Phrase-Structure Grammars. MFCS 1988: 309-317 - Andreas Goerdt:
On the Expressive Strength of the Finitely Typed Lambda-Terms. MFCS 1988: 318-328 - Andreas Goerdt:
Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook. MFCS 1988: 329-338 - Ursula Goltz:
On Representing CCS Programs by Finite Petri Nets. MFCS 1988: 339-350 - Lane A. Hemachandra
:
Structure of Complexity Classes: Separations, Collapses, and Completeness. MFCS 1988: 59-72 - Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. MFCS 1988: 351-359 - Juraj Hromkovic, Juraj Procházka:
Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays. MFCS 1988: 360-370 - Stasys Jukna
:
Two Lower Bounds for Circuits over the Basis (&, V, -). MFCS 1988: 371-380 - Stéphane Kaplan:
Positive/Negative Conditional Rewriting. MFCS 1988: 381-395
skipping 24 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-07-01 09:20 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