Остановите войну!
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 51 matches
- 1981
- Jirí Adámek:
Observability and Nerode Equivalence in Concrete C5ategories. FCT 1981: 1-15 - Hajnal Andréka, István Németi:
Some Universal Algebraic and Model Theoretic Results in Computer Science. FCT 1981: 16-23 - Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi:
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. FCT 1981: 24-33 - László Babai:
Moderately Exponential Bound for Graph Isomorphism. FCT 1981: 34-50 - Miklós Bartha:
An Algebraic Defenition of Attributed Transformations. FCT 1981: 51-60 - Joffroy Beauquier:
A New Operation Between Languages. FCT 1981: 400-409 - Egon Börger:
Logical Description of Computation Processes. FCT 1981: 410-424 - Franz-Josef Brandenburg:
Analogies of PAL and COPY. FCT 1981: 61-70 - Hans Kleine Büning:
Classes of Functions over Binary Trees. FCT 1981: 199-204 - Peter Burmeister:
Quasi-Equational Logic for Partial Algebras. FCT 1981: 71-80 - B. Csákány:
Homogenity and Completeness. FCT 1981: 81-89 - Robert P. Daley:
On the Error Correcting Power of Pluralism in Inductive Inference. FCT 1981: 90-99 - Jürgen Dassow:
Equality Languages and Language Families. FCT 1981: 100-109 - János Demetrovics, Gyula O. H. Katona:
Extremal Combinatorial Problems in Relational Data Base. FCT 1981: 110-119 - Hans-Dieter Ehrich:
Specifying Algebraic Data Types by Domain Equations. FCT 1981: 120-129 - Zoltán Ésik:
An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration. FCT 1981: 130-136 - Pavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl:
Fast Recognition of Rings and Lattices. FCT 1981: 137-145 - Jan Grabowski:
An Algorithm to Identify Slices, with Applications to Vector Replacement Systems. FCT 1981: 425-432 - Friedhelm Meyer auf der Heide, Hans-Anton Rollik:
Random Access Machines and Straight-Line Programs. FCT 1981: 259-264 - Frank Hoffmann:
One Pebble Does Not Suffice to Search Plane Labyrinths. FCT 1981: 433-444 - Hagen Huwig:
A Definition of the P=NP-Problem in Categories. FCT 1981: 146-153 - Dirk Janssens, Grzegorz Rozenberg:
Generating Graph Languages Using Hypergraph Grammars. FCT 1981: 154-164 - Jerzy W. Jaromczyk:
Lower Bounds for Problems Defined by Polynomial Inequalities. FCT 1981: 165-172 - Heinz Kaphengst:
What is Computable for Abstract Data Types? FCT 1981: 173-181 - Juhani Karhumäki:
On Strongly Cube-Free Omega-Words Generated by Binary Morphisms. FCT 1981: 182-189 - H. C. M. Kleijn, Grzegorz Rozenberg:
On the Role of Selectors in Selective Substitution Grammars. FCT 1981: 190-198 - Bernhard Korte, László Lovász:
Mathematical Structures Underlying Greedy Algorithms. FCT 1981: 205-209 - Juha Kortelainen:
Some Properties of Language Families Generated by Commutative Languages. FCT 1981: 210-217 - Ludek Kucera, Vera Trnková:
Isomorphism Completeness for Some Algebraic Structures. FCT 1981: 218-225 - Bernard Leguy:
Reducing Algebraic Tree Grammars. FCT 1981: 226-233
skipping 21 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-09 22:15 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