Остановите войну!
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 63 matches
- 1986
- M. A. Nait Abdallah:
AL-Khowarizmi: A Formal System for Higher-Order Logic Programming. MFCS 1986: 545-553 - Farid M. Ablayev, Rusins Freivalds:
Why Sometimes Probabilistic Algorithms Can Be More Effective. MFCS 1986: 1-14 - Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS 1986: 199-208 - Egidio Astesiano, Gianna Reggio, Martin Wirsing:
Relational Specifications and Observational Semantics. MFCS 1986: 209-217 - Bernd Becker:
Efficient Testing of Optimal Time Adders (Extended Abstract). MFCS 1986: 218-229 - Jean Berstel, Jacques Sakarovitch:
Recent Results in the Theory of Rational Sets. MFCS 1986: 15-28 - Peter van Emde Boas:
A Semantical Model for Integration and Modularization of Rules. MFCS 1986: 78-92 - Manfred Broy:
Partial Interpretations of Higher Order Algebraic Types (Extended Abstract). MFCS 1986: 29-43 - Siegfried Bublitz, Ute Schürfeld, Bernd Voigt, Ingo Wegener:
Properties of Complexity Measures for PRAMs and WRAMs. MFCS 1986: 230-238 - Virgil Emil Cazanescu:
Iterative Systems of Equations. MFCS 1986: 239-246 - Alexander L. Chistov:
Polynomial Complexity of the Newton-Puiseux Algorithm. MFCS 1986: 247-255 - Marek Chrobak, Wojciech Rytter:
Unique Deciperability for Partially Commutative Alphabet (Extended Abstract). MFCS 1986: 256-263 - Michal Chytil:
Kins of Context-Free Languages. MFCS 1986: 44-58 - Karel Culík II, Juhani Karhumäki:
The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable. MFCS 1986: 264-272 - Krzysztof Diks:
A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (Extended Abstract). MFCS 1986: 273-282 - Branislav Durian:
Quicksort Without a Stack. MFCS 1986: 283-289 - S. Dvorák, Branislav Durian:
Towards an Efficient Merging. MFCS 1986: 290-298 - Hartmut Ehrig, Werner Fey, Francesco Parisi-Presicce, Edward K. Blum:
Algebraic Theory of Module Specification with Constraints. MFCS 1986: 59-77 - Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh:
Homomorphic Realizations of Automata with Compositions. MFCS 1986: 299-307 - Thomas M. Fischer:
Refined Bounds on the Complexity of Sorting and Selection in D-Dimensional Space. MFCS 1986: 308-314 - Thomas M. Fischer, K. Wolfrum:
On the Inherent Combinatorial Complexity of Geometric Problems in D-Dimensional Space. MFCS 1986: 315-324 - Philippe Flajolet:
The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle. MFCS 1986: 325-340 - Hans Fleischhack:
P-Genericity and Strong G-Genericity. MFCS 1986: 341-349 - Christiane Frougny:
Fibonacci Numeration Systems and Rational Functions. MFCS 1986: 350-359 - B. Gammatie:
Safe Implementation Equivalence for Asynchronous Nondeterministic Processes. MFCS 1986: 360-369 - Joachim von zur Gathen:
Parallel Arithmetic Computations: A Survey. MFCS 1986: 93-112 - Viliam Geffert:
Grammars with Context Dependency Restricted to Synchronization. MFCS 1986: 370-378 - Oded Goldreich, Silvio Micali, Avi Wigderson:
Proofs that Release Minimum Knowledge. MFCS 1986: 639-650 - A. Goralciková, Václav Koubek:
Some Improved Parallelisms for Graphs. MFCS 1986: 379-385 - Susanne Graf:
A Complete Inference System for an Algebra or Regular Acceptance Models. MFCS 1986: 386-395
skipping 33 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-06-06 05:48 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