Остановите войну!
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 46 matches
- 2011
- Abhijin Adiga, L. Sunil Chandran, Rogers Mathew:
Cubicity, Degeneracy, and Crossing Number. FSTTCS 2011: 176-190 - Susanne Albers:
Energy-Efficient Algorithms (Invited Talk). FSTTCS 2011: 1-2 - Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar:
Rainbow Connectivity: Hardness and Tractability. FSTTCS 2011: 241-251 - Mohamed Faouzi Atig, Pierre Ganty:
Approximating Petri Net Reachability Along Context-free Traces. FSTTCS 2011: 152-163 - Alex Bain, John C. Mitchell, Rahul Sharma, Deian Stefan, Joe Zimmerman:
A Domain-Specific Language for Computing on Encrypted Data (Invited Talk). FSTTCS 2011: 6-24 - Pablo Barceló, Leonid Libkin, Juan L. Reutter:
Parameterized Regular Expressions and Their Languages. FSTTCS 2011: 351-362 - Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann:
Optimal Packed String Matching. FSTTCS 2011: 423-432 - Siavosh Benabbas, Siu On Chan, Konstantinos Georgiou, Avner Magen:
Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy. FSTTCS 2011: 41-54 - Nathalie Bertrand, Blaise Genest:
Minimal Disclosure in Partially Observable Markov Decision Processes. FSTTCS 2011: 411-422 - Dietmar Berwanger, Lukasz Kaiser, Bernd Puchala:
A Perfect-Information Construction for Coordination in Games. FSTTCS 2011: 387-398 - Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels:
Nash Equilibria in Concurrent Games with Büchi Objectives. FSTTCS 2011: 375-386 - H. J. Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, Barbara König:
Conditional Reactive Systems. FSTTCS 2011: 191-203 - Yang Cai, Ting Zhang:
A Tight Lower Bound for Streett Complementation. FSTTCS 2011: 339-350 - Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri:
Dynamic programming in faulty memory hierarchies (cache-obliviously). FSTTCS 2011: 433-444 - Didier Caucal, Teodor Knapik:
Higher order indexed monadic systems. FSTTCS 2011: 469-480 - Supratik Chakraborty, Amit Kumar:
Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers. FSTTCS 2011 - Céline Chevalier, Stéphanie Delaune, Steve Kremer:
Transforming Password Protocols to Compose. FSTTCS 2011: 204-216 - Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo:
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS 2011: 229-240 - Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski:
Approximation Algorithms for Union and Intersection Covering Problems. FSTTCS 2011: 28-40 - Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan:
Petri Net Reachability Graphs: Decidability Status of FO Properties. FSTTCS 2011: 140-151 - Jacques Duparc, Alessandro Facchini, Filip Murlak:
Definable Operations On Weakly Recognizable Sets of Trees. FSTTCS 2011: 363-374 - Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence logic with a majority quantifier. FSTTCS 2011: 252-263 - Uli Fahrenberg, Axel Legay, Claus R. Thrane:
The Quantitative Linear-Time--Branching-Time Spectrum. FSTTCS 2011: 103-114 - John Fearnley, Markus N. Rabe, Sven Schewe, Lijun Zhang:
Efficient Approximation of Optimal Control for Continuous-Time Markov Games. FSTTCS 2011: 399-410 - Bertram Felgenhauer, Harald Zankl, Aart Middeldorp:
Layer Systems for Proving Confluence. FSTTCS 2011: 288-299 - Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of Nested Word Transductions. FSTTCS 2011: 312-324 - Fedor V. Fomin, Geevarghese Philip, Yngve Villanger:
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. FSTTCS 2011: 164-175 - Hongfei Fu, Joost-Pieter Katoen:
Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems. FSTTCS 2011: 445-456 - Christian Glaßer, Christian Reitwießner, Maximilian Witek:
Applications of Discrepancy Theory in Multiobjective Approximation. FSTTCS 2011: 55-65 - Stefan Göller, Markus Lohrey:
The First-Order Theory of Ground Tree Rewrite Graphs. FSTTCS 2011: 276-287
skipping 16 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-08-24 12:15 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