Quelle bibliography.bib Sprache: Latech

@article{RegCloSetPerms,
Author = {M.H. Albert and M.D. Atkinson and N. Ru\v{s}kuc},
Journal = {Theoretical Computer Science},
Pages = {85 - 100},
Title = {Regular closed sets of permutations},
Volume = {306},
URL = {http://search.ebscohost.com/login.aspx?direct=true&db=edselp&AN=S0304397503002123&site=eds-live},
Year = {2003}
}
@article{PermGenTPGraph,
Author = { M.D. Atkinson and M.J. Livesey and D. Tulley},
Journal = {Theoretical Computer Science},
Pages = {103 - 118},
Title = {Permutations generated by token passing in graphs},
Volume = {178},
URL = {http://search.ebscohost.com/login.aspx?direct=true&db=edswsc&AN=A1997XB56400004&site=eds-live},
Year = {n.d.}
}
@ARTICLE{FAlgsEnumAllCommIntsof2Perms,
    author = {Takeaki Uno and Mutsunori Yagiura},
    title = {Fast Algorithms to Enumerate All Common Intervals of Two Permutations},
    journal = {Algorithmica},
    year = {2000},
    volume = {26},
    pages = {2000}
}
@ARTICLE{UpBndStanWilf1324,
    author = {Anders Claesson and V{\'{i}}t Jel{\'{i}}nek and Einar Steingr{\'{i}}msson},
    title = "{Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns}",
    journal = {ArXiv e-prints},
    archivePrefix = {arXiv},
    eprint = {1111.5736},
    primaryClass = {math.CO},
    year = {2011},
    month = nov
}
@ARTICLE{SimpSurv,
    author = {Robert Brignall},
    title = {A Survey of Simple Permutations},
    journal = {ArXiv e-prints},
    archivePrefix = {arXiv},
    eprint = {0801.0963},
    primaryClass = {math.CO},
    year = {2008},
    month = jun
}
@ARTICLE{SimpAndPRestrPerms,
    author = {M.H. Albert and M.D. Atkinson},
    title = {Simple permutations and pattern restricted permutations},
    journal = {Discrete Mathematics},
    volume = {300},
    number = {1--3},
    pages = {1 -- 15},
    year = {2005},
    note = {},
    issn = {0012-365X},
    doi = {DOI: 10.1016/j.disc.2005.06.016},
    url = {http://www.sciencedirect.com/science/article/pii/S0012365X05003377}
}
@article{RegLangPlusMinPerms,
author = {Hoffmann, Ruth and Linton, Steve},
journal = {Pure Mathematics and Applications (to appear)},
keywords = {automaton,permutation,permutation class,permutation pattern,word},
title = {{Regular Languages of Plus- and Minus- (In)Decomposable Permutations}},
year = {2013}
}
@article{SimpPermsPoset,
author = {Pierrot, Adeline and Rossin, Dominique},
journal = {ArXiv e-prints},
month = jan,
pages = {1--15},
title = {{Simple permutations poset}},
year = {2012}
}

quality87%

¤ 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.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.