![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
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 22 matches
- 2016
- Parosh Aziz Abdulla, Stéphane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov:
Preface. Fundam. Informaticae 143(3-4): i-ii (2016) - S. Akshay, Loïc Hélouët, Claude Jard, Pierre-Alain Reynier:
Robustness of Time Petri Nets under Guard Enlargement. Fundam. Informaticae 143(3-4): 207-234 (2016) - Jan G. Bazan, Stanislawa Bazan-Socha, Sylwia Buregwa-Czuma, Lukasz Dydo, Wojciech Rzasa
, Andrzej Skowron
:
A Classifier Based on a Decision Tree with Verifying Cuts. Fundam. Informaticae 143(1-2): 1-18 (2016) - Jan G. Bazan, Adam Szczur
, Lukasz Dydo, Hubert Wojtowicz, Marcin Szpyrka:
Classifiers for Behavioral Patterns Identification Induced from Huge Temporal Data. Fundam. Informaticae 143(1-2): 19-34 (2016) - Marco Bellia, M. Eugenia Occhiuto:
Programming Self-Assembly of DNA Tiles. Fundam. Informaticae 143(1-2): 35-49 (2016) - Béatrice Bérard, Serge Haddad, Aleksandra Jovanovic, Didier Lime
:
Interrupt Timed Automata with Auxiliary Clocks and Parameters. Fundam. Informaticae 143(3-4): 235-259 (2016) - Stefano Brocchi, Paolo Massazza:
A New Sandpile Model with Smoothness Assumptions. Fundam. Informaticae 143(3-4): 261-286 (2016) - Valentina Castiglioni
, Ruggero Lanotte
, Simone Tini
:
A Function Elimination Method for Checking Satisfiability of Arithmetical Logics. Fundam. Informaticae 143(1-2): 51-71 (2016) - Ludwik Czaja, Wojciech Penczek
, Krzysztof Stencel:
Preface. Fundam. Informaticae 143(1-2): v-vi (2016) - Giorgio Delzanno, Arnaud Sangnier
, Riccardo Traverso:
Adding Data Registers to Parameterized Networks with Broadcast. Fundam. Informaticae 143(3-4): 287-316 (2016) - Damas P. Gruska:
Differential Privacy and Security. Fundam. Informaticae 143(1-2): 73-87 (2016) - Christoph Haase
, Joël Ouaknine, James Worrell
:
Relating Reachability Problems in Timed and Counter Automata. Fundam. Informaticae 143(3-4): 317-338 (2016) - Michael Köhler-Bußmeier, Frank Heitmann:
An Upper Bound for the Reachability Problem of Safe, Elementary Hornets. Fundam. Informaticae 143(1-2): 89-100 (2016) - Irina A. Lomazova
, Louchka Popova-Zeugmann:
Controlling Petri Net Behavior using Priorities for Transitions. Fundam. Informaticae 143(1-2): 101-112 (2016) - Richard Mayr, Patrick Totzke
:
Branching-Time Model Checking Gap-Order Constraint Systems. Fundam. Informaticae 143(3-4): 339-353 (2016) - Ernst W. Mayr, Jeremias Weihmann:
Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities. Fundam. Informaticae 143(3-4): 355-391 (2016) - Linh Anh Nguyen:
A Tractable Rule Language in the Modal and Description Logic that Combines CPDL with Regular Grammar Logic. Fundam. Informaticae 143(1-2): 113-139 (2016) - Artturi Piipponen, Antti Valmari:
Constructing Minimal Coverability Sets. Fundam. Informaticae 143(3-4): 393-414 (2016) - Roman R. Redziejowski:
Cut Points in PEG. Fundam. Informaticae 143(1-2): 141-149 (2016) - Julien Reichert:
On The Complexity of Counter Reachability Games. Fundam. Informaticae 143(3-4): 415-436 (2016) - Zbigniew Suraj
, Agnieszka Lasek, Piotr Lasek:
Inverted Fuzzy Implications in Approximate Reasoning. Fundam. Informaticae 143(1-2): 151-171 (2016) - Bozena Wozna-Szczesniak
:
SAT-based Bounded Model Checking for Weighted Deontic Interpreted Systems. Fundam. Informaticae 143(1-2): 173-205 (2016)
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-11 01:55 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