Остановите войну!
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 52 matches
- 1991
- Luc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann:
Average Case Analysis of Unification Algorithms. STACS 1991: 196-213 - Carme Àlvarez, José L. Balcázar, Birgit Jenner:
Functional Oracle Queries as a Measure of Parallel Time. STACS 1991: 422-433 - Philippe Balbiani:
A Modal Semantics for the Negation as Failure and the Closed World Assumption Rules. STACS 1991: 523-534 - Françoise Baude, Guy Vidal-Naquet:
Actors as a Parallel Programming Model. STACS 1991: 184-195 - Birgit Baum-Waidner, Birgit Pfitzmann, Michael Waidner:
Unconditional Byzantine Agreement with Good Majority. STACS 1991: 285-295 - Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet:
Detection of Deadlocks in an Infinite Family of Nets. STACS 1991: 334-347 - Rudolf Berghammer, Gunther Schmidt:
The RELVIEW-System. STACS 1991: 535-536 - Eike Best, Ludmila Cherkasova, Jörg Desel:
Compositional Generation of Home States in Free Choice Systems. STACS 1991: 398-409 - E. V. Biryalcev, A. M. Gusenkov, Ildar R. Nasyrov, A. A. Saveliev:
Geometry Models Design System GammaPOM. STACS 1991: 537-538 - Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger:
Computationally Convincing Proofs of Knowledge. STACS 1991: 251-262 - Harry Buhrman, Edith Spaan, Leen Torenvliet:
Bounded Reductions. STACS 1991: 410-421 - Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel:
Structure and Importance of Logspace-MOD-Classes. STACS 1991: 360-371 - Jonathan F. Buss, Judy Goldsmith:
Nondterminism Within P. STACS 1991: 348-359 - Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson:
A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance. STACS 1991: 296-308 - Anne Condon:
The Complexity of the Max Word Problem. STACS 1991: 456-465 - François Denis, Jean-Paul Delahaye:
Unfolding, Procedural and Fixpoint Semantics of Logic Programs. STACS 1991: 511-522 - Jörg Desel, Javier Esparza:
Reachability in Reversible Free Choice Systems. STACS 1991: 384-397 - Volker Diekert:
On the Concatenation of Infinite Traces. STACS 1991: 105-117 - Lance Fortnow, Carsten Lund:
Interactive Proof Systems and Alternating Time-Space Complexity. STACS 1991: 263-274 - Christiane Frougny, Jacques Sakarovitch:
Rational Ralations with Bounded Delay. STACS 1991: 50-63 - Paul Gastin:
Recognizable and Rational Languages of Finite and Infinite Traces. STACS 1991: 89-104 - Rémi Gilleron:
Decision Problems for Term Rewriting Systems and Recognizable Tree Languages. STACS 1991: 148-159 - Michael Godau:
A Natural Metric for Curves - Computing the Distance for Polygonal Chains and Approximation Algorithms. STACS 1991: 127-136 - Erich Grädel:
The Expressive Power of Second Order Horn Logic. STACS 1991: 466-477 - Giovanna Guaiana, Antonio Restivo, Sergio Salemi:
On Aperiodic Trace Languages. STACS 1991: 76-88 - Joachim Hartmann:
The Random Testability of the n-Input AND Gate. STACS 1991: 488-498 - Berthold Hoffmann, Bernd Krieg-Brückner:
The PROSPECTRA System. STACS 1991: 539-540 - Thierry Jéron:
Testing for Unboundedness of FIFO Channels. STACS 1991: 322-333 - Thierry Jéron:
Prototype of a Verification Tool. STACS 1991: 541-542 - Jean-Pierre Jouannaud:
Executable Higher-Order Algebraic Specifications. STACS 1991: 16-25
skipping 22 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-05-31 20:18 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