<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
         "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>GAP (PatternClass) - References</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chapBib"  onload="jscontent()">


<div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a>  <a href="chap1.html">1</a>  <a href="chap2.html">2</a>  <a href="chap3.html">3</a>  <a href="chap4.html">4</a>  <a href="chap5.html">5</a>  <a href="chap6.html">6</a>  <a href="chap7.html">7</a>  <a href="chap8.html">8</a>  <a href="chap9.html">9</a>  <a href="chap10.html">10</a>  <a href="chapBib.html">Bib</a>  <a href="chapInd.html">Ind</a>  </div>

<div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a>   <a href="chap0.html#contents">[Contents]</a>    <a href="chap10.html">[Previous Chapter]</a>    <a href="chapInd.html">[Next Chapter]</a>   </div>

<p id="mathjaxlink" class="pcenter"><a href="chapBib_mj.html">[MathJax on]</a></p>
<p><a id="X7A6F98FD85F02BFE" name="X7A6F98FD85F02BFE"></a></p>

<h3>References</h3>


<p><a id="biBSimpAndPRestrPerms" name="biBSimpAndPRestrPerms"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>AA05</span>]   <b class='BibAuthor'>Albert, M. H. and Atkinson, M. D.</b>,
<a href="http://www.sciencedirect.com/science/article/pii/S0012365X05003377"><i class='BibTitle'>Simple permutations and pattern restricted permutations</i></a>,
 <span class='BibJournal'>Discrete Mathematics</span>,
 <em class='BibVolume'>300</em> (<span class='BibNumber'>1--3</span>)
 (<span class='BibYear'>2005</span>),
 <span class='BibPages'>1 -- 15</span><br />
(<span class='BibNote'></span>).
</p>


<p><a id="biBRegCloSetPerms" name="biBRegCloSetPerms"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>AAR03</span>]   <b class='BibAuthor'>Albert, M. H., Atkinson, M. D. and Ru\v{s}kuc, N.</b>,
<a href="http://search.ebscohost.com/login.aspx?direct=true&db=edselp&AN=S0304397503002123&site=eds-live"><i class='BibTitle'>Regular closed sets of permutations</i></a>,
 <span class='BibJournal'>Theoretical Computer Science</span>,
 <em class='BibVolume'>306</em>
 (<span class='BibYear'>2003</span>),
 <span class='BibPages'>85 - 100</span>.
</p>


<p><a id="biBPermGenTPGraph" name="biBPermGenTPGraph"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>ALTnd</span>]   <b class='BibAuthor'>Atkinson, M. D., Livesey, M. J. and Tulley, D.</b>,
<a href="http://search.ebscohost.com/login.aspx?direct=true&db=edswsc&AN=A1997XB56400004&site=eds-live"><i class='BibTitle'>Permutations generated by token passing in graphs</i></a>,
 <span class='BibJournal'>Theoretical Computer Science</span>,
 <em class='BibVolume'>178</em>
 (<span class='BibYear'>n.d.</span>),
 <span class='BibPages'>103 - 118</span>.
</p>


<p><a id="biBSimpSurv" name="biBSimpSurv"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Bri08</span>]   <b class='BibAuthor'>Brignall, R.</b>,
 <i class='BibTitle'>A Survey of Simple Permutations</i>,
 <span class='BibJournal'>ArXiv e-prints</span>
 (<span class='BibYear'>2008</span>).
</p>


<p><a id="biBUpBndStanWilf1324" name="biBUpBndStanWilf1324"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>CJS11</span>]   <b class='BibAuthor'>Claesson, A., Jel{\'{i}}nek, V. and Steingr{\'{i}}msson, E.</b>,
 <i class='BibTitle'>Upper bounds for the Stanley-Wilf limit of 1324 and other layered
      patterns</i>,
 <span class='BibJournal'>ArXiv e-prints</span>
 (<span class='BibYear'>2011</span>).
</p>


<p><a id="biBRegLangPlusMinPerms" name="biBRegLangPlusMinPerms"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>HL13</span>]   <b class='BibAuthor'>Hoffmann, R. and Linton, S.</b>,
 <i class='BibTitle'>Regular Languages of Plus- and Minus- (In)Decomposable
      Permutations</i>,
 <span class='BibJournal'>Pure Mathematics and Applications (to appear)</span>
 (<span class='BibYear'>2013</span>).
</p>


<p><a id="biBSimpPermsPoset" name="biBSimpPermsPoset"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>PR12</span>]   <b class='BibAuthor'>Pierrot, A. and Rossin, D.</b>,
 <i class='BibTitle'>Simple permutations poset</i>,
 <span class='BibJournal'>ArXiv e-prints</span>
 (<span class='BibYear'>2012</span>),
 <span class='BibPages'>1--15</span>.
</p>


<p><a id="biBFAlgsEnumAllCommIntsof2Perms" name="biBFAlgsEnumAllCommIntsof2Perms"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>UY00</span>]   <b class='BibAuthor'>Uno, T. and Yagiura, M.</b>,
 <i class='BibTitle'>Fast Algorithms to Enumerate All Common Intervals of Two
      Permutations</i>,
 <span class='BibJournal'>Algorithmica</span>,
 <em class='BibVolume'>26</em>
 (<span class='BibYear'>2000</span>),
 <span class='BibPages'>2000</span>.
</p>

<p> </p>


<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a>   <a href="chap0.html#contents">[Contents]</a>    <a href="chap10.html">[Previous Chapter]</a>    <a href="chapInd.html">[Next Chapter]</a>   </div>


<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a>  <a href="chap1.html">1</a>  <a href="chap2.html">2</a>  <a href="chap3.html">3</a>  <a href="chap4.html">4</a>  <a href="chap5.html">5</a>  <a href="chap6.html">6</a>  <a href="chap7.html">7</a>  <a href="chap8.html">8</a>  <a href="chap9.html">9</a>  <a href="chap10.html">10</a>  <a href="chapBib.html">Bib</a>  <a href="chapInd.html">Ind</a>  </div>

<hr />
<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>