ISSN Portal
The Keepers Registry (preservation)
SHERPA/RoMEO (access policies)
Logical Methods in Computer Science
container_c67srop7pbe3nciquoxzy3d6pm
Published by Logical Methods in Computer Science
Search Releases from this Container
Example Publications
Efficient and Modular Coalgebraic Partition Refinement
Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder
2020
|
Logical Methods in Computer Science
doi:10.23638/lmcs-16(1:8)2020
Representing Dependencies in Event Structures
G. Michele Pinna
2019
|
Logical Methods in Computer Science
doi:10.23638/lmcs-16(2:3)2020
Synthesis of Orchestrations and Choreographies: Bridging the Gap between Supervisory Control and Coordination of Services
Davide Basile, Maurice H. ter Beek, Rosario Pugliese
2019
|
Logical Methods in Computer Science
doi:10.23638/lmcs-16(2:9)2020
Minimization of visibly pushdown automata is NP-complete
Olivier Gauwin, Anca Muscholl, Michael Raskin
2019
|
Logical Methods in Computer Science
doi:10.23638/lmcs-16(1:14)2020
Tight Polynomial Worst-Case Bounds for Loop Programs
Amir M. Ben-Amram, Geoff Hamilton
2019
|
Logical Methods in Computer Science
doi:10.23638/lmcs-16(2:4)2020
Open Access Publication
773
Known Releases
Preservation Status
| 752 | preserved and accessble (bright) | |
| 0 | preserved, inaccessible (dark) | |
| 21 | no known preservation |
Work Types
article-journal
| 773 |
Lookup Links
Fatcat Bits
State is "active".
Revision:
84fadc3c-a3e1-46ed-b316-467d4ec32829
As JSON object via API