default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlbert Nijenhuis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j16]Albert Nijenhuis:
Short Gamma Products with Simple Values. Am. Math. Mon. 117(8): 733-737 (2010)
2000 – 2009
- 2005
- [j15]Dale Beihoffer, Jemimah Hendry, Albert Nijenhuis, Stan Wagon:
Faster Algorithms for Frobenius Numbers. Electron. J. Comb. 12 (2005) - 2004
- [j14]David Lubell, Chris Hill, Albert Nijenhuis:
Equal Sums of Reciprocal Products: 10992. Am. Math. Mon. 111(9): 827-829 (2004) - 2003
- [j13]Joaquín Gómez Rey, Albert Nijenhuis, Doyle Henderson, Damuele Riccarelli, Richard Stong:
An Unexpected Integer: 10886. Am. Math. Mon. 110(4): 344-345 (2003) - [j12]Roland Bacher, Albert Nijenhuis:
A Surprisingly Simple Determinant: 10891. Am. Math. Mon. 110(5): 439-440 (2003) - 2002
- [j11]Ovidiu Furdui, Albert Nijenhuis:
A Square Property: 10904. Am. Math. Mon. 109(9): 860-861 (2002) - 2000
- [j10]Michael Golomb, G. Donald Chakerian, Robin J. Chapman, John H. Lindsey II, O. P. Lossers, Albert Nijenhuis:
Points That Form Simplices of Equal Volume: 10685. Am. Math. Mon. 107(1): 91 (2000) - [j9]Marcin Mazur, Kit Hanes, Jean Anglesio, M. Benedicty, Shalosh B. Ekhad, N. Lakshmanan, Albert Nijenhuis, John H. Smith:
Tangent Lines and Collinear Points: 10673. Am. Math. Mon. 107(2): 180-181 (2000) - [j8]Ioan Tomescu, Kee-Wai Lau, O. P. Lossers, Kenneth F. Andersen, Robin J. Chapman, Óscar Ciaurri, E. Fernandez, Valerio De Angelis, Emeric Deutsch, G. Will, M. Falkowitz, Zachary Franco, C. Georghiou, J. Lewandowski, Albert Nijenhuis, Timothy S. Norfolk, Allen Stenger:
Complex Roots of a Polynomial: 10688. Am. Math. Mon. 107(2): 181-182 (2000) - [j7]Wu Wei Chao, Michael Reid, F. Bellot Rosado, Robin J. Chapman, Daniele Donini, Shalosh B. Ekhad, N. Lakshmanan, O. P. Lossers, Albert Nijenhuis, Peter Nüesch, C. G. Petalas:
Incenters and Excenters: 10693. Am. Math. Mon. 107(2): 182-184 (2000) - [j6]Iliya Bluskov, Albert Nijenhuis:
A Useful and Surprising Limit: 10695. Am. Math. Mon. 107(8): 756-757 (2000)
1980 – 1989
- 1984
- [j5]Albert Nijenhuis, Anita E. Solow, Herbert S. Wilf:
Bijective Methods in the Theory of Finite Vector Spaces. J. Comb. Theory A 37(1): 80-84 (1984) - [j4]Curtis Greene, Albert Nijenhuis, Herbert S. Wilf:
Another Probabilistic Method in the Theory of Young Tableaux. J. Comb. Theory A 37(2): 127-135 (1984)
1970 – 1979
- 1979
- [j3]Albert Nijenhuis, Herbert S. Wilf:
The Enumeration of Connected Graphs and Linked Diagrams. J. Comb. Theory A 27(3): 356-359 (1979) - 1976
- [j2]Albert Nijenhuis:
On Permanents and the Zeros of Rook Polynomials. J. Comb. Theory A 21(2): 240-244 (1976) - 1975
- [j1]Albert Nijenhuis, Herbert S. Wilf:
A Method and Two Algorithms on the Theory of Partitions. J. Comb. Theory A 18(2): 219-222 (1975)
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-06-10 21:24 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:
