Parallel algorithms for listing well-formed parentheses strings

Parallel Processing Letters

Volumn 8, Issue 1, 1998, Pages 19-28

  Vajnovszki, Vincent ^a   Pallo, Jean ^a  

^a UNIVERSITÉ DE BOURGOGNE   (France)

Author keywords

Generating combinatorial objects; Parallel random access machine; Well formed parentheses strings

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; DATA STORAGE EQUIPMENT; GRAPHIC METHODS; PROBLEM SOLVING; PROGRAM PROCESSORS;

GENERATING COMBINATORIAL OBJECTS; PARALLEL RANDOM ACCESS MACHINES; SHARED MEMORY; WELL-FORMED PARENTHESES STRINGS;

COMPUTER SCIENCE;

EID: 0038854595     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626498000055     Document Type: Article

References (1)

1. S. G. Akl, Adaptive and optimal parallel algorithms for enumerating permutations and combinations, The Computer Journal, 30(5) (1987) 433-436.