Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Reachability in parallel programs is polynomial in the number of threads."

Alexander Malkis (2022)

> Home

Details and statistics

DOI: 10.1016/J.JPDC.2021.11.008

access: closed

type: Journal Article

metadata version: 2023-06-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jpdc/Malkis22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/Malkis22
Alexander Malkis:
Reachability in parallel programs is polynomial in the number of threads. J. Parallel Distributed Comput. 162: 1-16 (2022)

a service of

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.