Parallel Construction of Suffix Trees and the All-Nearest-Smaller-Values Problem

Article Details
Title:	Parallel Construction of Suffix Trees and the All-Nearest-Smaller-Values Problem
Article URLs:	https://doi.org/10.1109/IPDPS.2017.62 http://doi.ieeecomputersociety.org/10.1109/IPDPS.2017.62
Alternative Article URLs:
Authors:	Patrick Flick	Georgia Institute of Technology
Authors:	Srinivas Aluru	Georgia Institute of Technology
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:	https://github.com/parbliss/psac
Artifact Correspondence Email Addresses:
NSF Award Numbers:	1360593, 1416259
DBLP Key:	conf/ipps/FlickA17
Author Comments:

IEEE Intl. Parallel and Distributed Processing Symposium, IPDPS 2017