Остановите войну!
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 48 matches
- 1989
- M. A. Nait Abdallah:
An Extended Framework for Default Reasoning. FCT 1989: 339-348 - M. A. Nait Abdallah:
Logic Programming of Some Mathematical Paradoxes. FCT 1989: 349-361 - Habib Abdulrab, Jean-Pierre Pécuchet:
On Word Equations and Makanin's Algorithm. FCT 1989: 1-12 - Carme Àlvarez, Josep Díaz, Jacobo Torán:
Complexity Classes with Complete Problems Between P and NP-C. FCT 1989: 13-24 - Miklós Bartha:
Interpretations of Synchronous Flowchart Schemes. FCT 1989: 25-34 - Alberto Bertoni, Danilo Bruschi, Deborah Joseph, Meera Sitharam, Paul Young:
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract). FCT 1989: 35-46 - Stephen L. Bloom:
The Equational Logic of Iterative Processes. FCT 1989: 47-57 - Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth:
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. FCT 1989: 58-67 - Andreas Brandstädt:
The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions. FCT 1989: 68-77 - Janusz A. Brzozowski, Jo C. Ebergen:
Recent Developments in the Design of Asynchronous Circuits. FCT 1989: 78-94 - Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik:
New Simulations between CRCW PRAMs. FCT 1989: 95-104 - Jean-Luc Coquidé, Max Dauchet, Sophie Tison:
About Connections Between Syntactical and Computational Complexity. FCT 1989: 105-115 - Pierluigi Crescenzi, Alessandro Panconesi:
Completeness in Approximation Classes. FCT 1989: 116-126 - Carsten Damm, Christoph Meinel:
Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees. FCT 1989: 127-136 - Pál Dömösi, Zoltán Ésik, Balázs Imreh:
On Product Hierarchies of Automata. FCT 1989: 137-144 - Pavol Duris, Pavel Pudlák:
On the Communication Complexity of Planarity. FCT 1989: 145-147 - Joost Engelfriet:
Context-Free NCE Graph Grammars. FCT 1989: 148-161 - Jean Françon, B. Randrianarimanana, René Schott:
Dynamic Data Structures with Finite Population: A Combinatorial Analysis. FCT 1989: 162-174 - Zoltán Fülöp, Sándor Vágvölgyi:
Iterated Deterministic Top-Down Look-Ahead. FCT 1989: 175-184 - Dominique Geniet, Loÿs Thimonier:
Using Generating Functions to Compute Concurrency. FCT 1989: 185-196 - Ana Gil-Luezas:
A Logic for Nondeterministic Functional Programs (Extended Abstract). FCT 1989: 197-208 - Erich Grädel:
Complexity of Formula Classes in First Order Logic with Functions. FCT 1989: 224-233 - Bernd Graw:
Decision Problems and Coxeter Groups. FCT 1989: 209-223 - Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
Normal and Sinkless Petri Nets. FCT 1989: 234-243 - Neil Immerman:
Descriptive and Computational Complexity. FCT 1989: 244-245 - Efim B. Kinber, Thomas Zeugmann:
Monte-Carlo Inference and Its Relations to Reliable Frequency Identification. FCT 1989: 257-266 - Ivan Korec:
Semilinear Real-Time Systolic Trellis Automata. FCT 1989: 267-276 - Tibor Kovács:
Inducibility of the Composition of Frontier-to-Root Tree Transformations. FCT 1989: 277-286 - Matthias Krause, Stephan Waack:
On Oblivious Branching Programs of Linear Length (Extended Abstract). FCT 1989: 287-296 - Maciej Liskiewicz, Krzysztof Lorys:
Some Time-Space Bounds for One-Tape Deterministic Turing Machines. FCT 1989: 297-307
skipping 18 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-04-23 22:12 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