Efficient string matching on packed texts
D. Breslauer, Leszek Gasieniec (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Space-efficient parallel merging”
Efficient string matching on packed texts
On schemata and systems for parallel algorithms
Georg Gati (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
Heidemarie Bräsel, Dagmar Kluge, Frank Werner (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A heuristic algorithm for the flowshop scheduling problem
Jatinder N. D. Gupta (1976)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Worst case analysis of two heuristics for the set partitioning problem
A. Marchetti Spaccamela, A. Pelaggi (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Implementing parallel elliptic solver on a Beowulf cluster.
Paprzycki, Marcin, Petrova, Svetozara, Sanchez, Julian (1999)
Electronic Journal of Differential Equations (EJDE) [electronic only]
Similarity:
Simulated annealing algorithm : technical improvements
D. Delamarre, B. Virot (1998)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: