Остановите войну!
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 50 matches
- 1997
- Luca de Alfaro:
Temporal Logics for the Specification of Performance and Reliability. STACS 1997: 165-176 - Luca de Alfaro, Arjun Kapur, Zohar Manna:
Hybrid Diagrams: A Deductive-Algorithmic Approach to Hybrid System Verification. STACS 1997: 153-164 - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Efficient Construction of Hitting Sets for Systems of Linear Functions. STACS 1997: 387-398 - Vincenzo Auletta, Domenico Parente:
Better Algorithms for Minimum Weight Vertex-Connectivity Problems. STACS 1997: 547-558 - Claudia Bertram-Kretzberg, Hanno Lefmann:
MODp-tests, Almost Independence and Small Probability Spaces (Extended Abstract). STACS 1997: 141-152 - Ingrid Biehl, Bernd Meyer:
Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended Abstract). STACS 1997: 399-412 - Josef M. Breutzmann, Jack H. Lutz:
Equivalence of Measures of Complexity Classes. STACS 1997: 535-545 - Gerth Stølting Brodal:
Predecessor Queries in Dynamic Integer Sets. STACS 1997: 21-32 - Harry Buhrman, Lance Fortnow:
Resource-Bounded Kolmogorov Complexity Revisited. STACS 1997: 105-116 - Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit:
The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). STACS 1997: 451-462 - John Case, Efim B. Kinber, Arun Sharma, Frank Stephan:
On the Classification of Computable Languages. STACS 1997: 225-236 - Gianpiero Cattaneo, Enrico Formenti, Giovanni Manzini, Luciano Margara:
On Ergodic Linear Cellular Automata over Zm. STACS 1997: 427-438 - Elias Dahlhaus:
Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs. STACS 1997: 487-498 - Volker Diekert, Paul Gastin, Antoine Petit:
Removing epsilon-Transitions in Timed Automata. STACS 1997: 583-594 - Martin Dietzfelbinger:
Gossiping and Broadcasting versus Computing Functions in Networks. STACS 1997: 189-200 - Jérôme Olivier Durand-Lose:
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton. STACS 1997: 439-450 - Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger:
Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. STACS 1997: 117-128 - Joan Feigenbaum, Martin Strauss:
An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract). STACS 1997: 523-534 - Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke:
A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). STACS 1997: 511-522 - Christophe Fiorio, Jens Gustedt:
Memory Management for Union-Find Algorithms. STACS 1997: 67-79 - Michele Flammini:
Deadlock-Free Interval Routing Schemes. STACS 1997: 351-362 - Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio:
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. STACS 1997: 33-46 - Stephane Gaubert, Max Plus:
Methods and Applications of (MAX, +) Linear Algebra. STACS 1997: 261-282 - Oded Goldreich:
Probabilistic Proof Systems - A Survey. STACS 1997: 595-611 - Jonathan Goldstine, Hing Leung, Detlef Wotschke:
Measuring Nondeterminism in Pushdown Automata. STACS 1997: 295-306 - Erich Grädel, Martin Otto, Eric Rosen:
Undecidability Results on Two-Variable Logics. STACS 1997: 249-260 - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
A Downward Translation in the Polynomial Hierarchy. STACS 1997: 319-328 - Harald Hempel, Gerd Wechsung:
The Operators min and max on the Polynomial Hierarchy. STACS 1997: 93-104 - Juraj Hromkovic, Sebastian Seibert, Thomas Wilke:
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. STACS 1997: 55-66 - Christoph Karg, Johannes Köbler, Rainer Schuler:
The Complexity of Generating Test Instances. STACS 1997: 375-386
skipping 20 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-24 08:19 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