Quelle  bib.xml   Sprache: XML

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

<entry id="AutoDoc"><manual>
  <author>
    <name><first>Sebastian</first><last>Gutsche</last></name>
    <name><first>Max</first><last>Horn</last></name>
  </author>
  <title><C>AutoDoc - Generate documentation from GAP source code (Version 2017.09.15)</C></title>
  <year>2017</year>
  <other type="note">
    GAP package, <URL>https://github.com/gap-packages/AutoDoc</URL>
  </other>
</manual></entry>

<entry id="GAPDoc"><manual>
  <author>
    <name><first>Frank</first><last>Lübeck</last></name>
    <name><first>Max</first><last>Neunhöffer</last></name>
  </author>
  <title><C>GAPDoc (version 1.6)</C></title>
  <organization>RWTH Aachen</organization>
  <year>2017</year>
  <other type="note">
    GAP package, 
    <URL>
      https://www.math.rwth-aachen.de/~Frank.Luebeck/gap/GAPDoc/index.html
    </URL> 
  </other>
</manual></entry>

<entry id="GitHubPagesForGAP"><manual>
  <author>
    <name><first>Max</first><last>Horn</last></name>
  </author>
  <title><C>GitHubPagesForGAP - Template for easily using GitHub Pages within GAP packages (Version 0.2)</C></title>
  <year>2017</year>
  <other type="note">
    GAP package, <URL>https://gap-system.github.io/GitHubPagesForGAP/</URL>
  </other>
</manual></entry>

<entry id="BrHe"><article>
  <author>
    <name><first>Ronald</first><last>Brown</last></name>
    <name><first>Anne</first><last>Heyworth</last></name>
  </author>  
  <title>Using rewriting systems to compute left Kan extensions 
         and induced actions of categories</title>
  <journal>J. Symbolic Comput.</journal>
  <year>2000</year>
  <volume>29</volume>
  <pages>5–31</pages>
</article></entry>

<entry id="BrGhHeWe"><article>
  <author>
    <name><first>Ronald</first><last>Brown</last></name>
    <name><first>Neil</first><last>Ghani</last></name>
    <name><first>Anne</first><last>Heyworth</last></name>
    <name><first>Christopher D.</first><last>Wensley</last></name>
  </author>  
  <title>String rewriting systems for double coset systems</title>
  <journal>J. Symbolic Comput.</journal>
  <year>2006</year>
  <volume>41</volume>
  <pages>573–590</pages>
</article></entry>

<entry id="anne-thesis"><phdthesis>
  <author>
    <name><first>Anne</first><last>Heyworth</last></name>
  </author>  
  <title>Applications of <C>R</C>ewriting <C>S</C>ystems and 
  <C>G</C>roebner Bases to <C>C</C>omputing <C>K</C>an <C>E</C>xtensions 
  and <C>I</C>dentities <C>A</C>mong <C>R</C>elations</title>
  <school>University of Wales, Bangor</school>
  <year>1999</year>
  <note>
    <URL>https://www.researchgate.net/profile/Anne-Heyworth/research</URL>
  </note>
</phdthesis></entry>

<entry id="SteveL"><article>
  <author>
    <name><first>Steve</first><last>Linton</last></name>
  </author>  
  <title>Double coset enumeration</title>
  <journal>J. Symbolic Comput.</journal>
  <year>1991</year>
  <volume>12</volume>
  <pages>415–426</pages>
</article></entry>

</file>