Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions

Annual Symposium on Foundatons of Computer Science (Proceedings)

Volumn , Issue , 1993, Pages 248-258

  Cole, Richard ^a   Crochemore, Maxime ^a   Galil, Zvi ^a   Gasieniec, Leszek ^a   Hariharan, Ramesh ^a   Muthukrishnan, S ^a   Park, Kunsoo ^a   Rytter, Wojciech ^a  

^a NYU

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA PROCESSING; DATA STRUCTURES; OPTIMAL SYSTEMS; PARALLEL PROCESSING SYSTEMS; PATTERN RECOGNITION; PROBABILITY;

LAS VEGAS ALGORITHM; PARALLEL ALGORITHMS; PARALLEL RANDOM ACCESS MACHINE (PRAM); STRING MATCHING;

ALGORITHMS;

EID: 0027800807     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)