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
- 2005
- Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan:
Causal Closure for MSC Languages. FSTTCS 2005: 335-347 - Manindra Agrawal:
Proving Lower Bounds Via Pseudo-random Generators. FSTTCS 2005: 92-105 - Eric Allender, Samir Datta, Sambuddha Roy:
The Directed Planar Reachability Problem. FSTTCS 2005: 238-249 - Toshiyasu Arai, Georg Moser:
Proofs of Termination of Rewrite Systems for Polytime Functions. FSTTCS 2005: 529-540 - Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth:
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. FSTTCS 2005: 360-371 - Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux:
When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? FSTTCS 2005: 273-284 - Mark de Berg:
Improved Bounds on the Union Complexity of Fat Objects. FSTTCS 2005: 116-127 - Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek:
Reachability Analysis of Multithreaded Software with Asynchronous Communication. FSTTCS 2005: 348-359 - Patricia Bouyer, Fabrice Chevalier, Nicolas Markey:
On the Expressiveness of TPTL and MTL. FSTTCS 2005: 432-443 - Tomás Brázdil, Antonín Kucera:
Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains. FSTTCS 2005: 372-383 - Krishnendu Chatterjee, Thomas A. Henzinger:
Semiperfect-Information Games. FSTTCS 2005: 1-18 - Taolue Chen, Tingting Han, Jian Lu:
On the Bisimulation Congruence in chi-Calculus. FSTTCS 2005: 128-139 - Bruno Codenotti, Benton McCune, Sriram Penumatcha, Kasturi R. Varadarajan:
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation. FSTTCS 2005: 505-516 - Ellie D'Hondt, Prakash Panangaden:
Reasoning About Quantum Knowledge. FSTTCS 2005: 553-564 - Deepak D'Souza, M. Raj Mohan:
Eventual Timed Automata. FSTTCS 2005: 322-334 - Michael Edwards, Kasturi R. Varadarajan:
No Coreset, No Cry: II. FSTTCS 2005: 107-115 - Joost Engelfriet, Sebastian Maneth:
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. FSTTCS 2005: 495-504 - Henning Fernau, Michael Kaufmann, Mathias Poths:
Comparing Trees Via Crossing Minimization. FSTTCS 2005: 457-469 - Tim French:
Bisimulation Quantified Logics: Undecidability. FSTTCS 2005: 396-407 - Sumit Ganguly, Deepanjan Kesh, Chandan Saha:
Practical Algorithms for Tracking Database Join Sizes. FSTTCS 2005: 297-309 - Jens Chr. Godskesen, Thomas T. Hildebrandt:
Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names. FSTTCS 2005: 140-151 - Stefan Göller, Markus Lohrey:
Fixpoint Logics on Hierarchical Structures. FSTTCS 2005: 483-494 - Xiaoyang Gu, Jack H. Lutz, Philippe Moser:
Dimensions of Copeland-Erdös Sequences. FSTTCS 2005: 250-260 - Refael Hassin, Danny Segev:
The Set Cover with Pairs Problem. FSTTCS 2005: 164-176 - Russell Impagliazzo:
Computational Complexity Since 1980. FSTTCS 2005: 19-47 - Radha Jagadeesan, Gopalan Nadathur, Vijay A. Saraswat:
Testing Concurrent Systems: An Interpretation of Intuitionistic Logic. FSTTCS 2005: 517-528 - Prasad Jayanti, Srdjan Petrovic:
Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks. FSTTCS 2005: 408-419 - Pavel Krcál, Radek Pelánek:
On Sampled Semantics of Timed Systems. FSTTCS 2005: 310-321 - Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
Reachability of Hennessy-Milner Properties for Weakly Extended PRS. FSTTCS 2005: 213-224 - Shankara Narayanan Krishna, Paritosh K. Pandya:
Modal Strength Reduction in Quantified Discrete Duration Calculus. FSTTCS 2005: 444-456
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-09-21 04:24 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