Остановите войну!
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 55 matches
- 2014
- Laurent Doyen, Line Juhl, Kim Guldstrand Larsen, Nicolas Markey, Mahsa Shirmohammadi:
Synchronizing Words for Weighted and Timed Automata. FSTTCS 2014: 121-132 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmet Kara, Othmane Rezine:
Verification of Dynamic Register Automata. FSTTCS 2014: 653-665 - Shaull Almagor, Denis Kuperberg, Orna Kupferman:
Regular Sensing. FSTTCS 2014: 161-173 - Sonika Arora, Venkatesan T. Chakaravarthy, Kanika Gupta, Neelima Gupta, Yogish Sabharwal:
Replica Placement on Directed Acyclic Graphs. FSTTCS 2014: 213-225 - Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
On Bounded Reachability Analysis of Shared Memory Systems. FSTTCS 2014: 611-623 - Paolo Baldan, Filippo Bonchi, Henning Kerstan, Barbara König:
Behavioral Metrics via Functor Lifting. FSTTCS 2014: 403-415 - Nikhil Bansal:
New Developments in Iterated Rounding (Invited Talk). FSTTCS 2014: 1-10 - Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh:
Connecting Vertices by Independent Trees. FSTTCS 2014: 73-84 - Christoph Berkholz, Michael Elberfeld:
Parameterized Complexity of Fixed Variable Logics. FSTTCS 2014: 109-120 - Nathalie Bertrand, Serge Haddad, Engel Lefaucheux:
Foundation of Diagnosis and Predictability in Probabilistic Systems. FSTTCS 2014: 417-429 - Fabrizio Biondi, Axel Legay, Bo Friis Nielsen, Pasquale Malacaria, Andrzej Wasowski:
Information Leakage of Non-Terminating Processes. FSTTCS 2014: 517-529 - Adrian Bock, Yuri Faenza, Carsten Moldenhauer, Andres J. Ruiz-Vargas:
Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number. FSTTCS 2014: 187-198 - Benedikt Bollig, Paul Gastin, Akshay Kumar:
Parameterized Communicating Automata: Complementation and Model Checking. FSTTCS 2014: 625-637 - Patricia Bouyer, Nicolas Markey, Daniel Stan:
Mixed Nash Equilibria in Concurrent Terminal-Reward Games. FSTTCS 2014: 351-363 - Franck Cassez, Christian Müller, Karla Burnett:
Summary-Based Inter-Procedural Analysis via Modular Trace Refinement. FSTTCS 2014: 545-556 - Rohit Chadha, Umang Mathur, Stefan Schwoon:
Computing Information Flow Using Symbolic Model-Checking. FSTTCS 2014: 505-516 - Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, Lin F. Yang:
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. FSTTCS 2014: 585-595 - Erick Chastain, Adi Livnat, Christos H. Papadimitriou, Umesh V. Vazirani:
Algorithms, Games, and Evolution (Invited Talk). FSTTCS 2014: 45-46 - Taolue Chen, Tingting Han:
On the Complexity of Computing Maximum Entropy for Markovian Models. FSTTCS 2014: 571-583 - Dmitry Chistikov:
Notes on Counting with Finite Machines. FSTTCS 2014: 339-350 - Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe. FSTTCS 2014: 379-390 - Thomas Colcombet, Amaldev Manuel:
Generalized Data Automata and Fixpoint Logic. FSTTCS 2014: 267-278 - C. Aiswarya, Paul Gastin:
Reasoning About Distributed Systems: WYSIWYG (Invited Talk). FSTTCS 2014: 11-30 - Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian Graphs. FSTTCS 2014: 97-108 - Claire David, Nadime Francis, Filip Murlak:
Consistency of Injective Tree Patterns. FSTTCS 2014: 279-290 - Anant Dhayal, Jayalal Sarma, Saurabh Sawlani:
Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space. FSTTCS 2014: 597-609 - Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh:
Homomorphism Polynomials Complete for VP. FSTTCS 2014: 493-504 - Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Finite-Valued Weighted Automata. FSTTCS 2014: 133-145 - Emmanuel Filiot, Shankara Narayanan Krishna, Ashutosh Trivedi:
First-order Definable String Transformations. FSTTCS 2014: 147-159 - Efraim Gelman, Amnon Ta-Shma:
The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent. FSTTCS 2014: 327-338
skipping 25 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-30 21:57 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