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 44 matches
- 2004
- Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr:
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets. FSTTCS 2004: 58-70 - Michaël Adélaïde, Claire Pagetti:
On the Urgency Expressiveness. FSTTCS 2004: 71-83 - Bharat Adsul, Milind A. Sohoni:
Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages. FSTTCS 2004: 84-96 - Max A. Alekseyev, Pavel A. Pevzner:
Genome Halving Problem Revisited. FSTTCS 2004: 1-15 - Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn:
A Decidable Fragment of Separation Logic. FSTTCS 2004: 97-109 - Mark de Berg, Micha Streppel:
Approximate Range Searching Using Binary Space Partitions. FSTTCS 2004: 110-121 - Olaf Beyersdorff:
Representable Disjoint NP-Pairs. FSTTCS 2004: 122-134 - Ahmed Bouajjani, Antoine Meyer:
Symbolic Reachability Analysis of Higher-Order Context-Free Processes. FSTTCS 2004: 135-147 - Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen:
Optimal Strategies in Priced Timed Game Automata. FSTTCS 2004: 148-160 - Marco Carbone, Mogens Nielsen, Vladimiro Sassone:
A Calculus for Trust Management. FSTTCS 2004: 161-173 - Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar:
Short-Cuts on Star, Source and Planar Unfoldings. FSTTCS 2004: 174-185 - Ho-Lun Cheng, Tony Tan:
Subdividing Alpha Complex. FSTTCS 2004: 186-197 - Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie:
Real-Counter Automata and Their Decision Problems. FSTTCS 2004: 198-210 - Anuj Dawar, Philippa Gardner, Giorgio Ghelli:
Adjunct Elimination Through Games in Static Ambient Logic. FSTTCS 2004: 211-223 - Anuj Dawar, David Janin:
On the Bisimulation Invariant Fragment of Monadic S1 in the Finite. FSTTCS 2004: 224-236 - Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi:
On the Complexity of Hilbert's 17th Problem. FSTTCS 2004: 237-249 - Dino Distefano, Joost-Pieter Katoen, Arend Rensink:
Who is Pointing When to Whom? FSTTCS 2004: 250-262 - Javier Esparza, Kousha Etessami:
Verifying Probabilistic Procedural Programs. FSTTCS 2004: 16-31 - Martin Fürer, Shiva Prasad Kasiviswanathan:
An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix. FSTTCS 2004: 263-274 - Paul Gastin, Benjamin Lerman, Marc Zeitoun:
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. FSTTCS 2004: 275-286 - Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS. FSTTCS 2004: 287-298 - Joachim Gudmundsson, Christos Levcopoulos:
Minimum Weight Pseudo-Triangulations. FSTTCS 2004: 299-310 - Sumit Gulwani, Ashish Tiwari, George C. Necula:
Join Algorithms for the Theory of Uninterpreted Functions. FSTTCS 2004: 311-323 - Sariel Har-Peled:
No, Coreset, No Cry. FSTTCS 2004: 324-335 - John M. Hitchcock, Aduri Pavan:
Hardness Hypotheses, Derandomization, and Circuit Complexity. FSTTCS 2004: 336-347 - Piotr Indyk:
Streaming Algorithms for Geometric Problems. FSTTCS 2004: 32-34 - Gerold Jäger, Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. FSTTCS 2004: 348-359 - Sanjay Jain, Efim B. Kinber:
Learning Languages from Positive Data and a Finite Number of Queries. FSTTCS 2004: 360-371 - Julia Kempe, Alexei Y. Kitaev, Oded Regev:
The Complexity of the Local Hamiltonian Problem. FSTTCS 2004: 372-383 - Hartmut Klauck:
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds. FSTTCS 2004: 384-395
skipping 14 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-19 07:47 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