Остановите войну!
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 69 matches
- 1993
- Laurent Alonso, René Schott:
On the Tree Inclusion Problem. MFCS 1993: 211-221 - Roberto M. Amadio:
On the Adequacy of Per Models. MFCS 1993: 222-231 - Krzysztof R. Apt, Sandro Etalle:
On the Unification Free Prolog Programs. MFCS 1993: 1-19 - André Arnold, Anne Dicky:
Equivalences and Preorders of Transition Systems. MFCS 1993: 20-31 - Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. MFCS 1993: 232-241 - Egidio Astesiano, Gianna Reggio, Elena Zucca:
Stores as Homomorphisms and their Transformations. MFCS 1993: 242-251 - J. W. de Bakker, Franck van Breugel, Arie de Bruin:
Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands. MFCS 1993: 252-261 - Danièle Beauquier, Andreas Podelski:
Rabin Tree Automata and Finite Monoids. MFCS 1993: 262-271 - Marcin Benke:
Efficient Type Reconstruction in the Presence of Inheritance. MFCS 1993: 272-280 - Jean Berstel, Patrice Séébold:
A Characterization of Sturmian Morphisms. MFCS 1993: 281-290 - Hans L. Bodlaender, Klaus Jansen:
On the Complexity of Scheduling Incompatible Jobs with Unit-Times. MFCS 1993: 291-300 - Marcello M. Bonsangue, Joost N. Kok:
Isomorphisms between Predicates and State Transformers. MFCS 1993: 301-310 - Liming Cai, Jianer Chen:
On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract). MFCS 1993: 311-320 - Ilaria Castellani:
Observing Distribution in Processes. MFCS 1993: 321-331 - Christophe Cérin, Antoine Petit:
Speedup of Recognizable Trace Languages. MFCS 1993: 332-341 - Maura Cerioli, José Meseguer:
May I Borrow Your Logic? MFCS 1993: 342-351 - Shiva Chaudhuri, Torben Hagerup, Rajeev Raman:
Approximate and Exact Deterministic Parallel Selection. MFCS 1993: 352-361 - Liang Chen:
A Model for Real-Time Process Algebras (Extended Abstract). MFCS 1993: 372-381 - Jian Chen, John Staples:
Defining Soft Sortedness by Abstract Interpretation. MFCS 1993: 362-371 - José Félix Costa, Amílcar Sernadas, Cristina Sernadas:
Data Encapsulation and Modularity: Three Views of Inheritance. MFCS 1993: 382-391 - Karel Culík II, Jarkko Kari:
Image Compression Using Weighted Finite Automata. MFCS 1993: 392-402 - Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno:
Filter Models for a Parallel and Non Deterministic Lambda-Calculus. MFCS 1993: 403-412 - Volker Diekert:
Complex and Complex-Like Traces. MFCS 1993: 68-82 - Zinovy Diskin, Ilya Beylin:
Lambda Substitution Algebras. MFCS 1993: 423-432 - Bruno Durand:
Global Properties of 2D Cellular Automata: Some Complexity Results. MFCS 1993: 433-441 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
An Introduction to Dynamic Labled 2-Structures. MFCS 1993: 156-173 - Uffe Engberg, Glynn Winskel:
Completeness Results for Linear Logic on Petri Nets. MFCS 1993: 442-452 - Alessandro Fantechi, Stefania Gnesi, V. Perticaroli:
An Expressive Logic for Basic Process Algebra. MFCS 1993: 453-462 - Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum:
The Complexity of Finding Replicas Using Equality Tests. MFCS 1993: 463-472 - Pietro Di Gianantonio:
Real Number Computability and Domain Theory. MFCS 1993: 413-422
skipping 39 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-03-28 14:42 CET 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