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 45 matches
- 2010
- S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Model checking time-constrained scenario-based specifications. FSTTCS 2010: 204-215 - Rajeev Alur, Pavol Cerný:
Expressiveness of streaming string transducers. FSTTCS 2010: 1-12 - Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. FSTTCS 2010: 327-337 - Eugene Asarin, Aldric Degorre:
Two Size Measures for Timed Languages. FSTTCS 2010: 376-387 - Mohamed Faouzi Atig:
Global Model Checking of Ordered Multi-Pushdown Systems. FSTTCS 2010: 216-227 - Michael Backes, Matteo Maffei, Esfandiar Mohammadi:
Computationally Sound Abstraction and Verification of Secure Multi-Party Computations. FSTTCS 2010: 352-363 - Piotr Berman, Sofya Raskhodnikova, Ge Ruan:
Finding Sparser Directed Spanners. FSTTCS 2010: 424-435 - Udi Boker, Orna Kupferman, Avital Steinitz:
Parityizing Rabin and Streett. FSTTCS 2010: 412-423 - Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun:
Place-Boundedness for Vector Addition Systems with one zero-test. FSTTCS 2010: 192-203 - Tomás Brázdil, Václav Brozek, Kousha Etessami:
One-Counter Stochastic Games. FSTTCS 2010: 108-119 - Sara Capecchi, Elena Giachino, Nobuko Yoshida:
Global Escape in Multiparty Sessions. FSTTCS 2010: 338-351 - Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Model Checking Concurrent Programs with Nondeterminism and Randomization. FSTTCS 2010: 364-375 - André Chailloux, Iordanis Kerenidis, Jamie Sikora:
Lower bounds for Quantum Oblivious Transfer. FSTTCS 2010: 157-168 - Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal:
A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints. FSTTCS 2010: 181-191 - Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal:
Finding Independent Sets in Unions of Perfect Graphs. FSTTCS 2010: 251-259 - Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf:
New Results on Quantum Property Testing. FSTTCS 2010: 145-156 - Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Generalized Mean-payoff and Energy Games. FSTTCS 2010: 505-516 - Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner:
Graph Isomorphism is not AC0 reducible to Group Isomorphism. FSTTCS 2010: 317-326 - Bruno Courcelle:
Special tree-width and the verification of monadic second-order graph pr operties. FSTTCS 2010: 13-29 - Wojciech Czerwinski, Slawomir Lasota:
Fast equivalence-checking for normed context-free processes. FSTTCS 2010: 260-271 - Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh:
Determining the Winner of a Dodgson Election is Hard. FSTTCS 2010: 459-468 - Robert Ganian, Petr Hlinený, Jan Obdrzálek:
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. FSTTCS 2010: 73-83 - Qi Ge, Daniel Stefankovic:
A graph polynomial for independent sets of bipartite graphs. FSTTCS 2010: 240-250 - Blaise Genest, Anca Muscholl, Zhilin Wu:
Verifying Recursive Active Documents with Positive Data Tree Rewriting. FSTTCS 2010: 469-480 - Gagan Goel, Pushkar Tripathi, Lei Wang:
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems. FSTTCS 2010: 436-446 - Matthew Hague, Anthony Widjaja To:
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems. FSTTCS 2010: 228-239 - Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell:
Computing Rational Radical Sums in Uniform TC0. FSTTCS 2010: 308-316 - Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs. FSTTCS 2010: 296-307 - Ahmet Kara, Thomas Schwentick, Thomas Zeume:
Temporal Logics on Words with Multiple Data Values. FSTTCS 2010: 481-492 - Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS 2010: 169-180
skipping 15 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-09-22 12:04 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