On Greedy Algorithms for Binary de Bruijn Sequences

We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequences are particular cases of our new algorithm

THEMES IN MODERN AFRICAN HISTORY AND CULTURE Festschrift for Tekeste Negash

none2Modern African Historiography State and Society Reflection on Basis Themes in African Studies and MethodologiesopenLars Berge; Irma TaddiaLars Berge; Irma Taddi