Остановите войну!
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
- 2012
- Andris Ambainis:
Variable time amplitude amplification and quantum algorithms for linear algebra problems. STACS 2012: 636-647 - André Arnold, Henryk Michalewski, Damian Niwinski:
On the separation question for tree languages. STACS 2012: 396-407 - László Babai, Youming Qiao:
Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers. STACS 2012: 453-464 - Andreas Bärtschi, Subhash Suri:
Conflict-free Chromatic Art Gallery Coverage. STACS 2012: 160-171 - Frédérique Bassino, Julien David, Andrea Sportiello:
Asymptotic enumeration of Minimal Automata. STACS 2012: 88-99 - Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies:
The Denjoy alternative for computable functions. STACS 2012: 543-554 - Mikolaj Bojanczyk, Szymon Torunczyk:
Weak MSO+U over infinite trees. STACS 2012: 648-660 - Paul S. Bonsma:
Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces. STACS 2012: 531-542 - Tomás Brázdil, Stefan Kiefer:
Stabilization of Branching Queueing Networks. STACS 2012: 507-518 - Christopher H. Broadbent:
The Limits of Decidability for First Order Logic on CPDA Graphs. STACS 2012: 589-600 - Gerth Stølting Brodal, Casper Kejlberg-Rasmussen:
Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. STACS 2012: 112-123 - Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Log-supermodular functions, functional clones and counting CSPs. STACS 2012: 302-313 - Arnaud Carayol, Cyril Nicaud:
Distribution of the number of accessible states in a random deterministic automaton. STACS 2012: 194-205 - Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Mode Query in Arrays. STACS 2012: 290-301 - Ning Chen:
On Computing Pareto Stable Assignments. STACS 2012: 384-395 - Kai-Min Chung, Henry Lam, Zhenming Liu, Michael Mitzenmacher:
Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. STACS 2012: 124-135 - Thomas Colcombet:
Forms of Determinism for Automata (Invited Talk). STACS 2012: 1-23 - Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari:
Improved Bounds for Bipartite Matching on Surfaces. STACS 2012: 254-265 - Volker Diekert, Jürn Laun, Alexander Ushakov:
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P. STACS 2012: 218-229 - Martin Dietzfelbinger:
On Randomness in Hash Functions (Invited Talk). STACS 2012: 25-28 - Benjamin Doerr, Carola Winzen:
Playing Mastermind With Constant-Size Memory. STACS 2012: 441-452 - Antoine Durand-Gasselin, Peter Habermehl:
Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree. STACS 2012: 242-253 - Christoph Dürr, Thomas Wilke:
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents. STACS 2012 - Christian Eggermont, Gerhard J. Woeginger:
Motion planning with pulley, rope, and baskets. STACS 2012: 374-383 - Michael Elberfeld, Andreas Jakoby, Till Tantau:
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. STACS 2012: 66-77 - Andreas Emil Feldmann, Luca Foschini:
Balanced Partitions of Trees and Applications. STACS 2012: 100-111 - Yuval Filmus, Justin Ward:
The Power of Local Search: Maximum Coverage over a Matroid. STACS 2012: 601-612 - Olivier Finkel:
The Determinacy of Context-Free Games. STACS 2012: 555-566 - Fedor V. Fomin, Petr A. Golovach:
Parameterized Complexity of Connected Even/Odd Subgraph Problems. STACS 2012: 432-440 - Hervé Fournier, Guillaume Malod, Stefan Mengel:
Monomials in arithmetic circuits: Complete problems in the counting hierarchy. STACS 2012: 362-373
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-05-14 21:37 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