Остановите войну!
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 61 matches
- 2013
- Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow:
Algorithms for Designing Pop-Up Cards. STACS 2013: 269-280 - Andris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf:
Optimal quantum query bounds for almost all Boolean functions. STACS 2013: 446-453 - Albert Atserias, Sergi Oliva:
Bounded-width QBF is PSPACE-complete. STACS 2013: 44-54 - Martijn Baartse, Klaus Meer:
The PCP theorem for NP over the reals. STACS 2013: 104-115 - Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane:
Space-Time Trade-offs for Stack-Based Algorithms. STACS 2013: 281-292 - Amir M. Ben-Amram:
Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract). STACS 2013: 514-525 - Yonatan Bilu, Amit Daniely, Nati Linial, Michael E. Saks:
On the practically interesting instances of MAXCUT. STACS 2013: 526-537 - Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Probably Optimal Graph Motifs. STACS 2013: 20-31 - Mikolaj Bojanczyk, Tomasz Idziaszek, Michal Skrzypczak:
Regular languages of thin trees. STACS 2013: 562-573 - Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
Graph coloring, communication complexity and the stubborn problem (Invited talk). STACS 2013: 3-4 - Mark Braverman, Gal Oshri:
Search using queries on indistinguishable items. STACS 2013: 610-621 - Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow:
Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM. STACS 2013: 172-184 - Florent Capelli, Arnaud Durand, Stefan Mengel:
The arithmetic complexity of tensor contractions. STACS 2013: 365-376 - Adam Case, Jack H. Lutz:
Mutual Dimension. STACS 2013: 116-126 - Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. STACS 2013: 148-159 - Danny Z. Chen, Haitao Wang:
L_1 Shortest Path Queries among Polygonal Obstacles in the Plane. STACS 2013: 293-304 - Julien Clément, Thu Hien Nguyen Thi, Brigitte Vallée:
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms. STACS 2013: 598-609 - Thomas Colcombet, Laure Daviaud:
Approximate comparison of distance automata. STACS 2013: 574-585 - Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha:
On Pairwise Spanners. STACS 2013: 209-220 - Malte Darnstädt, Hans Ulrich Simon, Balázs Szörényi:
Unlabeled Data Does Provably Help. STACS 2013: 185-196 - Luc Dartois, Charles Paperman:
Two-variable first order logic with modular predicates over words. STACS 2013: 329-340 - György Dósa, Jirí Sgall:
First Fit bin packing: A tight analysis. STACS 2013: 538-549 - Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved Bounds for Online Preemptive Matching. STACS 2013: 389-399 - Kousha Etessami:
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk). STACS 2013: 1-2 - Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger:
Tight bounds for Parameterized Complexity of Cluster Editing. STACS 2013: 32-43 - Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. STACS 2013: 92-103 - Fedor V. Fomin, Yngve Villanger:
Searching for better fill-in. STACS 2013: 8-19 - Nathanaël François, Frédéric Magniez:
Streaming Complexity of Checking Priority Queues. STACS 2013: 454-465 - Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider:
Backdoors to q-Horn. STACS 2013: 67-79 - Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu:
Finding Pseudo-repetitions. STACS 2013: 257-268
skipping 31 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-03 23:52 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