APA (7th ed.) Citation

Gazit, H. (1986, October). An optimal randomized parallel algorithm for finding connected components in a graph. 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), 492-501. https://doi.org/10.1109/SFCS.1986.9

Chicago Style (17th ed.) Citation

Gazit, Hillel. "An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph." 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) Oct. 1986: 492-501. https://doi.org/10.1109/SFCS.1986.9.

MLA (9th ed.) Citation

Gazit, Hillel. "An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph." 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), Oct. 1986, pp. 492-501, https://doi.org/10.1109/SFCS.1986.9.