default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicholas A. Loehr
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Nicholas A. Loehr, Gregory S. Warrington
:
A rooted variant of Stanley's chromatic symmetric function. Discret. Math. 347(3): 113805 (2024)- 2021
- [j36]Nicholas A. Loehr, Gregory S. Warrington:
Abacus-histories and the combinatorics of creation operators. J. Comb. Theory A 177: 105330 (2021)
2010 – 2019
- 2019
- [j35]Nicholas A. Loehr:
Successor algorithms via counting arguments. Bull. ICA 86: 101-122 (2019) - [j34]Nicholas A. Loehr, Gregory S. Warrington:
Quasisymmetric and Schur expansions of cycle index polynomials. Discret. Math. 342(1): 113-127 (2019) - 2018
- [j33]Nicholas A. Loehr, T. S. Michael:
The Combinatorics of Evenly Spaced Binomial Coefficients. Integers 18: A89 (2018) - [j32]Kyungyong Lee, Li Li, Nicholas A. Loehr:
A Combinatorial Approach to the Symmetry of q, t-Catalan Numbers. SIAM J. Discret. Math. 32(1): 191-232 (2018) - 2017
- [j31]Nicholas A. Loehr:
Variants of the RSK algorithm adapted to combinatorial Macdonald polynomials. J. Comb. Theory A 146: 129-164 (2017) - 2016
- [j30]Nicholas A. Loehr, Andrew J. Wills:
Abacus-tournament models for Hall-Littlewood polynomials. Discret. Math. 339(10): 2423-2445 (2016) - [j29]Kenneth Barrese, Nicholas A. Loehr, Jeffrey B. Remmel, Bruce E. Sagan:
Bijections on m-level rook placements. Eur. J. Comb. 57: 13-35 (2016) - 2014
- [j28]Nicholas A. Loehr, Elizabeth M. Niese:
New combinatorial formulations of the shuffle conjecture. Adv. Appl. Math. 55: 22-47 (2014) - [j27]Kenneth Barrese, Nicholas A. Loehr, Jeffrey B. Remmel, Bruce E. Sagan:
m-Level rook placements. J. Comb. Theory A 124: 130-165 (2014) - 2013
- [j26]Katherine P. Benedetto, Nicholas A. Loehr:
Domino Tiling Graphs. Ars Comb. 109: 3-29 (2013) - [j25]Kyungyong Lee, Li Li, Nicholas A. Loehr:
Limits of Modified Higher q,t-Catalan Numbers. Electron. J. Comb. 20(3): 4 (2013) - [j24]Nicholas A. Loehr, Luis G. Serrano, Gregory S. Warrington:
Transition matrices for symmetric and quasisymmetric Hall-Littlewood polynomials. J. Comb. Theory A 120(8): 1996-2019 (2013) - 2012
- [j23]William Kaczynski, Lawrence M. Leemis, Nicholas A. Loehr, J. McQueston:
Nonparametric Random Variate Generation Using a Piecewise-Linear Cumulative Distribution Function. Commun. Stat. Simul. Comput. 41(4): 449-468 (2012) - [j22]William Kaczynski, Lawrence M. Leemis, Nicholas A. Loehr, J. McQueston:
Bivariate Nonparametric Random Variate Generation Using a Piecewise-Linear Cumulative Distribution Function. Commun. Stat. Simul. Comput. 41(4): 469-496 (2012) - 2011
- [j21]Nicholas A. Loehr, Elizabeth M. Niese:
Recursions and divisibility properties for combinatorial Macdonald polynomials. Discret. Math. Theor. Comput. Sci. 13(1): 21-44 (2011) - 2010
- [j20]Eric S. Egge, Nicholas A. Loehr, Gregory S. Warrington:
From quasisymmetric expansions to Schur expansions via a modified inverse Kostka matrix. Eur. J. Comb. 31(8): 2014-2027 (2010) - [j19]Nicholas A. Loehr, Carla D. Savage:
Generalizing the Combinatorics of Binomial Coefficients Via l-Nomials. Integers 10: A45 (2010) - [j18]Nicholas A. Loehr:
Abacus Proofs of Schur Function Identities. SIAM J. Discret. Math. 24(4): 1356-1370 (2010)
2000 – 2009
- 2009
- [j17]Nicholas A. Loehr, Jeffrey B. Remmel:
Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences. Adv. Appl. Math. 42(4): 483-503 (2009) - [j16]Nicholas A. Loehr, Gregory S. Warrington:
A continuous family of partition statistics equidistributed with length. J. Comb. Theory A 116(2): 379-403 (2009) - [j15]Ezra Brown, Nicholas A. Loehr:
Why Is PSL(2, 7) ≅ GL(3, 2)? Am. Math. Mon. 116(8): 727-732 (2009) - 2008
- [j14]Nicholas A. Loehr, Bruce E. Sagan, Gregory S. Warrington:
A human proof for a generalization of Shalosh B. Ekhad's 10n Lattice Paths Theorem. Ars Comb. 89 (2008) - [j13]Katherine P. Benedetto, Nicholas A. Loehr:
Tiling problems, automata, and tiling graphs. Theor. Comput. Sci. 407(1-3): 400-411 (2008) - 2007
- [j12]Nicholas A. Loehr:
The Major Index Specialization of the q, t-Catalan. Ars Comb. 83 (2007) - 2006
- [j11]Mahir Bilen Can, Nicholas A. Loehr:
A proof of the q, t-square conjecture. J. Comb. Theory A 113(7): 1419-1434 (2006) - 2005
- [j10]Nicholas A. Loehr:
Combinatorics of q, t-parking functions. Adv. Appl. Math. 34(2): 408-425 (2005) - [j9]Nicholas A. Loehr:
Conjectured Statistics for the Higher q, t-Catalan Sequences. Electron. J. Comb. 12 (2005) - [j8]James Haglund, Nicholas A. Loehr:
A conjectured combinatorial formula for the Hilbert series for diagonal harmonics. Discret. Math. 298(1-3): 189-204 (2005) - [j7]Nicholas A. Loehr:
Permutation statistics and the q, t-Catalan sequence. Eur. J. Comb. 26(1): 83-93 (2005) - [j6]James Haglund, Nicholas A. Loehr, Jeffrey B. Remmel:
Statistics on wreath products, perfect matchings, and signed words. Eur. J. Comb. 26(6): 835-868 (2005) - 2004
- [j5]Nicholas A. Loehr, Jeffrey B. Remmel:
Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules. Electron. J. Comb. 11(1) (2004) - [j4]Nicholas A. Loehr:
Note on André's reflection principle. Discret. Math. 280(1-3): 233-236 (2004) - [j3]Lenwood S. Heath, Nicholas A. Loehr:
New algorithms for generating Conway polynomials over finite fields. J. Symb. Comput. 38(2): 1003-1024 (2004) - 2003
- [j2]Nicholas A. Loehr:
Trapezoidal lattice paths and multivariate analogues. Adv. Appl. Math. 31(4): 597-629 (2003)
1990 – 1999
- 1999
- [c1]Lenwood S. Heath, Nicholas A. Loehr:
New Algorithms for Generating Conway Polynomials Over Finite Fields. SODA 1999: 429-437 - 1995
- [j1]Paul K. Stockmeyer, C. Douglass Bateman, James W. Clark, Cyrus R. Eyster, Matthew T. Harrison, Nicholas A. Loehr, Patrick J. Rodriguez, Joseph R. Simmons III:
Exchanging disks in the tower of hanoi. Int. J. Comput. Math. 59(1-2): 37-47 (1995)
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 2025-01-09 12:48 CET 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:
