5 papers:
LATA-2015-BachmeierLS #automaton #complexity #finite- Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (GB, ML, MS), pp. 473–485.
DATE-2014-KimH #automation #generative #parallel- Automatic generation of custom SIMD instructions for Superword Level Parallelism (TK, YH), pp. 1–6.
PLDI-2012-LiuZJDK #compilation #framework #parallel- A compiler framework for extracting superword level parallelism (JL, YZ, OJ, WD, MTK), pp. 347–358.
CGO-2005-ShinHC #control flow #parallel- Superword-Level Parallelism in the Presence of Control Flow (JS, MWH, JC), pp. 165–175.
- PLDI-2000-LarsenA #parallel #set
- Exploiting superword level parallelism with multimedia instruction sets (SL, SPA), pp. 145–156.
