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 50 matches
- 2012
- Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg:
Timed Lossy Channel Systems. FSTTCS 2012: 374-386 - Dimitris Achlioptas, Themis Gouleakis:
Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion . FSTTCS 2012: 16-23 - Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon:
Overlap of Convex Polytopes under Rigid Motion. FSTTCS 2012: 498-509 - Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen:
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. FSTTCS 2012: 257-266 - Anthony Widjaja Lin:
Accelerating tree-automatic relations. FSTTCS 2012: 313-324 - Gergei Bana, Pedro Adão, Hideki Sakurada:
Computationally Complete Symbolic Attacker in Action. FSTTCS 2012: 546-560 - Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys:
Decidable classes of documents for XPath. FSTTCS 2012: 99-111 - Binay K. Bhattacharya, Yuzhuang Hu:
k-delivery traveling salesman problem on tree networks. FSTTCS 2012: 325-336 - Mikolaj Bojanczyk, Szymon Torunczyk:
Imperative Programming in Sets with Atoms. FSTTCS 2012: 4-15 - Udi Boker, Thomas A. Henzinger:
Approximate Determinization of Quantitative Automata. FSTTCS 2012: 362-373 - Rémi Bonnet, Alain Finkel, M. Praveen:
Extending the Rackoff technique to Affine nets. FSTTCS 2012: 301-312 - Paul S. Bonsma:
Rerouting shortest paths in planar graphs. FSTTCS 2012: 337-349 - Laura Bozzelli, César Sánchez:
Visibly Rational Expressions. FSTTCS 2012: 211-223 - Tomás Brázdil, Holger Hermanns, Jan Krcál, Jan Kretínský, Vojtech Rehák:
Verification of Open Interactive Markov Chains. FSTTCS 2012: 474-485 - Christopher H. Broadbent, Stefan Göller:
On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two. FSTTCS 2012: 160-172 - Rohit Chadha, Michael Ummels:
The Complexity of Quantitative Information Flow in Recursive Programs. FSTTCS 2012: 534-545 - Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal:
Density Functions subject to a Co-Matroid Constraint. FSTTCS 2012: 236-248 - Venkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal:
Scheduling Resources for Executing a Partial Set of Jobs. FSTTCS 2012: 199-210 - Krishnendu Chatterjee, Manas Joglekar, Nisarg Shah:
Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives. FSTTCS 2012: 461-473 - Robert Crowston, Gregory Z. Gutin, Mark Jones:
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound. FSTTCS 2012: 400-411 - Vincent Danos, Jérôme Feret, Walter Fontana, Russell Harmer, Jonathan Hayman, Jean Krivine, Christopher D. Thompson-Walsh, Glynn Winskel:
Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models. FSTTCS 2012: 276-288 - Minati De, Subhas C. Nandy, Sasanka Roy:
Minimum Enclosing Circle with Few Extra Variables. FSTTCS 2012: 510-521 - Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso, Gianluigi Zavattaro:
On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. FSTTCS 2012: 289-300 - Pranavadatta Devaki, Aditya Kanade:
Static Analysis for Checking Data Format Compatibility of Programs. FSTTCS 2012: 522-533 - Khaled M. Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula, Arindam Pal:
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. FSTTCS 2012: 267-275 - Guy Feigenblat, Ely Porat, Ariel Shiftan:
Exponential Space Improvement for minwise Based Algorithms. FSTTCS 2012: 70-85 - Nathanaël Fijalkow, Martin Zimmermann:
Cost-Parity and Cost-Streett Games. FSTTCS 2012: 124-135 - Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Bisimilarity of Probabilistic Pushdown Automata. FSTTCS 2012: 448-460 - Jakub Gajarský, Petr Hlinený:
Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. FSTTCS 2012: 112-123 - Patrice Godefroid:
Test Generation Using Symbolic Execution. FSTTCS 2012: 24-33
skipping 20 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-26 14:20 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