BibTeX records: Connor Ahlbach

download as .bib file

@article{DBLP:journals/combinatorics/AhlbachS18,
  author    = {Connor Ahlbach and
               Joshua P. Swanson},
  title     = {Cyclic Sieving, Necklaces, and Branching Rules Related to Thrall's
               Problem},
  journal   = {Electron. J. Comb.},
  volume    = {25},
  number    = {4},
  pages     = {P4.42},
  year      = {2018},
  url       = {https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p42},
  timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/combinatorics/AhlbachS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/AhlbachS18,
  author    = {Connor Ahlbach and
               Joshua P. Swanson},
  title     = {Refined cyclic sieving on words for the major index statistic},
  journal   = {Eur. J. Comb.},
  volume    = {73},
  pages     = {37--60},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ejc.2018.05.003},
  doi       = {10.1016/j.ejc.2018.05.003},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ejc/AhlbachS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/AhlbachUP13,
  author    = {Connor Ahlbach and
               Jeremy Usatine and
               Nicholas Pippenger},
  title     = {Barred Preferential Arrangements},
  journal   = {Electron. J. Comb.},
  volume    = {20},
  number    = {2},
  pages     = {P55},
  year      = {2013},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p55},
  timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/combinatorics/AhlbachUP13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AhlbachUP13,
  author    = {Connor Ahlbach and
               Jeremy Usatine and
               Nicholas Pippenger},
  title     = {Gap Theorems for the Delay of Circuits Simulating Finite Automata},
  journal   = {CoRR},
  volume    = {abs/1308.2970},
  year      = {2013},
  url       = {http://arxiv.org/abs/1308.2970},
  archivePrefix = {arXiv},
  eprint    = {1308.2970},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/AhlbachUP13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-4497,
  author    = {Connor Ahlbach and
               Jeremy Usatine and
               Nicholas Pippenger},
  title     = {Efficient Algorithms for Zeckendorf Arithmetic},
  journal   = {CoRR},
  volume    = {abs/1207.4497},
  year      = {2012},
  url       = {http://arxiv.org/abs/1207.4497},
  archivePrefix = {arXiv},
  eprint    = {1207.4497},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1207-4497.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics