Ziele Untersuchung
mit Columbo Integrität von
Datenbanken Interaktion und
Portierbarkeit Ergonomie der
Schnittstellen

Angebot Produkte Projekt Beratung

Mittel Analytik Modellierung Sprachen Algebra Logik Hardware Denken Kreativität

Zusammenhänge Gesellschaft Wirtschaft Branche Firma


products/Sources/formale Sprachen/GAP/pkg/patternclass/doc/ (Algebra von RWTH Aachen Version 4.15.1^©) Datei vom 30.7.2024 mit Größe 6 kB

Quelle chapBib_mj.html Sprache: HTML

products/Sources/formale Sprachen/GAP/pkg/patternclass/doc/chapBib_mj.html

<?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>
<script type="text/javascript"
 src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</script>
<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">Goto Chapter: <a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chap4_mj.html">4</a> <a href="chap5_mj.html">5</a> <a href="chap6_mj.html">6</a> <a href="chap7_mj.html">7</a> <a href="chap8_mj.html">8</a> <a href="chap9_mj.html">9</a> <a href="chap10_mj.html">10</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>

<div class="chlinkprevnexttop"> <a href="chap0_mj.html">[Top of Book]</a> <a href="chap0_mj.html#contents">[Contents]</a> <a href="chap10_mj.html">[Previous Chapter]</a> <a href="chapInd_mj.html">[Next Chapter]</a> </div>

<a href="chapBib.html">[MathJax off]</a>
<a id="X7A6F98FD85F02BFE" name="X7A6F98FD85F02BFE"></a>

<h3>References</h3>

<a id="biBSimpAndPRestrPerms" name="biBSimpAndPRestrPerms"></a>

[AA05] Albert, M. H. and Atkinson, M. D.,
<a href="http://www.sciencedirect.com/science/article/pii/S0012365X05003377">Simple permutations and pattern restricted permutations</a>,
Discrete Mathematics,
300 (1--3)
(2005),
1 -- 15 
().


<a id="biBRegCloSetPerms" name="biBRegCloSetPerms"></a>

[AAR03] Albert, M. H., Atkinson, M. D. and Ru\v{s}kuc, N.,
<a href="http://search.ebscohost.com/login.aspx?direct=true&db=edselp&AN=S0304397503002123&site=eds-live">Regular closed sets of permutations</a>,
Theoretical Computer Science,
306
(2003),
85 - 100.


<a id="biBPermGenTPGraph" name="biBPermGenTPGraph"></a>

[ALTnd] Atkinson, M. D., Livesey, M. J. and Tulley, D.,
<a href="http://search.ebscohost.com/login.aspx?direct=true&db=edswsc&AN=A1997XB56400004&site=eds-live">Permutations generated by token passing in graphs</a>,
Theoretical Computer Science,
178
(n.d.),
103 - 118.


<a id="biBSimpSurv" name="biBSimpSurv"></a>

[Bri08] Brignall, R.,
A Survey of Simple Permutations,
ArXiv e-prints
(2008).


<a id="biBUpBndStanWilf1324" name="biBUpBndStanWilf1324"></a>

[CJS11] Claesson, A., Jel{\'{i}}nek, V. and Steingr{\'{i}}msson, E.,
Upper bounds for the Stanley-Wilf limit of 1324 and other layered
 patterns,
ArXiv e-prints
(2011).


<a id="biBRegLangPlusMinPerms" name="biBRegLangPlusMinPerms"></a>

[HL13] Hoffmann, R. and Linton, S.,
Regular Languages of Plus- and Minus- (In)Decomposable
 Permutations,
Pure Mathematics and Applications (to appear)
(2013).


<a id="biBSimpPermsPoset" name="biBSimpPermsPoset"></a>

[PR12] Pierrot, A. and Rossin, D.,
Simple permutations poset,
ArXiv e-prints
(2012),
1--15.


<a id="biBFAlgsEnumAllCommIntsof2Perms" name="biBFAlgsEnumAllCommIntsof2Perms"></a>

[UY00] Uno, T. and Yagiura, M.,
Fast Algorithms to Enumerate All Common Intervals of Two
 Permutations,
Algorithmica,
26
(2000),
2000.


 

<div class="chlinkprevnextbot"> <a href="chap0_mj.html">[Top of Book]</a> <a href="chap0_mj.html#contents">[Contents]</a> <a href="chap10_mj.html">[Previous Chapter]</a> <a href="chapInd_mj.html">[Next Chapter]</a> </div>

<div class="chlinkbot">Goto Chapter: <a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chap4_mj.html">4</a> <a href="chap5_mj.html">5</a> <a href="chap6_mj.html">6</a> <a href="chap7_mj.html">7</a> <a href="chap8_mj.html">8</a> <a href="chap9_mj.html">9</a> <a href="chap10_mj.html">10</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>

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

quality100%

¤ Dauer der Verarbeitung: 0.1 Sekunden (vorverarbeitet) ¤

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.