Остановите войну!
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
- 1989
- Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata:
On the Boundary of a Union of Rays. STACS 1989: 72-83 - Aïda Batarekh, V. S. Subrahmanian:
The Query Topology in Logic Programming. STACS 1989: 375-387 - Paul Beame, Hans L. Bodlaender:
Distributed Computing on TRansitive Networks: The Thorus. STACS 1989: 294-303 - Martin Beaudry, Pierre McKenzie, Denis Thérien:
Testing Membership: Beyond Permutation Groups (Extended Abstract). STACS 1989: 388-399 - Piotr Berman, Georg Schnitger:
On the Complexity of Approximating the Independent Set Problem. STACS 1989: 256-268 - Jean Berstel:
Properties of Infinite Words: Recent Result. STACS 1989: 36-46 - Gerhard Buntrock, Albrecht Hoene:
Reversals and Alternation. STACS 1989: 218-228 - Jin-yi Cai, Lane A. Hemachandra:
On the Power of Parity Polynomial Time. STACS 1989: 229-239 - Maria Morandi Cecchi, F. Nachria, O. Viele:
AXE: The Syntax Driven Diagram Editor for Visual Languages used in the Software Engineering Environments AxIS. STACS 1989: 530-531 - Bernadette Charron-Bost:
Measure of Parallelism of Distributed Computations. STACS 1989: 434-445 - Karel Culík II, Juhani Karhumäki:
On the Equivalence Problem for Deterministic Multitape Automata and Transducers. STACS 1989: 468-479 - Volker Diekert:
Word Problems over TRaces Which are Solvable in Linear Time. STACS 1989: 168-180 - Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. STACS 1989: 96-107 - Jürgen Doenhardt:
Fault Masking Probabilities with Single and Multiple Signature Analysis. STACS 1989: 327-338 - Christiane Frougny:
Linear Numeration Systems, Theta-Developments and Finite Automata. STACS 1989: 144-155 - Donald S. Fussell, Ramakrishna Thurimella:
Successive Approximation in Parallel Graph Algorithms. STACS 1989: 205-217 - K. Ganesan, Steven Homer:
Complete Problems and Strong Polynomial Reducibilities. STACS 1989: 240-250 - Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger:
Polynomial Graph-Colorings. STACS 1989: 108-119 - Friedhelm Meyer auf der Heide:
On Genuinely Time Bounded Compuations. STACS 1989: 1-16 - Friedhelm Meyer auf der Heide:
Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays. STACS 1989: 181-192 - Friedhelm Meyer auf der Heide, Rolf Wanka:
Time-Optimal Simulations of Networks by Universal Parallel Computers. STACS 1989: 120-131 - Rolf Hennicker:
Observational Implementations. STACS 1989: 59-71 - Miki Hermann:
Chain Properties of Rule Closures. STACS 1989: 339-347 - Michael Himsolt:
GraphEd: An Interactive Garpg Editor. STACS 1989: 532-533 - Friedhelm Hinz:
Classes of Picture Languages that Cannot be Distinguished in the Chain Code Concept and Deletion of Redundant Retreats. STACS 1989: 132-143 - Michael Jäger:
SAMPLE: A Language Dependent Prototyping Environment. STACS 1989: 534-535 - Petr Jancar:
Decidability of Waek Fairness in Petri Nets. STACS 1989: 446-457 - Tomasz Janowski:
Examining the Satisfiability of Formulas of Propositional Dynamic Logic. STACS 1989: 536 - Bengt Jonsson, Joachim Parrow:
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. STACS 1989: 421-433 - Bala Kalyanasundaram, Georg Schnitger:
Rounds versus Time for the Two Person Pebble Game (Extended Abstract). STACS 1989: 517-529
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-06-05 09:04 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