Остановите войну!
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 59 matches
- 2011
- Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler:
Analysis of Agglomerative Clustering. STACS 2011: 308-319 - Susanne Albers:
Algorithms for Dynamic Speed Scaling. STACS 2011: 1-11 - Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza:
Balanced Interval Coloring. STACS 2011: 531-542 - Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen:
Structural Decomposition Methods and What They are Good For. STACS 2011: 12-28 - Maxim A. Babenko, Alexey Gusakov:
New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs. STACS 2011: 519-530 - Laurent Bienvenu, Wolfgang Merkle, André Nies:
Solovay functions and K-triviality. STACS 2011: 452-463 - Markus Bläser, Christian Engels:
Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals. STACS 2011: 555-566 - Francine Blanchet-Sadri, John Lensmire:
On Minimal Sturmian Partial Words. STACS 2011: 225-236 - Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Cross-Composition: A New Technique for Kernelization Lower Bounds. STACS 2011: 165-176 - Mikolaj Bojanczyk:
Data Monoids. STACS 2011: 105-116 - Alex Borello, Gaétan Richard, Véronique Terrier:
A speed-up of oblivious multi-head finite automata by cellular automata. STACS 2011: 273-283 - Ana Busic, Jean Mairesse, Irène Marcovici:
Probabilistic cellular automata, invariant measures, and perfect sampling. STACS 2011: 296-307 - Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco:
Local dependency dynamic programming in the presence of memory faults. STACS 2011: 45-56 - John Case, Timo Kötzing:
Measuring Learning Complexity with Criteria Epitomizers. STACS 2011: 320-331 - Balder ten Cate, Luc Segoufin:
Unary negation. STACS 2011: 344-355 - Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Telling convex from reflex allows to map a polygon. STACS 2011: 153-164 - Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee:
Scheduling for Weighted Flow Time and Energy with Rejection Penalty. STACS 2011: 392-403 - Andrew M. Childs, Robin Kothari:
Quantum query complexity of minor-closed graph properties. STACS 2011: 661-672 - Hubert Comon-Lundh, Véronique Cortier:
How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. STACS 2011: 29-44 - Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS 2011: 579-590 - Erik D. Demaine, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers:
Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract). STACS 2011: 201-212 - Dariusz Dereniowski:
From Pathwidth to Connected Pathwidth. STACS 2011: 416-427 - Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the maximum multiplicity of some common geometric graphs. STACS 2011: 637-648 - Martin E. Dyer, David Richerby:
The #CSP Dichotomy is Decidable. STACS 2011: 261-272 - Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger:
Analysis of multi-stage open shop processing systems. STACS 2011: 484-494 - Nazim Fatès:
Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision. STACS 2011: 284-295 - Diego Figueira, Luc Segoufin:
Bottom-up automata on data trees and vertical XPath. STACS 2011: 93-104 - Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting forbidden minors: Approximation and Kernelization. STACS 2011: 189-200 - Dominik D. Freydenberger:
Extended Regular Expressions: Succinctness and Decidability. STACS 2011: 507-518 - Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach:
Weakly Unambiguous Morphisms. STACS 2011: 213-224
skipping 29 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-11 16:46 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