Остановите войну!
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 60 matches
- 2008
- Susanne Albers, Pascal Weil:
Preface - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008: 1-6 - Susanne Albers, Pascal Weil:
Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008 - Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel:
Pushdown Compression. STACS 2008: 39-48 - Andris Ambainis:
Quantum search with variable times. STACS 2008: 49-61 - Alexis Ballier, Bruno Durand, Emmanuel Jeandel:
Structural aspects of tilings. STACS 2008: 61-72 - Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Veraschagin:
Limit complexities revisited. STACS 2008: 73-84 - Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree. STACS 2008: 85-96 - Markus Bläser, Christian Hoffmann:
On the Complexity of the Interlace Polynomial. STACS 2008: 97-108 - Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie:
Minimizing Flow Time in the Wireless Gathering Problem. STACS 2008: 109-120 - Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell:
On Termination for Faulty Channel Machines. STACS 2008: 121-132 - Patrick Briest, Martin Hoefer, Piotr Krysta:
Stackelberg Network Pricing Games. STACS 2008: 133-142 - Joshua Brody, Amit Chakrabarti:
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound. STACS 2008: 145-156 - Venkatesan T. Chakaravarthy, Sambuddha Roy:
Finding Irrefutable Certificates for S2p via Arthur and Merlin. STACS 2008: 157-168 - Chao Chen, Daniel Freedman:
Quantifying Homology Classes. STACS 2008: 169-180 - Maxime Crochemore, Lucian Ilie:
Understanding Maximal Repetitions in Strings. STACS 2008: 11-16 - Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami:
Connecting Polygonizations via Stretches and Twangs. STACS 2008: 217-228 - Samir Datta, Raghav Kulkarni, Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS 2008: 229-240 - Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Tight Bounds for Blind Search on the Integers. STACS 2008: 241-252 - Jean-François Dufourd:
Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps. STACS 2008: 253-264 - Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. STACS 2008: 265-276 - Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. STACS 2008: 289-300 - Diana Fischer, Erich Grädel, Lukasz Kaiser:
Model Checking Games for the Quantitative µ-Calculus. STACS 2008: 301-312 - Tobias Ganzow, Sasha Rubin:
Order-Invariant MSO is Stronger than Counting MSO in the Finite. STACS 2008: 313-324 - Wouter Gelade, Frank Neven:
Succinctness of the Complement and Intersection of Regular Expressions. STACS 2008: 325-336 - Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. STACS 2008: 337-348 - Edith Hemaspaandra, Henning Schnoor:
On the Complexity of Elementary Modal Logics. STACS 2008: 349-360 - Viet Tung Hoang, Wing-Kin Sung:
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees. STACS 2008: 361-372 - Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty. STACS 2008: 277-288 - Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen:
Improved Algorithms for the Range Next Value Problem and Applications. STACS 2008: 205-216 - Lukasz Kaiser, Sasha Rubin, Vince Bárány:
Cardinality and counting quantifiers on omega-automatic structures. STACS 2008: 385-396
skipping 30 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-03-28 15:40 CET 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