---
res:
  bibo_abstract:
  - We provide algorithms to count and enumerate representatives of the (right) ideal
    classes of an Eichler order in a quaternion algebra defined over a number field.
    We analyze the run time of these algorithms and consider several related problems,
    including the computation of two-sided ideal classes, isomorphism classes of orders,
    connecting ideals for orders, and ideal principalization. We conclude by giving
    the complete list of definite Eichler orders with class number at most 2.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Markus
      foaf_name: Kirschmer, Markus
      foaf_surname: Kirschmer
      foaf_workInfoHomepage: http://www.librecat.org/personId=82258
  - foaf_Person:
      foaf_givenName: John
      foaf_name: Voight, John
      foaf_surname: Voight
  bibo_doi: 10.1137/080734467
  bibo_issue: '5'
  bibo_volume: 39
  dct_date: 2010^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0097-5397
  - http://id.crossref.org/issn/1095-7111
  dct_language: eng
  dct_publisher: Society for Industrial & Applied Mathematics (SIAM)@
  dct_subject:
  - General Mathematics
  - General Computer Science
  dct_title: Algorithmic Enumeration of Ideal Classes for Quaternion Orders@
...