![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.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 19 matches
- 2010
- Frans van den Bergh, Andries Petrus Engelbrecht
:
A Convergence Proof for the Particle Swarm Optimiser. Fundam. Informaticae 105(4): 341-374 (2010) - Luca Bernardinello, Lucia Pomello, Stefania Rombolà:
Closure Operators and Lattices Derived from Concurrency in Posets and Occurrence Nets. Fundam. Informaticae 105(3): 211-235 (2010) - Stefano Bistarelli
, Giorgio Gosti
:
Solving Distributed CSPs Probabilistically. Fundam. Informaticae 105(1-2): 57-78 (2010) - Dario Campagna, Christian De Rosa, Agostino Dovier
, Angelo Montanari, Carla Piazza
:
Morphos Configuration Engine: the Core of a Commercial Configuration System in CLP(FD). Fundam. Informaticae 105(1-2): 105-133 (2010) - Federico Chesani, Paola Mello, Marco Montali
, Paolo Torroni
:
A Logic-Based, Reactive Calculus of Events. Fundam. Informaticae 105(1-2): 135-161 (2010) - Stefania Costantini
, Andrea Formisano
, Davide Petturiti
:
Extending and Implementing RASP. Fundam. Informaticae 105(1-2): 1-33 (2010) - Agostino Dovier
, Andrea Formisano
, Enrico Pontelli
:
An Investigation of Multi-Agent Planning in CLP. Fundam. Informaticae 105(1-2): 79-103 (2010) - Marco Faella, Margherita Napoli
, Mimmo Parente
:
Graded Alternating-Time Temporal Logic. Fundam. Informaticae 105(1-2): 189-210 (2010) - Giuliana Franceschinis, Wojciech Penczek
, Karsten Wolf:
Preface. Fundam. Informaticae 105(3) (2010) - Marco Gavanelli
, Fabrizio Riguzzi
, Alberto Pettorossi
:
Preface. Fundam. Informaticae 105(1-2) (2010) - Fatemeh Ghassemi, Wan J. Fokkink
, Ali Movaghar
:
Equational Reasoning on Mobile Ad Hoc Networks. Fundam. Informaticae 105(4): 375-415 (2010) - Hayk A. Grigoryan, Arsen S. Shoukourian:
Equivalence of Processes in Partially Commutative Object-Oriented Environments. Fundam. Informaticae 105(4): 417-434 (2010) - Tayeb Kenaza, Karim Tabia, Salem Benferhat:
On the Use of Naive Bayesian Classifiers for Detecting Elementary and Coordinated Attacks. Fundam. Informaticae 105(4): 435-466 (2010) - Jean Mairesse, Hoang-Thach Nguyen:
Deficiency Zero Petri Nets and Product Form. Fundam. Informaticae 105(3): 237-261 (2010) - Enrica Nicolini, Christophe Ringeissen, Michaël Rusinowitch:
Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator. Fundam. Informaticae 105(1-2): 163-187 (2010) - Mateus de Oliveira Oliveira
:
Hasse Diagram Generators and Petri Nets. Fundam. Informaticae 105(3): 263-289 (2010) - Francesco Ricca, Antonella Dimasi, Giovanni Grasso
, Salvatore Maria Ielpa, Salvatore Iiritano, Marco Manna
, Nicola Leone
:
A Logic-Based System for e-Tourism. Fundam. Informaticae 105(1-2): 35-55 (2010) - Antti Valmari:
Simple Bisimilarity Minimization in O(m log n) Time. Fundam. Informaticae 105(3): 319-339 (2010) - Fernando Rosa-Velardo
, David de Frutos-Escrig
:
Decidability Problems in Petri Nets with Names and Replication. Fundam. Informaticae 105(3): 291-317 (2010)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.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-02 11:22 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