default search action
"Reachability in parallel programs is polynomial in the number of threads."
Alexander Malkis (2022)
- Alexander Malkis:
Reachability in parallel programs is polynomial in the number of threads. J. Parallel Distributed Comput. 162: 1-16 (2022)
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.