Polychotomic Encoding: A Better Quasi-Optimal Bit-Vector Encoding of Tree Hierarchies
No abstract available.
DOI 10.1007/3-540-47993-7_23
Related papers
- A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests ECOOP 2001
- Poker: permutation-based SIMD execution of intensive tree search by path encoding CGO 2018
- Building Better Bit-Blasting for Floating-Point Problems TACAS 2019
- Dartagnan: Leveraging Compiler Optimizations and the Price of Precision (Competition Contribution) TACAS 2021
- Efficient Subtyping Tests with PQ-Encoding OOPSLA 2001
- Efficient subtyping tests with PQ-encoding TOPLAS 2005
- Automated synthesis of symbolic instruction encodings from I/O samples PLDI 2012
- On Parsing and Compiling Arithmetic Expressions on Vector Computers TOPLAS 1980