default search action
Fundamenta Informaticae, Volume 169
Volume 169, Numbers 1-2, 2019
- Victor Khomenko, Jetty Kleijn, Wojciech Penczek, Olivier H. Roux:
Preface. v-vi
- Raymond R. Devillers, Thomas Hujsa:
Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods. 1-30 - Ryszard Janicki, Maciej Koutny:
Operational Semantics, Interval Orders and Sequences of Antichains. 31-55 - Karsten Wolf:
Synthesis for Various Petri Net Classes with Union/Find. 57-84 - Rüdiger Valk:
Formal Properties of Petri's Cycloid Systems. 85-121 - Petr Jancar, Jérôme Leroux, Grégoire Sutre:
Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States. 123-150 - Wil M. P. van der Aalst:
Lucent Process Models and Translucent Event Logs. 151-177
Volume 169, Number 3, 2019
- Guillaume Feuillade, Andreas Herzig, Christos Rantsoudis:
A Dynamic Logic Account of Active Integrity Constraints. 179-210 - Pardis Kavand, Ali Mohades:
Geodesic Center of a Simple Polygon using a Logarithmic Number of Extra Variables. 211-235 - Bartosz Zielinski:
A Query Language Based on Term Matching and Rewriting. 237-274
Volume 169, Number 4, 2019
- Mieczyslaw Kula, Damian Niwinski, Jacek Pomykala:
Preface. i
- Robert Drylo, Jacek Pomykala:
Jacobians of Hyperelliptic Curves over ℤn and Factorization of n. 275-283 - Robert Drylo, Tomasz Kijko, Michal Wronski:
Determining Formulas Related to Point Compression on Alternative Models of Elliptic Curves. 285-294 - Lucjan Hanzlik, Kamil Kluczniak, Miroslaw Kutylowski:
CTRL-PACE: Controlled Randomness for e-Passport Password Authentication. 295-330 - Pawel Morawiecki:
Malicious SHA-3. 331-343 - Pavol Zajac:
Hybrid Encryption from McEliece Cryptosystem with Pseudo-random Error Vector. 345-360
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.