Остановите войну!
for scientists:
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 66 matches
- 2023
- Konstantinos Kartas:
An undecidability result for the asymptotic theory of p-adic fields. Ann. Pure Appl. Log. 174(2): 103203 (2023) - Mnacho Echenim, Nicolas Peltier:
An undecidability result for Separation Logic with theory reasoning. Inf. Process. Lett. 182: 106359 (2023) - Halley Young:
Undecidability Results and Their Relevance in Modern Music Making. CoRR abs/2309.05595 (2023) - 2020
- Andreas Malcher:
Hierarchies and undecidability results for iterative arrays with sparse communication. Nat. Comput. 19(4): 797-809 (2020) - 2018
- Andreas Malcher:
Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication. Automata 2018: 100-112 - 2017
- Nathanaël Fijalkow:
Undecidability results for probabilistic automata. ACM SIGLOG News 4(4): 10-17 (2017) - 2016
- Sebastian Rudolph:
Undecidability Results for Database-Inspired Reasoning Problems in Very Expressive Description Logics. KR 2016: 247-257 - 2015
- Heinrich Ody:
Undecidability Results for Multi-Lane Spatial Logic. ICTAC 2015: 404-421 - 2014
- Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Improved Undecidability Results for Reachability Games on Recursive Timed Automata. GandALF 2014: 245-259 - Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
Decidability and Undecidability Results for Propositional Schemata. CoRR abs/1401.3900 (2014) - James Belk, Collin Bleak:
Some undecidability results for asynchronous transducers and the Brin-Thompson group 2V. CoRR abs/1405.0982 (2014) - 2012
- Endre Csóka:
An Undecidability Result on Limits of Sparse Graphs. Electron. J. Comb. 19(2): 21 (2012) - 2011
- Henning Bordihn, Martin Kutrib, Andreas Malcher:
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 22(7): 1577-1592 (2011) - Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
Decidability and Undecidability Results for Propositional Schemata. J. Artif. Intell. Res. 40: 599-656 (2011) - Jerzy Marcinkowski, Jakub Michaliszyn:
The Ultimate Undecidability Result for the Halpern-Shoham Logic. LICS 2011: 377-386 - 2010
- Stavros S. Cosmadakis, Eugénie Foustoucos, Anastasios Sidiropoulos:
Undecidability and intractability results concerning datalog programs and their persistency numbers. ACM Trans. Comput. Log. 11(2): 12:1-12:29 (2010) - Krishnendu Chatterjee, Thomas A. Henzinger:
Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. ATVA 2010: 1-16 - Henning Bordihn, Martin Kutrib, Andreas Malcher:
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Developments in Language Theory 2010: 88-99 - Alexis Goyet, Masami Hagiya, Yoshinori Tanabe:
Decidability and Undecidability Results on the Modal µ-Calculus with a Natural Number-Valued Semantics. WoLLIC 2010: 148-160 - Alexandru Sofronia, Alexandru Popa, Gheorghe Stefanescu:
Undecidability Results for Finite Interactive Systems. CoRR abs/1001.0143 (2010) - 2009
- Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
Undecidability Results for Timed Automata with Silent Transitions. Fundam. Informaticae 92(1-2): 1-25 (2009) - Sergio Giro:
Undecidability Results for Distributed Probabilistic Systems. SBMF 2009: 220-235 - 2008
- Alexandru Sofronia, Alexandru Popa, Gheorghe Stefanescu:
Undecidability Results for Finite Interactive Systems. SYNASC 2008: 366-369 - Rakesh M. Verma:
New Undecidability Results for Properties of Term Rewrite Systems. RULE 2008: 69-85 - 2007
- Vesa Halava, Mika Hirvensalo:
Improved matrix pair undecidability results. Acta Informatica 44(3-4): 191-205 (2007) - Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller:
Monadic Fragments of Gödel Logics: Decidability and Undecidability Results. LPAR 2007: 77-91 - Mika Hirvensalo:
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages. SOFSEM (1) 2007: 309-319 - 2006
- Johann Deneux:
Verification of Parameterized and Timed Systems : Undecidability Results and Efficient Methods. Uppsala University, Sweden, 2006 - Alessandro Artale:
Reasoning on temporal class diagrams: Undecidability results. Ann. Math. Artif. Intell. 46(3): 265-288 (2006) - Patricia Bouyer, Thomas Brihaye, Nicolas Markey:
Improved undecidability results on weighted timed automata. Inf. Process. Lett. 98(5): 188-194 (2006)
skipping 36 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-05-13 04:37 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