Impressum manualbib.xml Sprache: XML

# <?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE file SYSTEM "bibxmlext.dtd" >

<file>

<string key="actam3" value="Acta Appl. Math."/>
<string key="actcs1" value="Acta Cryst. Sect. A"/>
<string key="advam4" value="Adv. Math."/>
<string key="amemm" value="Amer. Math. Monthly"/>
<string key="appae" value="Appl. Algebra Engrg. Comm. Comput."/>
<string key="arcmb1" value="Arch. Math. (Basel)"/>
<string key="bayms" value="Bayreuth. Math. Schr."/>
<string key="bulam2" value="Bull. Austral. Math. Soc."/>
<string key="cjtcs" value="Chicago J. Theoret. Comput. Sci."/>
<string key="comma2" value="Comm. Algebra"/>
<string key="compo" value="Compositio Math."/>
<string key="discm" value="Discrete Math."/>
<string key="eraam" value="Electron. Res. Announc. Amer. Math. Soc."/>
<string key="expma" value="Experiment. Math."/>
<string key="glamj" value="Glasgow Math. J."/>
<string key="intjac" value="Internat. J. Algebra Comput."/>
<string key="invem" value="Invent. Math."/>
<string key="jalge" value="J. Algebra"/>
<string key="jausma" value="J. Austral. Math. Soc. Ser. A"/>
<string key="jnumt" value="J. Number Theory"/>
<string key="jreia" value="J. Reine Angew. Math."/>
<string key="jsymc" value="J. Symbolic Comput."/>
<string key="linaa2" value="Linear Algebra Appl."/>
<string key="match" value="Match"/>
<string key="matha" value="Math. Ann."/>
<string key="matha2" value="Math. Appl."/>
<string key="matha2" value="Math. Appl."/>
<string key="mathc3" value="Math. Comp."/>
<string key="mathz" value="Math. Z."/>
<string key="matpc" value="Math. Proc. Cambridge Philos. Soc."/>
<string key="memam" value="Mem. Amer. Math. Soc."/>
<string key="numem" value="Numer. Math."/>
<string key="pacjm" value="Pacific J. Math."/>
<string key="proem2" value="Proc. Edinburgh Math. Soc. (2)"/>
<string key="prolm2" value="Proc. London Math. Soc. (3)"/>
<string key="quajm3" value="Quart. J. Math. Oxford Ser. (2)"/>
<string key="rocmj" value="Rocky Mountain J. Math."/>
<string key="traam" value="Trans. Amer. Math. Soc."/>


<entry id="Abb89"><phdthesis>
  <author>
    <name><first>J. A.</first><last>Abbott</last></name>
  </author>
  <title>On  the  Factorization  of  Polynomials over Algebraic
                      Fields</title>
  <school>School of Mathematical Sciences, University of Bath</school>
  <year>1989</year>
  <month>September</month>
</phdthesis></entry>

<entry id="AL94"><article>
  <author>
    <name><first>Dean</first><last>Alvis</last></name>
    <name><first>George</first><last>Lusztig</last></name>
  </author>
  <title>Correction to the paper: <C>T</C>he representations and generic
  degrees of the <C>H</C>ecke algebra of type <C><M>H_4</M></C> [<C>J</C>.
  <C>R</C>eine <C>A</C>ngew. <C>M</C>ath.
  <C><Alt Only="BibTeX,BibTeXhref">\bf </Alt>336</C> (1982), 201–212;
              <C>MR</C>0671329 (84a:20013)]</title>
  <journal><value key="jreia"/></journal>
  <year>1994</year>
  <volume>449</volume>
  <pages>217–218</pages>
  <note>Correction:  ibid. <Alt Only="BibTeX,BibTeXhref">\bf </Alt> 449,
         217–218 (1994)</note>
  <crossref>AL82</crossref>
  <issn>0075-4102</issn>
  <mrnumber>1268587 (95a:20005)</mrnumber>
  <mrclass>20C15</mrclass>
  <mrreviewer>Bhama Srinivasan</mrreviewer>
  <other type="coden">JRMAA8</other>
  <other type="fjournal">Journal für die Reine und Angewandte
      Mathematik</other>
</article></entry>

<entry id="AL82"><article>
  <author>
    <name><first>Dean</first><last>Alvis</last></name>
    <name><first>George</first><last>Lusztig</last></name>
  </author>
  <title>The representations and generic degrees of the <C>H</C>ecke algebra
              of type <C><M>H_4</M></C></title>
  <journal><value key="jreia"/></journal>
  <year>1982</year>
  <volume>336</volume>
  <pages>201–212</pages>
  <note>Correction:  ibid. <Alt Only="BibTeX,BibTeXhref">\bf </Alt> 449,
       217–218 (1994)</note>
  <crossref>AL94</crossref>
  <issn>0075-4102</issn>
  <mrnumber>671329 (84a:20013)</mrnumber>
  <mrclass>20C15</mrclass>
  <mrreviewer>Bhama Srinivasan</mrreviewer>
  <other type="coden">JRMAA8</other>
  <other type="fjournal">Journal für die Reine und Angewandte
      Mathematik</other>
</article></entry>

<entry id="Alv87"><article>
  <author>
    <name><first>Dean</first><last>Alvis</last></name>
  </author>
  <title>The left cells of the <C>C</C>oxeter group of type
      <C><M>H_4</M></C></title>
  <journal><value key="jalge"/></journal>
  <year>1987</year>
  <volume>107</volume>
  <number>1</number>
  <pages>160–168</pages>
  <issn>0021-8693</issn>
  <mrnumber>883878 (88d:20014)</mrnumber>
  <mrclass>20C15 (20C30 20H15)</mrclass>
  <mrreviewer>Bhama Srinivasan</mrreviewer>
  <other type="coden">JALGA4</other>
  <other type="fjournal">Journal of Algebra</other>
</article></entry>

<entry id="AMW82"><incollection>
  <author>
    <name><first>D. G.</first><last>Arrell</last></name>
    <name><first>S.</first><last>Manrai</last></name>
    <name><first>M. F.</first><last>Worboys</last></name>
  </author>
  <title>A procedure for obtaining simplified defining relations for a
              subgroup</title>
  <booktitle>Groups–St Andrews 1981 (St Andrews, 1981)</booktitle>
  <publisher>Cambridge Univ. Press</publisher>
  <year>1982</year>
  <editor>
    <name><first>Colin M.</first><last>Campbell</last></name>
    <name><first>Edmund F.</first><last>Robertson</last></name>
  </editor>
  <volume>71</volume>
  <series>London Math. Soc. Lecture Note Ser.</series>
  <pages>155–159</pages>
  <address>Cambridge</address>
  <crossref>GrpsStAndrews81</crossref>
  <isbn>0-521-28974-2</isbn>
  <keywords>finitely   presented  groups;  subgroup  presentation,
                      simplification;  modified  Todd  Coxeter  (mtc),  tree
                      decoding; algorithm description</keywords>
  <mrnumber>679157 (84a:20041)</mrnumber>
  <mrclass>20F05 (20-04)</mrclass>
</incollection></entry>

<entry id="AR84"><incollection>
  <author>
    <name><first>D. G.</first><last>Arrell</last></name>
    <name><first>E. F.</first><last>Robertson</last></name>
  </author>
  <title>A modified <C>T</C>odd-<C>C</C>oxeter algorithm</title>
  <booktitle>Computational group theory (Durham, 1982)</booktitle>
  <publisher>Academic Press</publisher>
  <year>1984</year>
  <editor>
    <name><first>Michael D.</first><last>Atkinson</last></name>
  </editor>
  <pages>27–32</pages>
  <address>London</address>
  <crossref>Durham1982</crossref>
  <isbn>0-12-066270-1</isbn>
  <keywords>finitely   presented  groups;  subgroup  presentation,
                      simplification;  modified  Todd  Coxeter  (mtc),  tree
                      decoding; algorithm description</keywords>
  <mrnumber>760644 (86g:20042)</mrnumber>
  <mrclass>20F05 (20-04)</mrclass>
  <mrreviewer>I. D. Macdonald</mrreviewer>
</incollection></entry>

<entry id="Art68"><book>
  <author>
    <name><first>E.</first><last>Artin</last></name>
  </author>
  <title>Galoissche <C>T</C>heorie</title>
  <publisher>Verlag Harri Deutsch</publisher>
  <year>1973</year>
  <address>Zurich</address>
  <note>Übersetzung nach der zweiten englischen Auflage besorgt von
              Viktor Ziegler,
              Mit einem Anhang von N. A. Milgram,
              Zweite, unveränderte Auflage,
              Deutsch-Taschenbücher, No. 21</note>
  <mrnumber>0392905 (52 #13718)</mrnumber>
  <mrclass>12-02</mrclass>
  <other type="pages">86</other>
</book></entry>

<entry id="Bau91"><phdthesis>
  <author>
    <name><first>Ulrich</first><last>Baum</last></name>
  </author>
  <title>Existenz   und   effiziente  <C>K</C>onstruktion  schneller
                      <C>F</C>ouriertransformationen
                      überauflösbarer <C>G</C>ruppen</title>
  <school>Rheinische  Friedrich  Wilhelm Universität
                      Bonn</school>
  <year>1991</year>
  <type>Dissertation</type>
  <address>Bonn, Germany</address>
</phdthesis></entry>

<entry id="BC94"><article>
  <author>
    <name><first>Ulrich</first><last>Baum</last></name>
    <name><first>Michael</first><last>Clausen</last></name>
  </author>
  <title>Computing irreducible representations of supersolvable groups</title>
  <journal><value key="mathc3"/></journal>
  <year>1994</year>
  <volume>63</volume>
  <number>207</number>
  <pages>351–359</pages>
  <issn>0025-5718</issn>
  <mrnumber>1226811 (94i:20029)</mrnumber>
  <mrclass>20C40 (20C15 68Q40)</mrclass>
  <mrreviewer>Wolfgang Lempken</mrreviewer>
  <other type="coden">MCMPAF</other>
  <other type="fjournal">Mathematics of Computation</other>
</article></entry>

<entry id="BCFS91"><inproceedings>
  <author>
    <name><first>László</first><last>Babai</last></name>
    <name><first>Gene</first><last>Cooperman</last></name>
    <name><first>Larry</first><last>Finkelstein</last></name>
    <name><first>Ákos</first><last>Seress</last></name>
  </author>
  <title>Nearly  Linear  Time Algorithms for Permutation Groups
                      with a Small Base</title>
  <booktitle>Proceedings of the International Symposium on Symbolic
  and Algebraic Computation (ISSAC'91), Bonn 1991
  <year>1991</year>
  <pages>200–209</pages>
  <publisher>ACM Press</publisher>
  <crossref>ISSAC91</crossref>
</inproceedings></entry>

<entry id="BC76"><article>
  <author>
    <name><first>M. J.</first><last>Beetham</last></name>
    <name><first>C. M.</first><last>Campbell</last></name>
  </author>
  <title>A note on the <C>T</C>odd-<C>C</C>oxeter coset enumeration
      algorithm</title>
  <journal><value key="proem2"/></journal>
  <year>1976</year>
  <volume>20</volume>
  <number>1</number>
  <pages>73–79</pages>
  <issn>0013-0915</issn>
  <keywords>finitely   presented  groups;  subgroup  presentation;
  modified Todd Coxeter (mtc); algorithm description</keywords>
  <mrnumber>0399265 (53 #3116)</mrnumber>
  <mrclass>20F05</mrclass>
  <mrreviewer>D. L. Johnson</mrreviewer>
  <other type="fjournal">Proceedings of the Edinburgh Mathematical Society.
      Series II</other>
</article></entry>

<entry id="Ben76"><article>
  <author>
    <name><first>Mark</first><last>Benard</last></name>
  </author>
  <title>Schur indices and splitting fields of the unitary reflection
              groups</title>
  <journal><value key="jalge"/></journal>
  <year>1976</year>
  <volume>38</volume>
  <number>2</number>
  <pages>318–342</pages>
  <issn>0021-8693</issn>
  <mrnumber>0401901 (53 #5727)</mrnumber>
  <mrclass>20C30</mrclass>
  <mrreviewer>Larry C. Grove</mrreviewer>
  <other type="fjournal">Journal of Algebra</other>
</article></entry>

<entry id="BC72"><article>
  <author>
    <name><first>C. T.</first><last>Benson</last></name>
    <name><first>C. W.</first><last>Curtis</last></name>
  </author>
  <title>On the degrees and rationality of certain characters of finite
              <C>C</C>hevalley groups</title>
  <journal><value key="traam"/></journal>
  <year>1972</year>
  <volume>165</volume>
  <pages>251–273</pages>
  <issn>0002-9947</issn>
  <mrnumber>0304473 (46 #3608)</mrnumber>
  <mrclass>20C30</mrclass>
  <mrreviewer>A. Dress</mrreviewer>
  <other type="fjournal">Transactions of the American Mathematical
      Society</other>
</article></entry>

<entry id="Ber76"><article>
  <author>
    <name><first>T. R.</first><last>Berger</last></name>
  </author>
  <title>Characters and derived length in groups of odd order</title>
  <journal><value key="jalge"/></journal>
  <year>1976</year>
  <volume>39</volume>
  <number>1</number>
  <pages>199–207</pages>
  <issn>0021-8693</issn>
  <mrnumber>0396729 (53 #590)</mrnumber>
  <mrclass>20C15</mrclass>
  <mrreviewer>I. M. Isaacs</mrreviewer>
  <other type="fjournal">Journal of Algebra</other>
</article></entry>

<entry id="Besche92"><mastersthesis>
  <author>
    <name><first>Hans Ulrich</first><last>Besche</last></name>
  </author>
  <title>Die    <C>B</C>erechnung    von    <C>C</C>haraktergraden    und
                      <C>C</C>harakteren   endlicher   auflösbarer
  <C>G</C>ruppen im <C>C</C>omputeralgebrasystem <C>GAP</C></title>
  <school>Lehrstuhl   D   für  Mathematik,
                      Rheinisch               Westfälische
                      Technische Hochschule</school>
  <year>1992</year>
  <type>Diplomarbeit</type>
  <address>Aachen, Germany</address>
</mastersthesis></entry>

<entry id="BescheEick98"><article>
  <author>
    <name><first>Hans Ulrich</first><last>Besche</last></name>
    <name><first>Bettina</first><last>Eick</last></name>
  </author>
  <title>Construction of finite groups</title>
  <journal><value key="jsymc"/></journal>
  <year>1999</year>
  <volume>27</volume>
  <number>4</number>
  <pages>387–404</pages>
  <issn>0747-7171</issn>
  <mrnumber>1681346 (2000c:20001)</mrnumber>
  <mrclass>20-04 (20D05 20D10)</mrclass>
  <mrreviewer>Eamonn A. O'Brien
  <other type="fjournal">Journal of Symbolic Computation</other>
</article></entry>

<entry id="BescheEick1000"><article>
  <author>
    <name><first>Hans Ulrich</first><last>Besche</last></name>
    <name><first>Bettina</first><last>Eick</last></name>
  </author>
  <title>The groups of order at most 1000 except 512 and 768</title>
  <journal><value key="jsymc"/></journal>
  <year>1999</year>
  <volume>27</volume>
  <number>4</number>
  <pages>405–413</pages>
  <issn>0747-7171</issn>
  <mrnumber>1681347 (2000c:20002)</mrnumber>
  <mrclass>20-04 (20D05 20D10)</mrclass>
  <mrreviewer>Eamonn A. O'Brien
  <other type="fjournal">Journal of Symbolic Computation</other>
</article></entry>

<entry id="BescheEick768"><article>
  <author>
    <name><first>Hans Ulrich</first><last>Besche</last></name>
    <name><first>Bettina</first><last>Eick</last></name>
  </author>
  <title>The groups of order <C><M>q^n \cdot p</M></C></title>
  <journal><value key="comma2"/></journal>
  <year>2001</year>
  <volume>29</volume>
  <number>4</number>
  <pages>1759–1772</pages>
  <issn>0092-7872</issn>
  <mrnumber>1853124 (2002f:20028)</mrnumber>
  <mrclass>20D60</mrclass>
  <other type="coden">COALDM</other>
  <other type="fjournal">Communications in Algebra</other>
</article></entry>

<entry id="BEO00"><article>
  <author>
    <name><first>Hans Ulrich</first><last>Besche</last></name>
    <name><first>Bettina</first><last>Eick</last></name>
    <name><first>E. A.</first><last>O'Brien
  </author>
  <title>The groups of order at most 2000</title>
  <journal><value key="eraam"/></journal>
  <year>2001</year>
  <volume>7</volume>
  <pages>1–4 (electronic)</pages>
  <issn>1079-6762</issn>
  <mrnumber>1826989</mrnumber>
  <mrclass>20D60</mrclass>
  <other type="fjournal">Electronic Research Announcements of the American
      Mathematical
              Society</other>
</article></entry>

<entry id="BEO01"><article>
  <author>
    <name><first>Hans Ulrich</first><last>Besche</last></name>
    <name><first>Bettina</first><last>Eick</last></name>
    <name><first>E. A.</first><last>O'Brien
  </author>
  <title>A millennium project: constructing small groups</title>
  <journal><value key="intjac"/></journal>
  <year>2002</year>
  <volume>12</volume>
  <number>5</number>
  <pages>623–644</pages>
  <issn>0218-1967</issn>
  <mrnumber>1935567 (2003h:20042)</mrnumber>
  <mrclass>20D99</mrclass>
  <mrreviewer>Robert M. Guralnick</mrreviewer>
  <other type="fjournal">International Journal of Algebra and
      Computation</other>
</article></entry>

<entry id="BFS79"><article>
  <author>
    <name><first>F. Rudolf</first><last>Beyl</last></name>
    <name><first>Ulrich</first><last>Felgner</last></name>
    <name><first>Peter</first><last>Schmid</last></name>
  </author>
  <title>On groups occurring as center factor groups</title>
  <journal><value key="jalge"/></journal>
  <year>1979</year>
  <volume>61</volume>
  <number>1</number>
  <pages>161–177</pages>
  <issn>0021-8693</issn>
  <mrnumber>554857 (81i:20034)</mrnumber>
  <mrclass>20E22</mrclass>
  <mrreviewer>Richard E. Phillips</mrreviewer>
  <other type="coden">JALGA4</other>
  <other type="fjournal">Journal of Algebra</other>
</article></entry>

<entry id="EOB99"><article>
  <author>
    <name><first>Bettina</first><last>Eick</last></name>
    <name><first>E. A.</first><last>O'Brien
  </author>
  <title>Enumerating <C><M>p</M></C>-groups</title>
  <journal><value key="jausma"/></journal>
  <year>1999</year>
  <volume>67</volume>
  <number>2</number>
  <pages>191–205</pages>
  <note>Group theory</note>
  <issn>0263-6115</issn>
  <mrnumber>1717413 (2000h:20033)</mrnumber>
  <mrclass>20D15 (20J05)</mrclass>
  <mrreviewer>Phạm Anh Minh</mrreviewer>
  <other type="coden">JAMADS</other>
  <other type="fjournal">Australian Mathematical Society. Journal. Series A.
      Pure Mathematics and Statistics</other>
</article></entry>

<entry id="EOB98"><incollection>
  <author>
    <name><first>Bettina</first><last>Eick</last></name>
    <name><first>E. A.</first><last>O'Brien
  </author>
  <title>The groups of order <C><M>512</M></C></title>
  <booktitle>Algorithmic algebra and number theory (Heidelberg,
      1997)</booktitle>
  <publisher>Springer</publisher>
  <year>1999</year>
  <editor>
    <name><first>B. H.</first><last>Matzat</last></name>
    <name><first>G.-M.</first><last>Greuel</last></name>
    <name><first>G.</first><last>Hiss</last></name>
  </editor>
  <pages>379–380</pages>
  <address>Berlin</address>
  <note>Proceedings  of Abschlusstagung des DFG Schwerpunktes
  Algorithmische Algebra und Zahlentheorie in Heidelberg</note>
  <mrnumber>1672078 (99m:20034)</mrnumber>
  <mrclass>20D15</mrclass>
</incollection></entry>

<entry id="NOV04"><article>
  <author>
    <name><first>M. F.</first><last>Newman</last></name>
    <name><first>E. A.</first><last>O'Brien
    <name><first>M. R.</first><last>Vaughan-Lee</last></name>
  </author>
  <title>Groups and nilpotent <C>L</C>ie rings whose order is the sixth
              power of a prime</title>
  <journal><value key="jalge"/></journal>
  <year>2004</year>
  <volume>278</volume>
  <number>1</number>
  <pages>383–401</pages>
  <issn>0021-8693</issn>
  <mrnumber>2068084 (2005c:20034)</mrnumber>
  <mrclass>20D15 (17B30)</mrclass>
  <mrreviewer>Jeffrey M. Riedl</mrreviewer>
  <other type="coden">JALGA4</other>
  <other type="fjournal">Journal of Algebra</other>
</article></entry>

<entry id="OV05"><article>
  <author>
    <name><first>E. A.</first><last>O'Brien
    <name><first>M. R.</first><last>Vaughan-Lee</last></name>
  </author>
  <title>The groups with order <M>p^7</M> for odd prime <M>p</M></title>
  <journal><value key="jalge"/></journal>
  <year>2005</year>
  <volume>292</volume>
  <number>1</number>
  <pages>243–258</pages>
  <issn>0021-8693</issn>
  <mrnumber>2166803 (2006d:20038)</mrnumber>
  <mrclass>20D15 (17B30)</mrclass>
  <other type="coden">JALGA4</other>
  <other type="fjournal">Journal of Algebra</other>
</article></entry>

<entry id="Gir03"><mastersthesis>
  <author>
    <name><first>Boris</first><last>Girnat</last></name>
  </author>
  <title><C>K</C>lassifikation der <C>G</C>ruppen bis zur <C>O</C>rdnung
      <C><M>p^5</M></C></title>
  <school>TU Braunschweig</school>
  <year>2003</year>
  <type>Staatsexamensarbeit</type>
  <address>Braunschweig, Germany</address>
</mastersthesis></entry>

<entry id="DEi05"><article>
  <author>
    <name><first>Heiko</first><last>Dietrich</last></name>
    <name><first>Bettina</first><last>Eick</last></name>
  </author>
  <title>On the groups of cube-free order</title>
  <journal><value key="jalge"/></journal>
  <year>2005</year>
  <volume>292</volume>
  <number>1</number>
  <pages>122–137</pages>
  <issn>0021-8693</issn>
  <mrnumber>2166799 (2006g:20001)</mrnumber>
  <mrclass>20-04 (20D06 20D10)</mrclass>
  <mrreviewer>Eamonn A. O'Brien
  <other type="coden">JALGA4</other>
  <other type="fjournal">Journal of Algebra</other>
</article></entry>

<entry id="Bis89"><mastersthesis>
  <author>
    <name><first>Thomas</first><last>Bischops</last></name>
  </author>
  <title>Collectoren im <C>P</C>rogrammsystem <C>GAP</C></title>
  <school>Lehrstuhl   D   für  Mathematik, Rheinisch  Westfälische
                      Technische Hochschule</school>
  <year>1989</year>
  <type>Diplomarbeit</type>
  <address>Aachen, Germany</address>
</mastersthesis></entry>

<entry id="BC92"><techreport>
  <author>
    <name><first>Wieb</first><last>Bosma</last></name>
    <name><first>John J.</first><last>Cannon</last></name>
  </author>
  <title>Handbook of <C>C</C>ayley Functions</title>
  <institution>Department of Pure Mathematics, University of
      Sydney</institution>
  <year>1992</year>
  <address>Sydney, Australia</address>
  <keywords>system design; Cayley;; manual</keywords>
  <other type="pages">282 pp.</other>
</techreport></entry>

<entry id="Bou68"><book>
  <author>
    <name><first>N.</first><last>Bourbaki</last></name>
  </author>
  <title>Éléments de mathématique. <C>F</C>asc. <C>XXXIV</C>. <C>G</C>roupes
  et algèbres de <C>L</C>ie. <C>C</C>hapitre <C>IV</C>: <C>G</C>roupes de
  <C>C</C>oxeter et systèmes de <C>T</C>its. <C>C</C>hapitre <C>V</C>:
      <C>G</C>roupes
  engendrés par des réflexions. <C>C</C>hapitre <C>VI</C>: systèmes
              de racines</title>
  <publisher>Hermann</publisher>
  <year>1968</year>
  <series>Actualités Scientifiques et Industrielles, No. 1337</series>
  <address>Paris</address>
  <mrnumber>0240238 (39 #1590)</mrnumber>
  <mrclass>22.50 (17.00)</mrclass>
  <mrreviewer>G. B. Seligman</mrreviewer>
  <other type="pages">288 pp. (loose errata)</other>
</book></entry>

<entry id="BC89"><article>
  <author>
    <name><first>Richard P.</first><last>Brent</last></name>
    <name><first>Graeme L.</first><last>Cohen</last></name>
  </author>
  <title>A new lower bound for odd perfect numbers</title>
  <journal><value key="mathc3"/></journal>
  <year>1989</year>
  <volume>53</volume>
  <number>187</number>
  <pages>431–437, S7–S24</pages>
  <issn>0025-5718</issn>
  <mrnumber>968150 (89m:11008)</mrnumber>
  <mrclass>11A25 (11Y05 11Y70)</mrclass>
  <mrreviewer>Samuel S. Wagstaff, Jr.</mrreviewer>
  <other type="coden">MCMPAF</other>
  <other type="fjournal">Mathematics of Computation</other>
</article></entry>

<entry id="Bre91"><mastersthesis>
  <author>
    <name><first>Thomas</first><last>Breuer</last></name>
  </author>
  <title>Potenzabbildungen,             <C>U</C>ntergruppenfusionen,
                      <C>T</C>afel-<C>A</C>utomorphismen</title>
  <school>Lehrstuhl   D   für  Mathematik, Rheinisch  Westfälische
                      Technische Hochschule</school>
  <year>1991</year>
  <type>Diplomarbeit</type>
  <address>Aachen, Germany</address>
</mastersthesis></entry>

<entry id="BL96"><article>
  <author>
    <name><first>T.</first><last>Breuer</last></name>
    <name><first>K.</first><last>Lux</last></name>
  </author>
  <title>The multiplicity-free permutation characters of the sporadic
              simple groups and their automorphism groups</title>
  <journal><value key="comma2"/></journal>
  <year>1996</year>
  <volume>24</volume>
  <number>7</number>
  <pages>2293–2316</pages>
  <issn>0092-7872</issn>
  <mrnumber>1390375 (97c:20020)</mrnumber>
  <mrclass>20C34 (20D08)</mrclass>
  <mrreviewer>Peter Fleischmann</mrreviewer>
  <other type="coden">COALDM</other>
  <other type="fjournal">Communications in Algebra</other>
</article></entry>

<entry id="Bre97"><article>
  <author>
    <name><first>Thomas</first><last>Breuer</last></name>
  </author>
  <title>Integral bases for subfields of cyclotomic fields</title>
  <journal><value key="appae"/></journal>
  <year>1997</year>
  <volume>8</volume>
  <number>4</number>
  <pages>279–289</pages>
  <issn>0938-1279</issn>
  <mrnumber>1464789 (99a:11120)</mrnumber>
  <mrclass>11R18</mrclass>
  <mrreviewer>Wieb Bosma</mrreviewer>
  <other type="coden">AAECEW</other>
  <other type="fjournal">Applicable Algebra in Engineering, Communication and
              Computing</other>
</article></entry>

<entry id="BP98"><article>
  <author>
    <name><first>Thomas</first><last>Breuer</last></name>
    <name><first>Götz</first><last>Pfeiffer</last></name>
  </author>
  <title>Finding possible permutation characters</title>
  <journal><value key="jsymc"/></journal>
  <year>1998</year>
  <volume>26</volume>
  <number>3</number>
  <pages>343–354</pages>
  <issn>0747-7171</issn>
  <mrnumber>1633876 (99e:20005)</mrnumber>
  <mrclass>20B99 (20B40 20C15 20C40)</mrclass>
  <mrreviewer>Cheryl E. Praeger</mrreviewer>
  <other type="fjournal">Journal of Symbolic Computation</other>
</article></entry>

<entry id="BreuerLinton98"><inproceedings>
  <author>
    <name><first>Thomas</first><last>Breuer</last></name>
    <name><first>Steve</first><last>Linton</last></name>
  </author>
  <title>The   <C>GAP 4</C>   Type   System.   Organizing  Algebraic
                      Algorithms</title>
  <booktitle>ISSAC '98: Proceedings of the 1998 international symposium on
      Symbolic and algebraic computation</booktitle>
  <year>1998</year>
  <pages>38–45</pages>
  <address>New York, NY, USA</address>
  <publisher>ACM Press</publisher>
  <note>Chairman: Volker Weispfenning and Barry Trager</note>
  <crossref>ISSAC98</crossref>
  <isbn>1-58113-002-3</isbn>
  <location>Rostock, Germany</location>
  <other type="source">ACM Order No.: 505980, ACM member price $25</other>
</inproceedings></entry>

<entry id="Bre99"><article>
  <author>
    <name><first>Thomas</first><last>Breuer</last></name>
  </author>
  <title>Computing possible class fusions from character tables</title>
  <journal><value key="comma2"/></journal>
  <year>1999</year>
  <volume>27</volume>
  <number>6</number>
  <pages>2733–2748</pages>
  <issn>0092-7872</issn>
  <mrnumber>1687309 (2000c:20015)</mrnumber>
  <mrclass>20C15</mrclass>
  <mrreviewer>Jürgen Ritter</mrreviewer>
  <other type="coden">COALDM</other>
  <other type="fjournal">Communications in Algebra</other>
</article></entry>

<entry id="BN95"><inbook>
  <author>
    <name><first>Thomas</first><last>Breuer</last></name>
    <name><first>Simon P.</first><last>Norton</last></name>
  </author>
  <title>Improvements to the <C>A</C>tlas</title>
  <pages>297–327</pages>
  <publisher>The Clarendon Press Oxford University Press</publisher>
  <year>1995</year>
  <volume>11</volume>
  <series>London Mathematical Society Monographs. New Series</series>
  <address>New York</address>
  <note>Appendix 2 by T. Breuer and S. Norton,
              Oxford Science Publications</note>
  <crossref>JLPW95</crossref>
  <isbn>0-19-851481-6</isbn>
  <mrnumber>1367961 (96k:20016)</mrnumber>
  <mrclass>20C20 (20-00 20D06 20D08)</mrclass>
  <mrreviewer>J. L. Alperin</mrreviewer>
</inbook></entry>

<entry id="Bri71"><article>
  <author>
    <name><first>E.</first><last>Brieskorn</last></name>
  </author>
  <title>Die <C>F</C>undamentalgruppe des <C>R</C>aumes der regulären
      <C>O</C>rbits
              einer endlichen komplexen <C>S</C>piegelungsgruppe</title>
  <journal><value key="invem"/></journal>
  <year>1971</year>
  <volume>12</volume>
  <pages>57–61</pages>
  <issn>0020-9910</issn>
  <mrnumber>0293615 (45 #2692)</mrnumber>
  <mrclass>55A05</mrclass>
  <mrreviewer>L. Neuwirth</mrreviewer>
  <other type="fjournal">Inventiones Mathematicae</other>
</article></entry>

<entry id="BS72"><article>
  <author>
    <name><first>Egbert</first><last>Brieskorn</last></name>
    <name><first>Kyoji</first><last>Saito</last></name>
  </author>
  <title>Artin-<C>G</C>ruppen und <C>C</C>oxeter-<C>G</C>ruppen</title>
  <journal><value key="invem"/></journal>
  <year>1972</year>
  <volume>17</volume>
  <pages>245–271</pages>
  <issn>0020-9910</issn>
  <mrnumber>0323910 (48 #2263)</mrnumber>
  <mrclass>20F05</mrclass>
  <mrreviewer>D. E. Cohen</mrreviewer>
  <other type="fjournal">Inventiones Mathematicae</other>
</article></entry>

<entry id="BM93"><article>
  <author>
    <name><first>Michel</first><last>Broué</last></name>
    <name><first>Gunter</first><last>Malle</last></name>
  </author>
  <title>Zyklotomische <C>H</C>eckealgebren</title>
  <journal>Astérisque</journal>
  <year>1993</year>
  <number>212</number>
  <pages>119–189</pages>
  <note>Représentations unipotentes génériques et blocs des
              groupes réductifs finis</note>
  <crossref>Asterisque212</crossref>
  <issn>0303-1179</issn>
  <mrnumber>1235834 (94m:20095)</mrnumber>
  <mrclass>20G40 (20C20 20H15)</mrclass>
  <mrreviewer>François Digne</mrreviewer>
  <other type="address">Paris</other>
  <other type="fjournal">Astérisque</other>
  <other type="publisher">Société Mathématique de France</other>
</article></entry>

<entry id="BMM93"><article>
  <author>
    <name><first>Michel</first><last>Broué</last></name>
    <name><first>Gunter</first><last>Malle</last></name>
    <name><first>Jean</first><last>Michel</last></name>
  </author>
  <title>Generic blocks of finite reductive groups</title>
  <journal>Astérisque</journal>
  <year>1993</year>
  <number>212</number>
  <pages>7–92</pages>
  <note>Représentations unipotentes génériques et blocs des
              groupes réductifs finis</note>
  <crossref>Asterisque212</crossref>
  <issn>0303-1179</issn>
  <mrnumber>1235832 (95d:20072)</mrnumber>
  <mrclass>20G05 (20C20)</mrclass>
  <mrreviewer>Bhama Srinivasan</mrreviewer>
  <other type="address">Paris</other>
  <other type="fjournal">Astérisque</other>
  <other type="publisher">Société Mathématique de France</other>
</article></entry>

<entry id="Asterisque212"><book>
  <author>
    <name><first>Michel</first><last>Broué</last></name>
    <name><first>Gunter</first><last>Malle</last></name>
    <name><first>Jean</first><last>Michel</last></name>
  </author>
  <title>Représentations unipotentes génériques et blocs des
              groupes réductifs finis</title>
  <publisher>Société Mathématique de France</publisher>
  <year>1993</year>
  <address>Paris</address>
  <note>Astérisque No. 212 (1993)</note>
  <issn>0303-1179</issn>
  <mrnumber>1235830 (94c:20078)</mrnumber>
  <mrclass>20G05</mrclass>
  <other type="pages">1–203</other>
</book></entry>

<entry id="Baker84"><book>
  <author>
    <name><first>Alan</first><last>Baker</last></name>
  </author>
  <title>A concise introduction to the theory of numbers</title>
  <publisher>Cambridge University Press</publisher>
  <year>1984</year>
  <address>Cambridge</address>
  <isbn>0-521-24383-1; 0-521-28654-9</isbn>
  <mrnumber>781734 (86f:11001)</mrnumber>
  <mrclass>11-01</mrclass>
  <mrreviewer>Don Redmond</mrreviewer>
  <other type="pages">xiii+95</other>
</book></entry>

<entry id="BCN89"><book>
  <author>
    <name><first>A. E.</first><last>Brouwer</last></name>
    <name><first>A. M.</first><last>Cohen</last></name>
    <name><first>A.</first><last>Neumaier</last></name>
  </author>
  <title>Distance-regular graphs</title>
  <publisher>Springer-Verlag</publisher>
  <year>1989</year>
  <volume>18</volume>
  <series>Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results
              in Mathematics and Related Areas (3)]</series>
  <address>Berlin</address>
  <isbn>3-540-50619-5</isbn>
  <mrnumber>1002568 (90e:05001)</mrnumber>
  <mrclass>05-02 (05C75)</mrclass>
  <mrreviewer>Joe Hemmeter</mrreviewer>
  <other type="pages">xviii+495</other>
</book></entry>

<entry id="BBNWZ78"><book>
  <author>
    <name><first>Harold</first><last>Brown</last></name>
    <name><first>Rolf</first><last>Bülow</last></name>
    <name><first>Joachim</first><last>Neubüser</last></name>
    <name><first>Hans</first><last>Wondratschek</last></name>
    <name><first>Hans</first><last>Zassenhaus</last></name>
  </author>
  <title>Crystallographic groups of four-dimensional space</title>
  <publisher>Wiley-Interscience [John Wiley & Sons]</publisher>
  <year>1978</year>
  <address>New York</address>
  <note>Wiley Monographs in Crystallography</note>
  <isbn>0-471-03095-3</isbn>
  <mrnumber>0484179 (58 #4109)</mrnumber>
  <mrclass>82.20 (20F05)</mrclass>
  <mrreviewer>Daniel B. Litvin</mrreviewer>
  <other type="pages">xiv+443</other>
</book></entry>

<entry id="BCMa"><article>
  <author>
    <name><first>Gilbert</first><last>Baumslag</last></name>
    <name><first>Frank B.</first><last>Cannonito</last></name>
    <name><first>Charles F.</first><last>Miller III</last></name>
  </author>
  <title>Some recognizable properties of solvable groups</title>
  <journal><value key="mathz"/></journal>
  <year>1981</year>
  <volume>178</volume>
  <number>3</number>
  <pages>289–295</pages>
  <issn>0025-5874</issn>
  <mrnumber>635200 (82k:20061)</mrnumber>
  <mrclass>20F16 (03D40 20F10)</mrclass>
  <mrreviewer>V. A. Romanʹkov</mrreviewer>
  <other type="coden">MAZEAX</other>
  <other type="fjournal">Mathematische Zeitschrift</other>
</article></entry>

<entry id="BCMb"><article>
  <author>
    <name><first>Gilbert</first><last>Baumslag</last></name>
    <name><first>Frank B.</first><last>Cannonito</last></name>
    <name><first>Charles F.</first><last>Miller III</last></name>
  </author>
  <title>Computable algebra and group embeddings</title>
  <journal><value key="jalge"/></journal>
  <year>1981</year>
  <volume>69</volume>
  <number>1</number>
  <pages>186–212</pages>
  <issn>0021-8693</issn>
  <mrnumber>613868 (82e:20042)</mrnumber>
  <mrclass>20F10 (03D40 03D45 16A53)</mrclass>
  <mrreviewer>D. E. Cohen</mrreviewer>
  <other type="coden">JALGA4</other>
  <other type="fjournal">Journal of Algebra</other>
</article></entry>

<entry id="Bourbaki70"><book>
  <author>
    <name><first>N.</first><last>Bourbaki</last></name>
  </author>
  <title>Éléments de mathématique. <C>A</C>lgèbre. <C>C</C>hapitres 1
              à 3</title>
  <publisher>Hermann</publisher>
  <year>1970</year>
  <address>Paris</address>
  <mrnumber>0274237 (43 #2)</mrnumber>
  <mrclass>00.00 (13.00)</mrclass>
  <mrreviewer>P. Samuel</mrreviewer>
  <other type="pages">xiii+635 pp. (not consecutively paged)</other>
</book></entry>

<entry id="BJR87"><article>
  <author>
    <name><first>R.</first><last>Brown</last></name>
    <name><first>D. L.</first><last>Johnson</last></name>
    <name><first>E. F.</first><last>Robertson</last></name>
  </author>
  <title>Some computations of nonabelian tensor products of groups</title>
  <journal><value key="jalge"/></journal>
  <year>1987</year>
  <volume>111</volume>
  <number>1</number>
  <pages>177–202</pages>
  <issn>0021-8693</issn>
  <mrnumber>913203 (88m:20071)</mrnumber>
  <mrclass>20F05 (20E22)</mrclass>
  <mrreviewer>Stephen J. Pride</mrreviewer>
  <other type="coden">JALGA4</other>
  <other type="fjournal">Journal of Algebra</other>
</article></entry>

<entry id="BuekenhoutLeemans96"><article>
  <author>
    <name><first>Francis</first><last>Buekenhout</last></name>
    <name><first>Dimitri</first><last>Leemans</last></name>
  </author>
  <title>On the list of finite primitive permutation groups of degree
              <C><M>\leq 50</M></C></title>
  <journal><value key="jsymc"/></journal>
  <year>1996</year>
  <volume>22</volume>
  <number>2</number>
  <pages>215–225</pages>
  <issn>0747-7171</issn>
  <mrnumber>1422147 (97g:20004)</mrnumber>
  <mrclass>20B15</mrclass>
  <other type="fjournal">Journal of Symbolic Computation</other>
</article></entry>

<entry id="BM83"><article>
  <author>
    <name><first>Gregory</first><last>Butler</last></name>
    <name><first>John</first><last>McKay</last></name>
  </author>
  <title>The transitive groups of degree up to eleven</title>
  <journal><value key="comma2"/></journal>
  <year>1983</year>
  <volume>11</volume>
  <number>8</number>
  <pages>863–911</pages>
  <issn>0092-7872</issn>
  <mrnumber>695893 (84f:20005)</mrnumber>
  <mrclass>20B05</mrclass>
  <mrreviewer>Michael Klemm</mrreviewer>
  <other type="coden">COALDM</other>
  <other type="fjournal">Communications in Algebra</other>
</article></entry>

<entry id="Butler93"><article>
  <author>
    <name><first>Greg</first><last>Butler</last></name>
  </author>
  <title>The transitive groups of degree fourteen and fifteen</title>
  <journal><value key="jsymc"/></journal>
  <year>1993</year>
  <volume>16</volume>
  <number>5</number>
  <pages>413–422</pages>
  <issn>0747-7171</issn>
  <mrnumber>1271082 (95e:20006)</mrnumber>
  <mrclass>20B35 (20B40 68Q40)</mrclass>
  <mrreviewer>Gerhard Hiss</mrreviewer>
  <other type="fjournal">Journal of Symbolic Computation</other>
</article></entry>

<entry id="Bra89"><phdthesis>
  <author>
    <name><first>R. J.</first><last>Bradford</last></name>
  </author>
  <title>On  the  computation  of integral bases and defects of
                      integrity</title>
  <school>School of Mathematical Sciences, University of Bath</school>
  <year>1989</year>
  <address>Bath</address>
</phdthesis></entry>

<entry id="BTW93"><article>
  <author>
    <name><first>Bernard</first><last>Beauzamy</last></name>
    <name><first>Vilmar</first><last>Trevisan</last></name>
    <name><first>Paul S.</first><last>Wang</last></name>
  </author>
  <title>Polynomial factorization: sharp bounds, efficient algorithms</title>
  <journal><value key="jsymc"/></journal>
  <year>1993</year>
  <volume>15</volume>
  <number>4</number>
  <pages>393–413</pages>
  <issn>0747-7171</issn>
  <mrnumber>1227929 (94m:68091)</mrnumber>
  <mrclass>68Q40</mrclass>
  <other type="fjournal">Journal of Symbolic Computation</other>
</article></entry>

<entry id="Bur55"><book>
  <author>
    <name><first>W.</first><last>Burnside</last></name>
  </author>
  <title>Theory of groups of finite order</title>
  <publisher>Dover Publications Inc.</publisher>
  <year>1955</year>
  <address>New York</address>
  <note>Unabridged   republication   of  the  second  edition,
                      published in 1911</note>
  <mrnumber>0069818 (16,1086c)</mrnumber>
  <mrclass>20.0X</mrclass>
  <other type="pages">xxiv+512</other>
</book></entry>

<entry id="But82"><article>
  <author>
    <name><first>Gregory</first><last>Butler</last></name>
  </author>
  <title>Computing in permutation and matrix groups. <C>II</C>.
      <C>B</C>acktrack
              algorithm</title>
  <journal><value key="mathc3"/></journal>
  <year>1982</year>
  <volume>39</volume>
  <number>160</number>
  <pages>671–680</pages>
  <issn>0025-5718</issn>
  <keywords>permutation  groups, matrix groups;; backtrack through
                      stabilizer chain</keywords>
  <mrnumber>669659 (83k:20004b)</mrnumber>
  <mrclass>20-04 (20E25 20G40)</mrclass>
  <mrreviewer>J. D. Dixon</mrreviewer>
  <other type="coden">MCMPAF</other>
  <other type="fjournal">Mathematics of Computation</other>
</article></entry>

<entry id="BuCa89"><article>
  <author>
    <name><first>Gregory</first><last>Butler</last></name>
    <name><first>John</first><last>Cannon</last></name>
  </author>
  <title>Computing in permutation and matrix groups. <C>III</C>. <C>S</C>ylow
              subgroups</title>
  <journal><value key="jsymc"/></journal>
  <year>1989</year>
  <volume>8</volume>
  <number>3</number>
  <pages>241–252</pages>
  <issn>0747-7171</issn>
  <mrnumber>1015649 (90i:20003)</mrnumber>
  <mrclass>20-04 (20D20)</mrclass>
  <mrreviewer>J. D. Dixon</mrreviewer>
  <other type="fjournal">Journal of Symbolic Computation</other>
</article></entry>

<entry id="But85a"><article>
  <author>
    <name><first>Gregory</first><last>Butler</last></name>
  </author>
  <title>Effective computation with group homomorphisms</title>
  <journal><value key="jsymc"/></journal>
  <year>1985</year>
  <volume>1</volume>
  <number>2</number>
  <pages>143–157</pages>
  <issn>0747-7171</issn>
  <keywords>permutation groups; homomorphisms</keywords>
  <mrnumber>818875 (87b:68057)</mrnumber>
  <mrclass>68Q40 (20-04 20B99)</mrclass>
  <other type="fjournal">Journal of Symbolic Computation</other>
</article></entry>

<entry id="Cam71"><mastersthesis>
  <author>
    <name><first>Harvey A.</first><last>Campbell</last></name>
  </author>
  <title>An extension of coset enumeration</title>
  <school>McGill University</school>
  <year>1971</year>
  <type>M. Sc. thesis</type>
  <address>Montreal, Canada</address>
  <keywords>finitely   presented  groups;  subgroup  presentation;
  modified Todd Coxeter (mtc); program description</keywords>
</mastersthesis></entry>

<entry id="Can73"><article>
  <author>
    <name><first>John J.</first><last>Cannon</last></name>
  </author>
  <title>Construction of defining relators for finite groups</title>
  <journal><value key="discm"/></journal>
  <year>1973</year>
  <volume>5</volume>
  <pages>105–129</pages>
  <issn>0012-365X</issn>
  <mrnumber>0318322 (47 #6869)</mrnumber>
  <mrclass>20F05</mrclass>
  <mrreviewer>H. S. M. Coxeter</mrreviewer>
  <other type="fjournal">Discrete Mathematics</other>
</article></entry>

<entry id="Car72"><article>
  <author>
    <name><first>R. W.</first><last>Carter</last></name>
  </author>
  <title>Conjugacy classes in the <C>W</C>eyl group</title>
  <journal><value key="compo"/></journal>
  <year>1972</year>
  <volume>25</volume>
  <pages>1–59</pages>
  <issn>0010-437X</issn>
  <mrnumber>0318337 (47 #6884)</mrnumber>
  <mrclass>20H15 (17B20)</mrclass>
  <mrreviewer>Juri A. Bahturin</mrreviewer>
  <other type="fjournal">Compositio Mathematica</other>
</article></entry>

<entry id="Car85"><book>
  <author>
    <name><first>Roger W.</first><last>Carter</last></name>
  </author>
  <title>Finite groups of <C>L</C>ie type</title>
  <publisher>John Wiley & Sons Inc.</publisher>
  <year>1985</year>
  <series>Pure and Applied Mathematics (New York)</series>
  <address>New York</address>
  <note>Conjugacy classes and complex characters,
              A Wiley-Interscience Publication</note>
  <isbn>0-471-90554-2</isbn>
  <mrnumber>794307 (87d:20060)</mrnumber>
  <mrclass>20G40 (20-02 20C15)</mrclass>
  <mrreviewer>David B. Surowski</mrreviewer>
  <other type="pages">xii+544</other>
</book></entry>

<entry id="Car8593"><book>
  <author>
    <name><first>Roger W.</first><last>Carter</last></name>
  </author>
  <title>Finite groups of <C>L</C>ie type</title>
  <publisher>John Wiley & Sons Ltd.</publisher>
  <year>1993</year>
  <series>Wiley Classics Library</series>
  <address>Chichester</address>
  <note>Conjugacy classes and complex characters,
              Reprint of the 1985 original,
              A Wiley-Interscience Publication</note>
  <isbn>0-471-94109-3</isbn>
  <mrnumber>1266626 (94k:20020)</mrnumber>
  <mrclass>20C33 (20-02 20G40)</mrclass>
  <other type="pages">xii+544</other>
</book></entry>

<entry id="Car86"><article>
  <author>
    <name><first>R. W.</first><last>Carter</last></name>
  </author>
  <title>Representation theory of the <C><M>0</M></C>-<C>H</C>ecke
      algebra</title>
  <journal><value key="jalge"/></journal>
  <year>1986</year>
  <volume>104</volume>
  <number>1</number>
  <pages>89–103</pages>
  <issn>0021-8693</issn>
  <mrnumber>865891 (88a:20014)</mrnumber>
  <mrclass>20C15 (16A65 20G05)</mrclass>
  <mrreviewer>David Benson</mrreviewer>
  <other type="coden">JALGA4</other>
  <other type="fjournal">Journal of Algebra</other>
</article></entry>

<entry id="Car72a"><book>
  <author>
    <name><first>Roger W.</first><last>Carter</last></name>
  </author>
  <title>Simple groups of <C>L</C>ie type</title>
  <publisher>John Wiley & Sons, London-New York-Sydney</publisher>
  <year>1972</year>
  <note>Pure and Applied Mathematics, Vol. 28</note>
  <mrnumber>0407163 (53 #10946)</mrnumber>
  <mrclass>20G15 (20D05 22E20)</mrclass>
  <mrreviewer>Louis Solomon</mrreviewer>
  <other type="pages">viii+331</other>
</book></entry>

<entry id="Car72a89"><book>
  <author>
    <name><first>Roger W.</first><last>Carter</last></name>
  </author>
  <title>Simple groups of <C>L</C>ie type</title>
  <publisher>John Wiley & Sons Inc.</publisher>
  <year>1989</year>
  <series>Wiley Classics Library</series>
  <address>New York</address>
  <note>Reprint of the 1972 original,
              A Wiley-Interscience Publication</note>
  <isbn>0-471-50683-4</isbn>
  <mrnumber>1013112 (90g:20001)</mrnumber>
  <mrclass>20-02 (20D05 20E32 20G15 20G40 22-02)</mrclass>
  <other type="pages">x+335</other>
</book></entry>

<entry id="Cel92"><mastersthesis>
  <author>
    <name><first>Frank</first><last>Celler</last></name>
  </author>
  <title>Kohomologie und <C>N</C>ormalisatoren in <C>GAP</C></title>
  <school>Lehrstuhl   D   für  Mathematik,
                      Rheinisch               Westfälische
                      Technische Hochschule</school>
  <year>1992</year>
  <type>Diplomarbeit</type>
  <address>Aachen, Germany</address>
</mastersthesis></entry>

<entry id="CNW90"><article>
  <author>
    <name><first>F.</first><last>Celler</last></name>
    <name><first>J.</first><last>Neubüser</last></name>
    <name><first>C. R. B.</first><last>Wright</last></name>
  </author>
  <title>Some remarks on the computation of complements and normalizers
              in soluble groups</title>
  <journal><value key="actam3"/></journal>
  <year>1990</year>
  <volume>21</volume>
  <number>1-2</number>
  <pages>57–76</pages>
  <issn>0167-8019</issn>
  <mrnumber>1085773 (91m:20026)</mrnumber>
  <mrclass>20D10 (20-04)</mrclass>
  <mrreviewer>Michael C. Slattery</mrreviewer>
  <other type="coden">AAMADV</other>
  <other type="fjournal">Acta Applicandae Mathematicae. An International
      Survey Journal
              on Applying Mathematics and Mathematical Applications</other>
</article></entry>

<entry id="Cha92"><article>
  <author>
    <name><first>Ruth</first><last>Charney</last></name>
  </author>
  <title>Artin groups of finite type are biautomatic</title>
  <journal><value key="matha"/></journal>
  <year>1992</year>
  <volume>292</volume>
  <number>4</number>
  <pages>671–683</pages>
  <issn>0025-5831</issn>
  <mrnumber>1157320 (93c:20067)</mrnumber>
  <mrclass>20F36 (20F10)</mrclass>
  <mrreviewer>D. F. Holt</mrreviewer>
  <other type="coden">MAANA</other>
  <other type="fjournal">Mathematische Annalen</other>
</article></entry>

<entry id="Cla97"><article>
  <author>
    <name><first>Michael</first><last>Clausen</last></name>
  </author>
  <title>A direct proof of <C>M</C>inkwitz's extension theorem
  <journal><value key="appae"/></journal>
  <year>1997</year>
  <volume>8</volume>
  <number>4</number>
  <pages>305–306</pages>
  <issn>0938-1279</issn>
  <mrnumber>1464791</mrnumber>
  <mrclass>20C15</mrclass>
  <other type="coden">AAECEW</other>
  <other type="fjournal">Applicable Algebra in Engineering, Communication and
              Computing</other>
</article></entry>

<entry id="Coh93"><book>
  <author>
    <name><first>Henri</first><last>Cohen</last></name>
  </author>
  <title>A course in computational algebraic number theory</title>
  <publisher>Springer-Verlag</publisher>
  <year>1993</year>
  <volume>138</volume>
  <series>Graduate Texts in Mathematics</series>
  <address>Berlin</address>
  <isbn>3-540-55640-0</isbn>
  <mrnumber>1228206 (94i:11105)</mrnumber>
  <mrclass>11Y40 (11Rxx 68Q40)</mrclass>
  <mrreviewer>Joe P. Buhler</mrreviewer>
  <other type="pages">xii+534</other>
</book></entry>

<entry id="Con90a"><article>
  <author>
    <name><first>S. B.</first><last>Conlon</last></name>
  </author>
  <title>Calculating characters of <C><M>p</M></C>-groups</title>
  <journal><value key="jsymc"/></journal>
  <year>1990</year>
  <volume>9</volume>
  <number>5-6</number>
  <pages>535–550</pages>
  <note>Computational group theory, Part 1</note>
  <issn>0747-7171</issn>
  <mrnumber>1075421 (91j:20033)</mrnumber>
  <mrclass>20C40 (20C15 20D15)</mrclass>
  <mrreviewer>Michael C. Slattery</mrreviewer>
  <other type="fjournal">Journal of Symbolic Computation</other>
</article></entry>

<entry id="Con90b"><article>
  <author>
    <name><first>S. B.</first><last>Conlon</last></name>
  </author>
  <title>Computing modular and projective character degrees of soluble
              groups</title>
  <journal><value key="jsymc"/></journal>
  <year>1990</year>
  <volume>9</volume>
  <number>5-6</number>
  <pages>551–570</pages>
  <note>Computational group theory, Part 1</note>
  <issn>0747-7171</issn>
  <mrnumber>1075422 (91j:20034)</mrnumber>
  <mrclass>20C40 (20C15 20C20)</mrclass>
  <mrreviewer>Michael C. Slattery</mrreviewer>
  <other type="fjournal">Journal of Symbolic Computation</other>
</article></entry>

<entry id="CCN85"><book>
  <author>
    <name><first>J. H.</first><last>Conway</last></name>
    <name><first>R. T.</first><last>Curtis</last></name>
    <name><first>S. P.</first><last>Norton</last></name>
    <name><first>R. A.</first><last>Parker</last></name>
    <name><first>R. A.</first><last>Wilson</last></name>
  </author>
  <title>Atlas of finite groups</title>
  <publisher>Oxford University Press</publisher>
  <year>1985</year>
  <address>Eynsham</address>
  <note>Maximal subgroups and ordinary characters for simple groups,
              With computational assistance from J. G. Thackray</note>
  <isbn>0-19-853199-0</isbn>
  <mrnumber>827219 (88g:20025)</mrnumber>
  <mrclass>20D05 (20-02)</mrclass>
  <mrreviewer>R. L. Griess</mrreviewer>
  <other type="pages">xxxiv+252</other>
</book></entry>

<entry id="ConwayHulpkeMcKay98"><article>
  <author>
    <name><first>John H.</first><last>Conway</last></name>
    <name><first>Alexander</first><last>Hulpke</last></name>
    <name><first>John</first><last>McKay</last></name>
  </author>
  <title>On transitive permutation groups</title>
  <journal>LMS J. Comput. Math.</journal>
  <year>1998</year>
  <volume>1</volume>
  <pages>1–8 (electronic)</pages>
  <issn>1461-1570</issn>
  <mrnumber>1635715 (99g:20011)</mrnumber>
  <mrclass>20B05 (20B40)</mrclass>
  <mrreviewer>D. F. Holt</mrreviewer>
  <other type="fjournal">LMS Journal of Computation and Mathematics</other>
</article></entry>

<entry id="CF94"><article>
  <author>
    <name><first>Gene</first><last>Cooperman</last></name>
    <name><first>Larry</first><last>Finkelstein</last></name>
  </author>
  <title>A random base change algorithm for permutation groups</title>
  <journal><value key="jsymc"/></journal>
  <year>1994</year>
  <volume>17</volume>
  <number>6</number>
  <pages>513–528</pages>
  <issn>0747-7171</issn>
  <mrnumber>1300351 (96a:68048)</mrnumber>
  <mrclass>68Q40 (20B07)</mrclass>
  <other type="fjournal">Journal of Symbolic Computation</other>
</article></entry>

<entry id="CLR90"><book>
  <author>
    <name><first>T. H.</first><last>Cormen</last></name>
    <name><first>C. E.</first><last>Leiserson</last></name>
    <name><first>R. L.</first><last>Rivest</last></name>
  </author>
  <title>Introduction to algorithms</title>
  <publisher>MIT Press</publisher>
  <year>1990</year>
  <series>The MIT Electrical Engineering and Computer Science Series</series>
  <address>Cambridge, MA</address>
  <isbn>0-262-03141-8</isbn>
  <mrnumber>1066870 (91i:68001)</mrnumber>
  <mrclass>68-01 (05-01 05C85 68Q25)</mrclass>
  <mrreviewer>Selim G. Akl</mrreviewer>
  <other type="pages">xx+1028</other>
</book></entry>

<entry id="CRDQ11"><article>
  <author>
    <name><first>Hannah J.</first><last>Coutts</last></name>
  </author>
  <author>
    <name><first>Colva M.</first><last>Roney-Dougal</last></name>
  </author>
  <author>
    <name><first>Martyn</first><last>Quick</last></name>
  </author>
  <title>The primitive permutation groups of degree less than 4096</title>
  <journal><value key="comma2"/></journal>
  <year>2011</year>
  <volume>39</volume>
  <number>10</number>
  <pages>3526–3546</pages>
  <issn>0092-7872</issn>
  <mrnumber>2845584</mrnumber>
  <mrclass>20B15</mrclass>
  <mrreviewer>Thomas Michael Keller</mrreviewer>
  <other type="coden">COALDM</other>
  <other type="fjournal">Communications in Algebra</other>
</article></entry>

<entry id="coxlittleoshea"><book>
  <author>
    <name><first>David</first><last>Cox</last></name>
    <name><first>John</first><last>Little</last></name>
    <name><first>Donal</first><last>O'Shea
  </author>
  <title>Ideals, varieties, and algorithms</title>
  <publisher>Springer-Verlag</publisher>
  <year>1997</year>
  <series>Undergraduate Texts in Mathematics</series>
  <address>New York</address>
  <edition>Second</edition>
  <note>An introduction to computational algebraic geometry and
              commutative algebra</note>
  <isbn>0-387-94680-2</isbn>
  <mrnumber>1417938 (97h:13024)</mrnumber>
  <mrclass>13P10 (13-01 14-01 14Qxx 68Q40)</mrclass>
  <other type="pages">xiv+536</other>
</book></entry>

<entry id="CR81"><book>
  <author>
    <name><first>Charles W.</first><last>Curtis</last></name>
    <name><first>Irving</first><last>Reiner</last></name>
  </author>
  <title>Methods of representation theory. <C>V</C>ol. <C>I</C></title>
  <publisher>John Wiley & Sons Inc.</publisher>
  <year>1981</year>
  <address>New York</address>
  <note>With applications to finite groups and orders,
              Pure and Applied Mathematics,
              A Wiley-Interscience Publication</note>
  <isbn>0-471-18994-4</isbn>
  <mrnumber>632548 (82i:20001)</mrnumber>
  <mrclass>20-02 (10C30 12A57 20Cxx)</mrclass>
  <mrreviewer>J. L. Alperin</mrreviewer>
  <other type="pages">xxi+819</other>
</book></entry>

<entry id="CR87"><book>
  <author>
    <name><first>Charles W.</first><last>Curtis</last></name>
    <name><first>Irving</first><last>Reiner</last></name>
  </author>
  <title>Methods of representation theory. <C>V</C>ol. <C>II</C></title>
  <publisher>John Wiley & Sons Inc.</publisher>
  <year>1987</year>
  <series>Pure and Applied Mathematics (New York)</series>
  <address>New York</address>
  <note>With applications to finite groups and orders,
              A Wiley-Interscience Publication</note>
  <isbn>0-471-88871-0</isbn>
  <mrnumber>892316 (88f:20002)</mrnumber>
  <mrclass>20-02 (11Exx 18F25 19A31 19B28 19C99 20Cxx)</mrclass>
  <mrreviewer>J. L. Alperin</mrreviewer>
  <other type="pages">xviii+951</other>
</book></entry>

<entry id="Del72"><article>
  <author>
    <name><first>Pierre</first><last>Deligne</last></name>
  </author>
  <title>Les immeubles des groupes de tresses généralisés</title>
  <journal><value key="invem"/></journal>
  <year>1972</year>
  <volume>17</volume>
  <pages>273–302</pages>
  <issn>0020-9910</issn>
  <mrnumber>0422673 (54 #10659)</mrnumber>
  <mrclass>32C40 (55A25)</mrclass>
  <mrreviewer>Alan H. Durfee</mrreviewer>
  <other type="fjournal">Inventiones Mathematicae</other>
</article></entry>

<entry id="Deo89"><article>
  <author>
    <name><first>Vinay V.</first><last>Deodhar</last></name>
  </author>
  <title>A note on subgroups generated by reflections in <C>C</C>oxeter
              groups</title>
  <journal><value key="arcmb1"/></journal>
  <year>1989</year>
  <volume>53</volume>
  <number>6</number>
  <pages>543–546</pages>
  <issn>0003-889X</issn>
  <mrnumber>1023969 (91c:20063)</mrnumber>
  <mrclass>20H15 (20F55)</mrclass>
  <mrreviewer>François Digne</mrreviewer>
  <other type="coden">ACVMAL</other>
  <other type="fjournal">Archiv der Mathematik</other>
</article></entry>

<entry id="Dix67"><article>
  <author>
    <name><first>John D.</first><last>Dixon</last></name>
  </author>
  <title>High speed computation of group characters</title>
  <journal><value key="numem"/></journal>
  <year>1967</year>
  <volume>10</volume>
  <pages>446–450</pages>
  <issn>0029-599X</issn>
  <mrnumber>0224726 (37 #325)</mrnumber>
  <mrclass>20.80 (65.00)</mrclass>
  <mrreviewer>D. H. Lehmer</mrreviewer>
  <other type="fjournal">Numerische Mathematik</other>
</article></entry>

<entry id="DixonMortimer88"><article>
  <author>
    <name><first>John D.</first><last>Dixon</last></name>
    <name><first>Brian</first><last>Mortimer</last></name>
  </author>
  <title>The primitive permutation groups of degree less than
      <C><M>1000</M></C></title>
  <journal><value key="matpc"/></journal>
  <year>1988</year>
  <volume>103</volume>
  <number>2</number>
  <pages>213–238</pages>
  <issn>0305-0041</issn>
  <mrnumber>923674 (89b:20014)</mrnumber>
  <mrclass>20B10 (20B15 20B20)</mrclass>
  <mrreviewer>Wolfgang Knapp</mrreviewer>
  <other type="coden">MPCPCO</other>
  <other type="fjournal">Mathematical Proceedings of the Cambridge
      Philosophical
              Society</other>
</article></entry>

<entry id="Dix93"><incollection>
  <author>
    <name><first>John D.</first><last>Dixon</last></name>
  </author>
  <title>Constructing representations of finite groups</title>
  <booktitle>Groups and computation (New Brunswick, NJ, 1991)</booktitle>
  <publisher>Amer. Math. Soc.</publisher>
  <year>1993</year>
  <editor>
    <name><first>Larry</first><last>Finkelstein</last></name>
    <name><first>William M.</first><last>Kantor</last></name>
  </editor>
  <volume>11</volume>
  <series>DIMACS Ser. Discrete Math. Theoret. Comput. Sci.</series>
  <pages>105–112</pages>
  <address>Providence, RI</address>
  <crossref>DIMACS</crossref>
  <isbn>0-8218-6599-4</isbn>
  <mrnumber>1235797 (94h:20011)</mrnumber>
  <mrclass>20C15 (20C30)</mrclass>
  <mrreviewer>Peter Fleischmann</mrreviewer>
</incollection></entry>

<entry id="Dre69"><article>
  <author>
    <name><first>Andreas</first><last>Dress</last></name>
  </author>
  <title>A characterisation of solvable groups</title>
  <journal><value key="mathz"/></journal>
  <year>1969</year>
  <volume>110</volume>
  <pages>213–217</pages>
  <issn>0025-5874</issn>
  <mrnumber>0248239 (40 #1491)</mrnumber>
  <mrclass>20.80</mrclass>
  <mrreviewer>R. Schmidt</mrreviewer>
  <other type="fjournal">Mathematische Zeitschrift</other>
</article></entry>

<entry id="DuC91"><manual>
  <author>
    <name><first>F.</first><last>DuCloux</last></name>
  </author>
  <title>Coxeter Version 1.0</title>
  <organization>Université de Lyon</organization>
  <address>Lyon, France</address>
  <year>1991</year>
</manual></entry>

<entry id="Dye90"><article>
  <author>
    <name><first>Matthew</first><last>Dyer</last></name>
  </author>
  <title>Reflection subgroups of <C>C</C>oxeter systems</title>
  <journal><value key="jalge"/></journal>
  <year>1990</year>
  <volume>135</volume>
  <number>1</number>
  <pages>57–73</pages>
  <issn>0021-8693</issn>
  <mrnumber>1076077 (91j:20100)</mrnumber>
  <mrclass>20F55 (17B20 20H15)</mrclass>
  <mrreviewer>Robert Bédard</mrreviewer>
  <other type="coden">JALGA4</other>
  <other type="fjournal">Journal of Algebra</other>
</article></entry>

<entry id="EHR91"><article>
  <author>
    <name><first>D. B. A.</first><last>Epstein</last></name>
    <name><first>D. F.</first><last>Holt</last></name>
    <name><first>S. E.</first><last>Rees</last></name>
  </author>
  <title>The use of <C>K</C>nuth-<C>B</C>endix methods to solve the word
      problem
              in automatic groups</title>
  <journal><value key="jsymc"/></journal>
  <year>1991</year>
  <volume>12</volume>
  <number>4-5</number>
  <pages>397–414</pages>
  <note>Computational group theory, Part 2</note>
  <issn>0747-7171</issn>
  <mrnumber>1146506 (92m:68052)</mrnumber>
  <mrclass>68Q40 (03D40 20F10)</mrclass>
  <mrreviewer>Klaus Madlener</mrreviewer>
  <other type="fjournal">Journal of Symbolic Computation</other>
</article></entry>

<entry id="Eick97"><incollection>
  <author>
    <name><first>Bettina</first><last>Eick</last></name>
  </author>
  <title>Special presentations for finite soluble groups and computing
              (pre-)<C>F</C>rattini subgroups</title>
  <booktitle>Groups and computation, II (New Brunswick, NJ, 1995)</booktitle>
  <publisher>Amer. Math. Soc.</publisher>
  <year>1997</year>
  <editor>
    <name><first>Larry</first><last>Finkelstein</last></name>
    <name><first>William M.</first><last>Kantor</last></name>
  </editor>
  <volume>28</volume>
  <series>DIMACS Ser. Discrete Math. Theoret. Comput. Sci.</series>
  <pages>101–112</pages>
  <address>Providence, RI</address>
  <crossref>DIMACS2</crossref>
  <isbn>0-8218-0516-9</isbn>
  <mrnumber>1444133 (99a:20014)</mrnumber>
  <mrclass>20D10 (20-04)</mrclass>
</incollection></entry>

<entry id="EGN97"><article>
  <author>
    <name><first>Bettina</first><last>Eick</last></name>
    <name><first>Franz</first><last>Gähler</last></name>
    <name><first>Werner</first><last>Nickel</last></name>
  </author>
  <title>Computing maximal subgroups and <C>W</C>yckoff positions of space
              groups</title>
  <journal><value key="actcs1"/></journal>
  <year>1997</year>
  <volume>53</volume>
  <number>4</number>
  <pages>467–474</pages>
  <issn>0108-7673</issn>
  <mrnumber>1461658 (98g:20080)</mrnumber>
  <mrclass>20H15 (82D25)</mrclass>
  <mrreviewer>Vojtěch Kopský</mrreviewer>
  <other type="coden">ACACEQ</other>
  <other type="fjournal">Acta Crystallographica. Section A: Foundations of
              Crystallography</other>
</article></entry>

<entry id="EickHoefling02"><article>
  <author>
    <name><first>B.</first><last>Eick</last></name>
    <name><first>B.</first><last>Höfling</last></name>
  </author>
  <title>The solvable primitive permutation groups of degree at most
              6560</title>
  <journal>LMS J. Comput. Math.</journal>
  <year>2003</year>
  <volume>6</volume>
  <pages>29–39 (electronic)</pages>
  <issn>1461-1570</issn>
  <mrnumber>1971491 (2004a:20005)</mrnumber>
  <mrclass>20B15</mrclass>
  <mrreviewer>Xianhua Li</mrreviewer>
  <other type="fjournal">LMS Journal of Computation and Mathematics</other>
</article></entry>

<entry id="EickHulpke01"><inproceedings>
  <author>
      <name><first>Bettina</first><last>Eick</last></name>
      <name><first>Alexander</first><last>Hulpke</last></name>
  </author>
  <title>Computing the maximal subgroups of a permutation group <C>I</C></title>
  <pages>155–168</pages>
  <crossref>DIMACS3</crossref>
</inproceedings></entry>

<entry id="Ellis98"><article>
  <author>
    <name><first>Graham</first><last>Ellis</last></name>
  </author>
  <title>On the capability of groups</title>
  <journal><value key="proem2"/></journal>
  <year>1998</year>
  <volume>41</volume>
  <number>3</number>
  <pages>487–495</pages>
  <issn>0013-0915</issn>
  <mrnumber>1697585 (2000e:20053)</mrnumber>
  <mrclass>20E22 (20F28 20J05)</mrclass>
  <mrreviewer>J. Wiegold</mrreviewer>
  <other type="coden">PRMSA3</other>
  <other type="fjournal">Proceedings of the Edinburgh Mathematical Society.
      Series II</other>
</article></entry>

<entry id="ECHLPT92"><book>
  <author>
    <name><first>David B. A.</first><last>Epstein</last></name>
    <name><first>James W.</first><last>Cannon</last></name>
    <name><first>Derek F.</first><last>Holt</last></name>
    <name><first>Silvio V. F.</first><last>Levy</last></name>
    <name><first>Michael S.</first><last>Paterson</last></name>
    <name><first>William P.</first><last>Thurston</last></name>
  </author>
  <title>Word processing in groups</title>
  <publisher>Jones and Bartlett Publishers</publisher>
  <year>1992</year>
  <address>Boston, MA</address>
  <isbn>0-86720-244-0</isbn>
  <mrnumber>1161694 (93i:20036)</mrnumber>
  <mrclass>20F10 (03D40 20-02 68Q70)</mrclass>
  <mrreviewer>Richard M. Thomas</mrreviewer>
  <other type="pages">xii+330</other>
</book></entry>

<entry id="FJNT95"><incollection>
  <author>
    <name><first>V.</first><last>Felsch</last></name>
    <name><first>D. L.</first><last>Johnson</last></name>
    <name><first>J.</first><last>Neubüser</last></name>
    <name><first>S. V.</first><last>Tsaranov</last></name>
  </author>
  <title>The structure of certain <C>C</C>oxeter groups</title>
  <booktitle>Groups '93 Galway/St Andrews, Vol. 1 (Galway, 1993)
  <publisher>Cambridge Univ. Press</publisher>
  <year>1995</year>
  <volume>211</volume>
  <series>London Math. Soc. Lecture Note Ser.</series>
  <pages>177–190</pages>
  <address>Cambridge</address>
  <mrnumber>1342790 (96d:20028)</mrnumber>
  <mrclass>20F05 (20F55)</mrclass>
  <mrreviewer>Daan Krammer</mrreviewer>
</incollection></entry>

<entry id="FS84"><incollection>
  <author>
    <name><first>Volkmar</first><last>Felsch</last></name>
    <name><first>Günter</first><last>Sandlöbes</last></name>
  </author>
  <title>An interactive program for computing subgroups</title>
  <booktitle>Computational group theory (Durham, 1982)</booktitle>
  <publisher>Academic Press</publisher>
  <year>1984</year>
  <editor>
    <name><first>Michael D.</first><last>Atkinson</last></name>
  </editor>
  <pages>137–143</pages>
  <address>London</address>
  <crossref>Durham1982</crossref>
  <isbn>0-12-066270-1</isbn>
  <keywords>groups;  subgroup  lattice,  table  of  marks;  cyclic
                      extensions; program description</keywords>
  <mrnumber>760655 (85k:20003)</mrnumber>
  <mrclass>20-04 (20D10 68Q99)</mrclass>
</incollection></entry>

<entry id="FelschNeubueser79"><incollection>
  <author>
--> --------------------

--> maximum size reached

--> --------------------

quality99%

¤ Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.0.31Bemerkung: (vorverarbeitet) ¤

*Bot Zugriff

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.