default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAubrey Blecher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j16]Margaret Archibald, Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour:
Pushes in words-a primitive sorting algorithm. Contributions Discret. Math. 17(1): 56-69 (2022)- [j15]Aubrey Blecher
, Arnold Knopfmacher, Toufik Mansour:
Alphabetic points in restricted growth functions. Discret. Appl. Math. 309: 130-137 (2022) - [j14]Margaret Archibald, Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher:
Protected Cells in Compositions. Math. Comput. Sci. 16(1): 1 (2022) - 2021
- [j13]Margaret Archibald, Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour:
Impulse Propagation in Compositions and Words. Int. J. Math. Math. Sci. 2021: 8811261:1-8811261:6 (2021) - 2020
- [j12]Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher:
Water capacity of Dyck paths. Adv. Appl. Math. 112 (2020) - [j11]Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour:
A simple sorting algorithm for compositions. Discret. Math. Algorithms Appl. 12(6): 2050079:1-2050079:23 (2020) - [j10]Margaret Archibald, Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Stephan Wagner, Mark Daniel Ward:
The number of distinct adjacent pairs in geometrically distributed words. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j9]Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour, Mark Shattuck:
Counting Permutations by the Number of Vertical Edges in Their Bargraphs. J. Autom. Lang. Comb. 25(4): 279-290 (2020) - [j8]Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour:
The Depth of Compositions. Math. Comput. Sci. 14(1): 69-76 (2020)
2010 – 2019
- 2017
- [j7]Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour:
The perimeter of words. Discret. Math. 340(10): 2456-2465 (2017) - 2016
- [j6]Margaret Archibald, Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour:
Partitions according to multiplicities and part sizes. Australas. J Comb. 66: 104-119 (2016) - 2015
- [j5]Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher:
Levels in bargraphs. Ars Math. Contemp. 9(2): 287-300 (2015) - [j4]Margaret Archibald, Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher:
Greatest Descents after any Maxima in Compositions. Electron. J. Comb. 22(4): 4 (2015) - [j3]Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Helmut Prodinger:
The height and width of bargraphs. Discret. Appl. Math. 180: 36-44 (2015) - 2014
- [j2]Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher:
Descents after maxima in compositions. Discret. Math. Theor. Comput. Sci. 16(1): 61-72 (2014) - 2012
- [j1]Aubrey Blecher:
Compositions Of Positive Integers n Viewed As Alternating Sequences Of Increasing/Decreasing Partitions. Ars Comb. 106: 213-224 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
