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 32 matches
- 2002
- Bharat Adsul, Milind A. Sohoni:
Local Normal Forms for Logics over Traces. FSTTCS 2002: 47-58 - Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. FSTTCS 2002: 59-70 - Michele Bugliesi, Silvia Crafa, Massimo Merro, Vladimiro Sassone:
Communication Interference in Mobile Boxed Ambients. FSTTCS 2002: 71-84 - Giuseppe Castagna, Francesco Zappa Nardelli:
The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity. FSTTCS 2002: 85-96 - Federico Crazzolara, Glynn Winskel:
Composing Strand Spaces. FSTTCS 2002: 97-108 - Anuj Dawar, Stephan Kreutzer:
Generalising Automaticity to Modal Properties of Finite Structures. FSTTCS 2002: 109-120 - Stéphane Demri, Deepak D'Souza:
An Automata-Theoretic Approach to Constraint LTL. FSTTCS 2002: 121-132 - Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker:
Hardness Results for Multicast Cost Sharing. FSTTCS 2002: 133-144 - Alain Finkel, Jérôme Leroux:
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. FSTTCS 2002: 145-156 - Carsten Fritz, Thomas Wilke:
State Space Reductions for Alternating Büchi Automata. FSTTCS 2002: 157-168 - Vijay K. Garg:
Algorithmic Combinatorics Based on Slicing Posets. FSTTCS 2002: 169-181 - Jens Gramm, Jiong Guo, Rolf Niedermeier:
Pattern Matching for Arc-Annotated Sequences. FSTTCS 2002: 182-193 - Bernhard Heinemann:
Knowledge over Dense Flows of Time (from a Hybrid Point of View). FSTTCS 2002: 194-205 - Thanh Minh Hoang, Thomas Thierauf:
The Complexity of the Inertia. FSTTCS 2002: 206-217 - Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. FSTTCS 2002: 218-229 - Konstantin Korovin, Andrei Voronkov:
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures. FSTTCS 2002: 230-240 - Ralf Küsters, Thomas Wilke:
Deciding the First Level of the µ-Calculus Alternation Hierarchy. FSTTCS 2002: 241-252 - Hendrik W. Lenstra Jr.:
Primality Testing with Gaussian Periods. FSTTCS 2002: 1 - Martin Leucker, P. Madhusudan, Supratik Mukhopadhyay:
Dynamic Message Sequence Charts. FSTTCS 2002: 253-264 - Harry G. Mairson:
From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple. FSTTCS 2002: 2-17 - Sebastian Maneth:
The Complexity of Compositions of Deterministic Tree Transducers. FSTTCS 2002: 265-276 - Dale Miller, Alwen Fernanto Tiu:
Encoding Generic Judgments. FSTTCS 2002: 18-32 - S. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian:
On the Hardness of Approximating Minimum Monopoly Problems. FSTTCS 2002: 277-288 - Madhavan Mukund:
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems. FSTTCS 2002: 289-300 - K. V. M. Naidu, H. Ramesh:
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic. FSTTCS 2002: 301-310 - C.-H. Luke Ong:
Model Checking Algol-Like Languages Using Game Semantics. FSTTCS 2002: 33-36 - Yogish Sabharwal, Nishant Sharma, Sandeep Sen:
Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions. FSTTCS 2002: 311-323 - A. Prasad Sistla:
Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases. FSTTCS 2002: 324-335 - Margus Veanes:
Modeling Software: From Theory to Practice. FSTTCS 2002: 37-46 - Walter Vogler, Ralf Wollowski:
Decomposition in Asynchronous Circuit Design. FSTTCS 2002: 336-347
skipping 2 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 10:33 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