Остановите войну!
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 3,865 matches
- 2024
- Luca Bernardinello, Jetty Kleijn, Laure Petrucci:
Preface. Fundam. Informaticae 190(2-4) (2024) - Chavdar Dangalchev:
Link Residual Closeness of Harary Graphs. Fundam. Informaticae 191(1): 1-15 (2024) - Jesús Arturo Jiménez González:
A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸r. Fundam. Informaticae 191(1): 17-66 (2024) - Loïc Hélouët, Pranay Agrawal:
Waiting Nets: State Classes and Taxonomy. Fundam. Informaticae 190(2-4): 63-107 (2024) - Lisa Luise Mannel, Wil M. P. van der Aalst:
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns. Fundam. Informaticae 190(2-4): 109-158 (2024) - Jan Martijn E. M. van der Werf, Andrey Rivkin, Marco Montali, Artem Polyvyanyy:
Correctness Notions for Petri Nets with Identifiers. Fundam. Informaticae 190(2-4): 159-207 (2024) - Sizhong Zhou, Jiancheng Wu:
Two Sufficient Conditions for Graphs to Admit Path Factors. Fundam. Informaticae 191(1): 67-77 (2024) - 2022
- Samy Abbes:
Introduction to Probabilistic Concurrent Systems. Fundam. Informaticae 187(2-4): 71-102 (2022) - Kunal Abhishek, E. George Dharma Prakash Raj:
On Random Number Generation for Kernel Applications. Fundam. Informaticae 185(4): 285-311 (2022) - Samson Abramsky:
Structure and Power: an Emerging Landscape. Fundam. Informaticae 186(1-4): 1-26 (2022) - Nicolas Amat, Bernard Berthomieu, Silvano Dal-Zilio:
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking. Fundam. Informaticae 187(2-4): 103-138 (2022) - André Arnold, Patrick Cégielski, Irène Guessarian:
Affine Completeness of Some Free Binary Algebras. Fundam. Informaticae 186(1-4): 27-44 (2022) - Sergei Artemov:
Towards Syntactic Epistemic Logic. Fundam. Informaticae 186(1-4): 45-62 (2022) - Arnon Avron, Nachum Dershowitz, Alexander Rabinovich:
Preface. Fundam. Informaticae 186(1-4) (2022) - Martin Baca, Andrea Semanicová-Fenovcíková, Ruei-Ting Lai, Tao-Ming Wang:
On Local Antimagic Vertex Coloring for Complete Full t-ary Trees. Fundam. Informaticae 185(2): 99-113 (2022) - David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys:
Cost Automata, Safe Schemes, and Downward Closures. Fundam. Informaticae 188(3): 127-178 (2022) - Paul C. Bell, Igor Potapov, Sylvain Schmitz, Patrick Totzke:
Preface. Fundam. Informaticae 189(3-4) (2022) - Alexis Bès, Christian Choffrut:
Decidability of Definability Issues in the Theory of Real Addition. Fundam. Informaticae 188(1): 15-39 (2022) - Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Gathering over Meeting Nodes in Infinite Grid*. Fundam. Informaticae 187(1): 1-30 (2022) - Alexander Bilgram, Peter Gjøl Jensen, Thomas Pedersen, Jirí Srba, Peter Haahr Taankvist:
Methods for Efficient Unfolding of Colored Petri Nets. Fundam. Informaticae 189(3-4): 297-320 (2022) - Benedikt Brütsch, Wolfgang Thomas:
Solving Infinite Games in the Baire Space. Fundam. Informaticae 186(1-4): 63-88 (2022) - Didier Buchs, Josep Carmona, Jetty Kleijn:
Preface. Fundam. Informaticae 187(2-4) (2022) - Matthew Ceko, Lajos Hajdu, Rob Tijdeman:
Error Correction for Discrete Tomography. Fundam. Informaticae 189(2): 91-112 (2022) - Davide Coluzzi, Giuseppe Baselli:
Diffuse and Localized Functional Dysconnectivity in Schizophrenia: a Bootstrapped Top-Down Approach. Fundam. Informaticae 189(2): 171-198 (2022) - Bruno Courcelle:
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity. Fundam. Informaticae 186(1-4): 89-120 (2022) - Bruno Courcelle:
Unfoldings and Coverings of Weighted Graphs. Fundam. Informaticae 189(1): 1-47 (2022) - Olivier Danvy:
Getting There and Back Again. Fundam. Informaticae 185(2): 115-183 (2022) - Raymond R. Devillers, Ronny Tredup:
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues. Fundam. Informaticae 187(2-4): 139-165 (2022) - Raymond R. Devillers, Ronny Tredup:
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues. Fundam. Informaticae 187(2-4): 167-196 (2022) - Raymond R. Devillers, Ronny Tredup:
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets. Fundam. Informaticae 189(3-4): 261-296 (2022)
skipping 3,835 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-04-25 11:48 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