APA (7th ed.) Citation

Biran, O., Moran, S., & Zaks, S. (1991). Deciding 1-solvability of distributed tasks is NP-hard.

Chicago Style (17th ed.) Citation

Biran, Ofer, Shlomo Moran, and Shmuel Zaks. Deciding 1-solvability of Distributed Tasks Is NP-hard. Haifa, Israel, 1991.

MLA (9th ed.) Citation

Biran, Ofer, et al. Deciding 1-solvability of Distributed Tasks Is NP-hard. 1991.