Lapo CioniUniversity of Pisa, Italy, Luca FerrariUniversity of Firenze, Italy, Rebecca SmithSUNY Brockport
{"title":"带旁路的弹出堆栈","authors":"Lapo CioniUniversity of Pisa, Italy, Luca FerrariUniversity of Firenze, Italy, Rebecca SmithSUNY Brockport","doi":"arxiv-2406.16399","DOIUrl":null,"url":null,"abstract":"We consider sorting procedures for permutations making use of pop stacks with\na bypass operation, and explore the combinatorial properties of the associated\nalgorithms.","PeriodicalId":501216,"journal":{"name":"arXiv - CS - Discrete Mathematics","volume":"46 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Pop Stacks with a Bypass\",\"authors\":\"Lapo CioniUniversity of Pisa, Italy, Luca FerrariUniversity of Firenze, Italy, Rebecca SmithSUNY Brockport\",\"doi\":\"arxiv-2406.16399\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider sorting procedures for permutations making use of pop stacks with\\na bypass operation, and explore the combinatorial properties of the associated\\nalgorithms.\",\"PeriodicalId\":501216,\"journal\":{\"name\":\"arXiv - CS - Discrete Mathematics\",\"volume\":\"46 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2406.16399\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.16399","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We consider sorting procedures for permutations making use of pop stacks with
a bypass operation, and explore the combinatorial properties of the associated
algorithms.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
