@article {14947,
	title = {An optimal randomized parallel algorithm for the single function coarsest partition problem},
	journal = {PPL-Parallel Processing Letters},
	volume = {6},
	year = {1996},
	month = {1996///},
	pages = {187 - 194},
	abstract = {We describe a randomized parallel algorithm to solve the single function coarsest partition problem. The algorithm runs in O(log n) time using O(n) operations with high probability on the Priority CRCW PRAM. The previous best known algorithms run in O(log2 n) time using O(n log2 n) operations on the CREW PRAM and O(log n) time using O(n log log n) operations on the Arbitrary CRCW PRAM. The technique presented can be used to generate the Euler tour of a rooted tree optimally from the parent representation.},
	doi = {10.1142/S0129626496000182},
	author = {JaJa, Joseph F. and Ryu,K. W.}
}
