![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 24 matches
- 2002
- Marta Arias
, Roni Khardon:
Learning Closed Horn Expressions. Inf. Comput. 178(1): 214-240 (2002) - Franz Baader
, Cesare Tinelli
:
Deciding the Word Problem in the Union of Equational Theories. Inf. Comput. 178(2): 346-390 (2002) - Eike Best, Raymond R. Devillers, Maciej Koutny:
The Box Algebra = Petri Nets + Process Expressions. Inf. Comput. 178(1): 44-100 (2002) - Beate Bollig, Martin Sauerhoff, Ingo Wegener:
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. Inf. Comput. 178(1): 263-278 (2002) - Bruno Courcelle:
A Monadic Second-Order Definition of the Structure of Convex Hypergraphs. Inf. Comput. 178(2): 391-411 (2002) - Arnaud Durand:
Linear Time and the Power of One First-Order Universal Quantifier. Inf. Comput. 178(1): 12-22 (2002) - Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178(1): 101-131 (2002) - Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178(1): 132-148 (2002) - Mikael Goldmann, Alexander Russell:
The Complexity of Solving Equations over Finite Groups. Inf. Comput. 178(1): 253-262 (2002) - Philippe de Groote:
On the Strong Normalisation of Intuitionistic Natural Deduction with Permutation-Conversions. Inf. Comput. 178(2): 441-464 (2002) - Dieter Hofbauer, Maria Huber:
Test Sets for the Universal and Existential Closure of Regular Tree Languages. Inf. Comput. 178(2): 465-498 (2002) - Furio Honsell, Donald Sannella:
Prelogical Relations. Inf. Comput. 178(1): 23-43 (2002) - Toshihiko Kurata:
Intersection and Singleton Type Assignment Characterizing Finite Böhm-Trees. Inf. Comput. 178(1): 1-11 (2002) - Salvador Lucas
:
Context-Sensitive Rewriting Strategies. Inf. Comput. 178(1): 294-343 (2002) - Jerzy Marcinkowski:
The [exist]*[forall]* Part of the Theory of Ground Term Algebra Modulo an AC Symbol is Undecidable. Inf. Comput. 178(2): 412-421 (2002) - Takashi Nagaya, Yoshihito Toyama:
Decidability for Left-Linear Growing Term Rewriting Systems. Inf. Comput. 178(2): 499-514 (2002) - Paliath Narendran, Michaël Rusinowitch:
Guest Editorial. Inf. Comput. 178(2): 345 (2002) - Peter Møller Neergaard, Morten Heine Sørensen:
Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions. Inf. Comput. 178(1): 149-179 (2002) - Robert Nieuwenhuis
, José Miguel Rivero:
Practical Algorithms for Deciding Path Ordering Constraint Satisfaction. Inf. Comput. 178(2): 422-440 (2002) - Amir Pnueli, Yoav Rodeh, Ofer Strichman
, Michael Siegel:
The Small Model Property: How Small Can It Be? Inf. Comput. 178(1): 279-293 (2002) - Albert Rubio:
A Fully Syntactic AC-RPO. Inf. Comput. 178(2): 515-533 (2002) - Hélène Touzet:
A Characterisation of Multiply Recursive Functions with Higman's Lemma. Inf. Comput. 178(2): 534-544 (2002) - Irek Ulidowski
, Iain C. C. Phillips
:
Ordered SOS Process Languages for Branching and Eager Bisimulations. Inf. Comput. 178(1): 180-213 (2002) - Michael V. Vyugin, Vladimir V. V'yugin:
On Complexity of Easy Predictable Sequences. Inf. Comput. 178(1): 241-252 (2002)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-14 18:08 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