Performance and evaluation of LISP systems
Performance and evaluation of LISP systems
Efficient implementation of bit-vector operation in Common Lisp
ACM SIGPLAN Lisp Pointers
Tabulation Techniques for Recursive Programs
ACM Computing Surveys (CSUR)
Computer Algorithms: Introduction to Design and Analysis
Computer Algorithms: Introduction to Design and Analysis
Common Lisp: The Language
LUV '94 Papers of the fourth international conference on LISP users and vendors
| Hi-index | 0.00 |
We show how Baskett's "Puzzle" benchmark can be speeded up at least an order of magnitude by utilizing bit-vectors. Unlike many optimization techniques, the use of bit-vectors enhances the readability and understandability of the code. Since bit-vectors already utilize word-wide parallelism, it is unlikely that parallel processors will be able to solve the problem much faster.