The Cohortes Augustae Cyrenaicae
Journal of African Archaeology
107 - 121
Item Usage Stats
MetadataShow full item record
The auxiliary regiments of the Imperial Roman army were as vital to the defensive and offensive capabilities of the Roman Empire as the better-known Roman legions. Initially raised on an ethnic basis through the levy from among Rome 's subject peoples, and then maintained at or near their full strength by conscription and voluntary recruitment, these units of auxilia were often deployed far from their original ' home As such, by analysing where these units were recruited and in what numbers, and then studying their subsequent history and deployment, it is possible to begin an assessment of their full value to Rome and to better comprehend overall developments in Roman strategic thinking. This paper contributes to such an appraisal by reviewing the evidence for the history and deployment of the three cohortes Augustae Cyrenaicae, among the least well-known auxiliary units in the entire Roman army.
KeywordsAuxiliary unit deployment
Auxiliary unit history
Auxiliary unit names
Auxiliary unit recruitment
Roman auxiliary cohorts
Published Version (Please cite this version)http://dx.doi.org/10.3213/1612-1651-10127
Showing items related by title, author, creator and subject.
Yönet, Yağmur Öykü (Bilkent University, 2019-06)Günümüz dünyasında ekonomik ve sosyal konjonktür borçluları yardımcı kişilere başvurmaya zorlamaktadır. Tezin çalışma alanı Türk Borçlar Kanunu’nun 116. maddesinde düzenlenmiş olan yardımcı kişinin fiillerinden sorumluluk ...
Bennett, J. (Netherlands Institute for the Near East, 2011)Knowing the recruitment patterns and the areas of service for the auxilia, the auxiliary units of the Roman Imperial Army, helps us better understand overall developments in Roman strategic thinking. In this regard the ...
Ileri, Atalay Mert; Külekci, M.O.; Xu, B. (Springer, Cham, 2014)We revisit the problem of finding shortest unique substring (SUS) proposed recently by Pei et al. (ICDE'13). We propose an optimal O(n) time and space algorithm that can find an SUS for every location of a string of size ...