Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFundamenta Informaticae, Volume 182
Volume 182, Number 1, 2021
- Jörg Keller, Wojciech Penczek
:
Preface. - Paolo Felli, Massimiliano de Leoni, Marco Montali:
Soundness Verification of Data-Aware Process Models with Variable-to-Variable Conditions. 1-29 - Étienne André, Emmanuel Coquard, Laurent Fribourg, Jawher Jerray, David Lesens:
Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints. 31-67 - Étienne André, Didier Lime, Mathias Ramparison, Mariëlle Stoelinga:
Parametric Analyses of Attack-fault Trees. 69-94
Volume 182, Number 2, 2021
- Dominik Slezak, Tzung-Pei Hong, Leon S. L. Wang:
Preface: Information Granulation in Data Science and Scalable Computing. - Linh Le, Ying Xie, Vijay Raghavan:
KNN Loss and Deep KNN. 95-110 - Zaineb Chelly Dagdia, Christine Zarges:
A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique. 111-179 - Shusaku Tsumoto, Shoji Hirano, Tomohiro Kimura, Haruko Iwata:
Mining Clinical Process from Hospital Information System: A Granular Computing Approach. 181-218
Volume 182, Number 3, 2021
- Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem:
Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. 219-242 - Yu Jin, Bosheng Song, Yanyan Li, Ying Zhu:
Time-free Solution to Independent Set Problem using P Systems with Active Membranes. 243-255 - Viet Dung Nguyen, Ba-Thai Pham, Phan-Thuan Do:
Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs. 257-283 - G. Jessy Sujana, T. M. Rajalaxmi, Indra Rajasingh, R. Sundara Rajan:
Edge Forcing in Butterfly Networks. 285-299 - Mohammad Reza Zarrabi, Nasrollah Moghaddam Charkari:
Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons. 301-319
Volume 182, Number 4, 2021
- Zhengwei Xie, Daowen Qiu, Guangya Cai, Jozef Gruska, Paulo Mateus:
Testing Boolean Functions Properties. 321-344 - Claude Sureson:
The Inverse of Ackermann Function is Computable in Linear Time. 345-361 - Joachim Wehler:
Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions. 363-393
a service of 
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.
last updated on 2024-06-18 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
