par Connor, Thomas 
;Leemans, Dimitri
Référence Groups Complexity Cryptology, 5, 1, page (75-89)
Publication Publié, 2013
;Leemans, Dimitri Référence Groups Complexity Cryptology, 5, 1, page (75-89)
Publication Publié, 2013
Article révisé par les pairs
| Résumé : | We present a new algorithm to find apartments in coset geometries. It permits to obtain some missing results in a paper by Buekenhout and Leemans. We compare the performance of our algorithm to the one given by Buekenhout and Leemans. © de Gruyter 2013. |
