Остановите войну!
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 64 matches
- 1994
- Carme Àlvarez, Birgit Jenner:
On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract). STACS 1994: 301-312 - Edoardo Amaldi, Viggo Kann:
On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems. STACS 1994: 521-532 - Alberto Apostolico, Dany Breslauer, Zvi Galil:
Parallel Detection of all Palindromes in a String. STACS 1994: 497-506 - Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki:
Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data. STACS 1994: 649-660 - André Arnold:
Hypertransition Systems. STACS 1994: 327-338 - Jürgen Avenhaus, Klaus Becker:
Operational Specifications with Built-Ins. STACS 1994: 263-274 - Belaid Benhamou, Lakhdar Sais, Pierre Siegel:
Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. STACS 1994: 71-82 - Nacéra Bensaou, Irène Guessarian:
Transforming Constraint Logic Programs. STACS 1994: 33-46 - Hans L. Bodlaender, Klaus Jansen:
On the Complexity of the Maximum Cut Problem. STACS 1994: 769-780 - Ronald V. Book, Jack H. Lutz, David M. Martin Jr.:
The Global Power of Additional Queries to Random Oracles. STACS 1994: 403-414 - Bernd Borchert:
On the Acceptance Power of Regular Languages. STACS 1994: 533-541 - Burchard von Braunmühl, Romain Gengler, Robert Rettinger:
The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite. STACS 1994: 85-96 - Véronique Bruyère, Clelia de Felice, Giovanna Guaiana:
Coding with Traces. STACS 1994: 353-364 - Gerhard Buntrock, Krzysztof Lorys:
The Variable Membership Problem: Succinctness Versus Complexity. STACS 1994: 595-606 - Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows:
On the Structure of Parameterized Problems in NP (Extended Abstract). STACS 1994: 509-520 - Bogdan S. Chlebus, Leszek Gasieniec:
Optimal Pattern Matching on Meshes. STACS 1994: 213-224 - Hubert Comon, Florent Jacquemard:
Ground Reducibility and Automata with Disequality Constraints. STACS 1994: 151-162 - Vlado Dancík, Mike Paterson:
Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences. STACS 1994: 669-678 - Amitava Datta:
Efficient Parallel Algorithms for Geometric k-Clustering Problems. STACS 1994: 475-486 - Maylis Delest, Jean-Philippe Dubernard:
q-Grammars: Results, Implementation. STACS 1994: 377-388 - Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller:
On Vertex Ranking for Permutations and Other Graphs. STACS 1994: 747-758 - Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz:
One Binary Horn Clause is Enough. STACS 1994: 21-32 - Feodor F. Dragan, Andreas Brandstädt:
Dominating Cliques in Graphs with Hypertree Structures. STACS 1994: 735-746 - Kousha Etessami, Neil Immerman:
Reachability and the Power of Local Ordering. STACS 1994: 123-135 - Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas:
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems. STACS 1994: 365-375 - Jean Goubault:
The Complexity of Resource-Bounded First-Order Classical Logic. STACS 1994: 59-70 - E. Pascal Gribomont, Jacques Hagelstein:
Reactive Variables for System Specification and Design. STACS 1994: 275-286 - David Harel:
Towards a Theory of Recursive Structures. STACS 1994: 633-645 - Ulrich Hertrampf:
Complexity Classes with Finite Acceptance Types. STACS 1994: 543-553 - Martin Hofmann, Benjamin C. Pierce:
A Unifying Type-Theoretic Framework for Objects. STACS 1994: 251-262
skipping 34 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-07 05:06 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