default search action
Stan Wagon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2006
- [b3]Folkmar Bornemann
, Dirk Laurie, Stan Wagon, Jörg Waldvogel:
Vom Lösen numerischer Probleme - Ein Streifzug entlang der SIAM 10x10-Digit Challenge. Springer 2006, ISBN 978-3-540-34114-7, pp. I-XVI, 1-381 - 2004
- [b2]Folkmar Bornemann
The SIAM 100-Digit Challenge - A study in High-Accuracy Numerical Computing. SIAM 2004, ISBN 978-0-89871-561-3 - 1993
- [b1]Stan Wagon:
The Banach-Tarski paradox. Cambridge University Press 1993, ISBN 978-0-521-45704-0, pp. I-XVIII, 1-253
Journal Articles
- 2024
- [j46]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 131(1): 76-86 (2024) - [j45]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 131(2): 170-180 (2024) - [j44]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 131(3): 262-272 (2024) - [j43]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 131(4): 353-363 (2024) - [j42]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 131(5): 445-455 (2024) - [j41]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 131(6): 536-546 (2024) - [j40]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 131(7): 629-639 (2024) - [j39]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 131(8): 722-731 (2024) - 2023
- [j38]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 130(1): 86-95 (2023) - [j37]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 130(2): 187-196 (2023) - [j36]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 130(3): 285-294 (2023) - [j35]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 130(4): 385-394 (2023) - [j34]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 130(5): 485-494 (2023) - [j33]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 130(6): 587-596 (2023) - [j32]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 130(7): 679-688 (2023) - [j31]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 130(8): 765-778 (2023) - [j30]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 130(9): 862-872 (2023) - [j29]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 130(10): 952-962 (2023) - 2022
- [j28]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 129(1): 86-95 (2022) - [j27]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 129(2): 186-195 (2022) - [j26]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon:
Problems and Solutions. Am. Math. Mon. 129(3): 285-294 (2022) - [j25]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 129(4): 385-394 (2022) - [j24]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 129(5): 486-495 (2022) - [j23]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 129(6): 587-596 (2022) - [j22]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 129(7): 685-694 (2022) - [j21]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 129(8): 785-794 (2022) - [j20]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 129(9): 886-895 (2022) - [j19]Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West:
Problems and Solutions. Am. Math. Mon. 129(10): 985-994 (2022) - 2021
- [j18]Joe Buhler, Shahar Golan, Rob Pratt, Stan Wagon:
Littlewood polynomials, spectral-null codes, and equipowerful partitions. Math. Comput. 90(329): 1435-1453 (2021) - 2019
- [j17]Alan D. Taylor, Stan Wagon:
A Paradox Arising from the Elimination of a Paradox. Am. Math. Mon. 126(4): 306-318 (2019) - 2018
- [j16]Larry Carter, Stan Wagon:
The Mensa Correctional Institute. Am. Math. Mon. 125(4): 306-319 (2018) - 2017
- [j15]Witold Jarnicki, Wendy J. Myrvold, Peter W. Saltzman, Stan Wagon:
Properties, proved and conjectured, of Keller, Mycielski, and queen graphs. Ars Math. Contemp. 13(2): 427-460 (2017) - 2016
- [j14]Stan Wagon:
Round Formulas for Exponential Polynomials and the Incomplete Gamma Function. Integers 16: A79 (2016) - 2015
- [j13]Michael Dupuis, Stan Wagon:
Laceable knights. Ars Math. Contemp. 9(1): 115-124 (2015) - 2014
- [j12]Jon Grantham, Witold Jarnicki, John Rickert, Stan Wagon:
Repeatedly Appending Any Digit to Generate Composite Numbers. Am. Math. Mon. 121(5): 416-421 (2014) - 2012
- [j11]Barry J. Cox
Drilling for Polygons. Am. Math. Mon. 119(4): 300-312 (2012) - [j10]Stan Wagon:
Review: In Pursuit of the Traveling Salesman. Princeton University Press, Princeton, NJ, 2012 xiii + 228 pp., ISBN 978-0-691-15270-7, $27.95. by William J. Cook. Am. Math. Mon. 119(9): 808-811 (2012) - 2011
- [j9]Vittorio Addona, Stan Wagon, Herbert S. Wilf:
How to lose as little as possible. Ars Math. Contemp. 4(1): 29-62 (2011) - 2008
- [j8]Stan Wagon, Peter Webb:
Venn Symmetry and Prime Numbers: A Seductive Proof Revisited. Am. Math. Mon. 115(7): 645-648 (2008) - 2005
- [j7]Dale Beihoffer, Jemimah Hendry, Albert Nijenhuis, Stan Wagon:
Faster Algorithms for Frobenius Numbers. Electron. J. Comb. 12 (2005) - 2001
- [j6]John Renze, Stan Wagon, Brian Wick:
The Gaussian Zoo. Exp. Math. 10(2): 161-173 (2001) - 2000
- [j5]Tom Sibley, Stan Wagon:
Rhombic Penrose Tilings Can be 3-Colored. Am. Math. Mon. 107(3): 251-253 (2000) - 1994
- [j4]Stan Wagon, Herbert S. Wilf:
When are subset sums equidistributed modulo m? Electron. J. Comb. 1 (1994) - 1980
- [j3]Stanley Wagon:
A bound on the chromatic number of graphs without certain induced subgraphs. J. Comb. Theory B 29(3): 345-346 (1980) - 1978
- [j2]Stanley Wagon:
Infinite triangulated graphs. Discret. Math. 22(2): 183-189 (1978) - 1977
- [j1]James E. Baumgartner, Alan D. Taylor, Stanley Wagon:
On Splitting Stationary Subsets of Large Cardinals. J. Symb. Log. 42(2): 203-214 (1977)
Conference and Workshop Papers
- 2002
- [c1]Stan Wagon:
A machine resolution of a four-color hoax. CCCG 2002: 174-185
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-10-30 20:30 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: