Pandey et al (2017) A Fast x86 Implementation of Select

The paper tries to solve the problem of SELECT and RANK: SELECT is to find the -th asserted bit in a bit vector and RANK is to find the total number of asserted bits in the -bit prefix of the bit vector. For example, if the bit vector is 100101001010... [more]

Lamport et al (1982) The Byzantine Generals Problem

About fault tolerance in a distributed system. Using the metaphor of a number of Byzantine generals have to come to a consensus of action, while the communication may not be accurate. For example, the sender of a message may be a traitor such that the message may be different to... [more]