E1. The paper proposes and analyzes several algorithms for neighbor discovery in wireless networks. It presents an ALOHA-like algorithm for when nodes cannot detect collisions and a receiver feedback-based algorithm when they can. E2. It then analyzes neighbor discovery in a multihop setting, establishing an upper bound on the running time of the ALOHA-like algorithm and a lower bound on the running time of any randomized algorithm. E3. The paper aims to develop algorithms that do not require nodes to know the number of neighbors or be synchronized, and that allow asynchronous starting and determine when to terminate discovery.