scientific article; zbMATH DE number 7280020
From MaRDI portal
Publication:5137357
zbMath1448.68080MaRDI QIDQ5137357
Publication date: 2 December 2020
Full work available at URL: https://link.springer.com/article/10.1007/s004460050049
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (4)
Finding missing synchronization in a distributed computation using controlled re-execution ⋮ On the complexity of partial order trace model checking ⋮ Efficient model checking for LTL with partial order snapshots ⋮ Intractability results in predicate detection
This page was built for publication: