Остановите войну!
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 233 matches
- 1996
- Samson Abramsky:
Semantics of Interaction (Abstract). CAAP 1996: 1 - Thomas Arts:
Termination by Absence of Infinite Chains of Dependency Pairs. CAAP 1996: 196-210 - Leo Bachmair, Ta Chen, C. R. Ramakrishnan, I. V. Ramakrishnan:
Subsumption Algorithms Based on Search Trees. CAAP 1996: 135-148 - Michel Bidoit, Andrzej Tarlecki:
Behavioural Satisfaction and Equivalence in Concrete Model Categories. CAAP 1996: 241-256 - Anne Bottreau, Yves Métivier:
The Kronecker Product and Local Computations in Graphs. CAAP 1996: 2-16 - Alexandre Boudet, Hubert Comon:
Diophantine Equations, Presburger Arithmetic and Finite Automata. CAAP 1996: 30-43 - Gérard Boudol, Carolina Lavatelli:
Full Abstraction for Lambda Calculus with Resources and Convergence Testing. CAAP 1996: 302-316 - Allan Cheng, Mogens Nielsen:
Open Maps, Behavioural Equivalences, and Congruences. CAAP 1996: 257-271 - E. A. Cichon, Hélène Touzet:
An Ordinal Calculus for Proving Termination in Term Rewriting. CAAP 1996: 226-240 - Maribel Fernández, Ian Mackie:
Interaction Nets and Term Rewriting Systems (Extended Abstract). CAAP 1996: 149-164 - John R. W. Glauert, Zurab Khasidashvili:
Relative Normalization in Deterministic Residual Structures. CAAP 1996: 180-195 - Bernhard Gramlich:
Confluence without Termination via Parallel Critical Pairs. CAAP 1996: 211-225 - Roope Kaivola:
Axiomatising Extended Computation Tree Logic. CAAP 1996: 87-101 - Armin Kühnemann:
A Pumping Lemma for Output Languages of Macro Tree Transducers. CAAP 1996: 44-58 - Marina Lenisa:
Final Semantics for a Higher Order Concurrent Language. CAAP 1996: 102-118 - Björn Lisper:
Computing in Unpredictable Environments: Semantics, Reduction Strategies, and Program Transformations. CAAP 1996: 165-179 - Marina Madonia, Stefano Varricchio:
Iterative Pairs and Multitape Automata. CAAP 1996: 17-29 - Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
The Area Determined by Underdiagonal Lattice Paths. CAAP 1996: 59-71 - Frank Pfenning:
The Practice of Logical Frameworks. CAAP 1996: 119-134 - Arend Rensink:
Denotational, Causal, and Operational Determinism in Event Structures. CAAP 1996: 272-286 - Morten Heine Sørensen:
Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi. CAAP 1996: 287-301 - Yukihide Takayama:
Extraction of Concurrent Processes from Higher Dimensional Automata. CAAP 1996: 72-86 - Jerzy Tiuryn, Mitchell Wand:
Untyped Lambda-Calculus with Input-Output. CAAP 1996: 317-329 - Hélène Kirchner:
Trees in Algebra and Programming - CAAP'96, 21st International Colloquium, Linköping, Sweden, April, 22-24, 1996, Proceedings. Lecture Notes in Computer Science 1059, Springer 1996, ISBN 3-540-61064-2 [contents] - 1994
- Fabio Alessi:
Type Preorders. CAAP 1994: 37-51 - Paola Bruscoli, Francesca Levi, Giorgio Levi, Maria Chiara Meo:
Compilative Constructive Negation in Constraint Logic Programs. CAAP 1994: 52-67 - Hubert Comon, Ralf Treinen:
Ordering Constraints on Trees. CAAP 1994: 1-14 - Alain Cournier, Michel Habib:
A New Linear Algorithm for Modular Decomposition. CAAP 1994: 68-84 - Frank Drewes:
A Lower Bound on the Growth of Functions Computed by Tree Transductions. CAAP 1994: 100-114 - Joost Engelfriet:
Graph Grammars and Tree Transducers. CAAP 1994: 15-36
skipping 203 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-08-31 23:49 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