- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1619-1374
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Linear parallel algorithms to compute strong and branching bisimilarity ; day:6 ; month:12 ; year:2022 ; pages:1-25
Software and systems modeling ; (6.12.2022), 1-25
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10270-022-01060-7
- URN
-
urn:nbn:de:101:1-2023021621120625657607
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:59 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Martens, Jan
- Groote, Jan Friso
- Haak, Lars B. van den
- Hijma, Pieter
- Wijs, Anton
- SpringerLink (Online service)
Other Objects (12)
Signature-based algorithms to compute standard bases
Parallel visualization and compute environments for graphics clusters
Parallel parameterized algorithms
Algorithms for parallel processing
Foundations of parallel algorithms
Quantum algorithms to compute the neighbour list of N-body simulations
Parallel processing and parallel algorithms : theory and computation
New algorithms to compute the nearness symmetric solution of the matrix equation
Simple algorithms to compute meridional overturning and barotropic streamfunctions on unstructured meshes
Simple algorithms to compute meridional overturning and barotropic streamfunction on unstructured meshes
Memory-efficient low-compute segmentation algorithms for bladder-monitoring smart ultrasound devices
Work efficient parallel scheduling algorithms
Signature-based algorithms to compute standard bases
Parallel visualization and compute environments for graphics clusters
Parallel parameterized algorithms
Algorithms for parallel processing
Foundations of parallel algorithms
Quantum algorithms to compute the neighbour list of N-body simulations
Parallel processing and parallel algorithms : theory and computation
New algorithms to compute the nearness symmetric solution of the matrix equation
Simple algorithms to compute meridional overturning and barotropic streamfunctions on unstructured meshes
Simple algorithms to compute meridional overturning and barotropic streamfunction on unstructured meshes
Memory-efficient low-compute segmentation algorithms for bladder-monitoring smart ultrasound devices
Work efficient parallel scheduling algorithms
Signature-based algorithms to compute standard bases
Parallel visualization and compute environments for graphics clusters
Parallel parameterized algorithms
Algorithms for parallel processing
Foundations of parallel algorithms
Quantum algorithms to compute the neighbour list of N-body simulations
Parallel processing and parallel algorithms : theory and computation
New algorithms to compute the nearness symmetric solution of the matrix equation
Simple algorithms to compute meridional overturning and barotropic streamfunctions on unstructured meshes
Simple algorithms to compute meridional overturning and barotropic streamfunction on unstructured meshes
Memory-efficient low-compute segmentation algorithms for bladder-monitoring smart ultrasound devices