Остановите войну!
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 44 matches
- 1991
- M. A. Nait Abdallah:
Syntax and Semantics of a Monotonic Framework for Non-Monotonic Reasoning. MFCS 1991: 357-366 - Fabio Alessi, Franco Barbanera:
Strong Conjunction and Intersection Types. MFCS 1991: 64-73 - Egidio Astesiano, Maura Cerioli:
Partial Higher-Order Specifications. MFCS 1991: 74-83 - Staffan Bonnier:
Unification in Incompletely Specified Theories: A Case Study. MFCS 1991: 84-92 - Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn:
Observing Localities (Extended Abstract). MFCS 1991: 93-102 - Anton Cerný:
Generating Words by Cellular Automata. MFCS 1991: 113-120 - Gerardo Costa, Gianna Reggio:
Abstract Dynamic Data Types: A Temporal Logic Approach. MFCS 1991: 103-112 - Pierpaolo Degano, Roberto Gorrieri:
Atomic Refinement in Process Description Languages. MFCS 1991: 121-130 - Volker Diekert, Paul Gastin, Antoine Petit:
Recognizable Complex Trace Languages. MFCS 1991: 131-140 - Eric Domenjoud:
Solving Systems of Linear Diophantine Equations: An Algebraic Approach. MFCS 1991: 141-150 - Gilles Dowek:
A Second-Order Pattern Matching Algorithm for the Cube of Typed Lambda-Calculi. MFCS 1991: 151-160 - Lavinia Egidi, Furio Honsell, Simona Ronchi Della Rocca:
The lazy call-by-value Lamda-Calculus. MFCS 1991: 161-169 - Roberto Gorrieri, Cosimo Laneve:
The Limit of Split_n-Bisimulations for CCS Agents. MFCS 1991: 170-180 - Georges Hansel, Daniel Krob, Christian Michaux:
Stochastic Automata and Length Distributions of Rational Languages. MFCS 1991: 181-190 - Barney P. Hilken, David E. Rydeheard:
Towards a Categorical Semantics Type Classes. MFCS 1991: 191-201 - Rodney R. Howell, Petr Jancar, Louis E. Rosier:
Single-Path Petri Nets. MFCS 1991: 202-210 - Juraj Hromkovic, Burkhard Monien:
The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). MFCS 1991: 211-220 - Oscar H. Ibarra, Tao Jiang, Hui Wang:
Some Results Concerning 2-D On-line Tessellation Acceptors and 2-D Alternating Finite Automata. MFCS 1991: 221-230 - Paola Inverardi, Monica Nesi:
Infinite Normal Forms for Non-Linear Term Rewriting Systems. MFCS 1991: 231-239 - Petteri Jokinen, Esko Ukkonen:
Two Algorithms for Approximate String Matching in Static Texts. MFCS 1991: 240-248 - Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek:
Efficient Constructions of Test Sets for Regular and Context-Free Languages. MFCS 1991: 249-258 - Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis:
The Complexity of The Reliable Connectivity Problem. MFCS 1991: 259-266 - Delia Kesner:
Pattern Matching in Order-Sorted Languages. MFCS 1991: 267-276 - Beata Konikowska:
Two Over Three: A Two-Valued Logic for Software Specification and Validation Over a Three-Valued Predicate Calculus. MFCS 1991: 277-286 - Emmanuel Kounalis, Denis Lugiez, Loic Pottier:
A Solution of the Complement Problem in Associative-Commutative Theories. MFCS 1991: 287-297 - Padmanabhan Krishnan:
A Model for Real-Time Systems. MFCS 1991: 298-307 - Nguyen Huong Lam, Do Long Van:
On Strict Codes. MFCS 1991: 308-317 - Jean-Louis Lassez, Michael J. Maher, Kim Marriott:
Elimination of Negation in Term Algebras. MFCS 1991: 1-16 - Hans Leiß, Fritz Henglein:
A Decidable Case of the Semi-Unification Problem. MFCS 1991: 318-327 - Claudia Leopold:
Maintaining Dictionaries in a Hierarchical Memory. MFCS 1991: 328-336
skipping 14 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-07-01 17:39 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