default search action
Anthony John Guttmann
Person information
- affiliation: University of Melbourne, VIC, Australia
- affiliation (former): University of Newcastle, NSW, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Anthony J. Guttmann, Paolo Massazza:
Asymptotics of Z-convex polyominoes. RAIRO Theor. Informatics Appl. 58: 12 (2024) - 2023
- [j29]Anthony J. Guttmann, Iwan Jensen
:
The gerrymander sequence, or A348456. Adv. Appl. Math. 148: 102520 (2023) - [i4]Andrew R. Conway, Anthony J. Guttmann:
Counting occurrences of patterns in permutations. CoRR abs/2306.12682 (2023) - 2022
- [j28]Nathan Clisby, Andrew R. Conway, Anthony J. Guttmann, Yuma Inoue:
Classical Length-5 Pattern-Avoiding Permutations. Electron. J. Comb. 29(3) (2022) - [j27]Andrew R. Conway, Miles Conway, Andrew Elvey Price, Anthony J. Guttmann:
Pattern-Avoiding Ascent Sequences of Length 3. Electron. J. Comb. 29(4) (2022) - 2021
- [j26]Colin Defant, Andrew Elvey Price, Anthony J. Guttmann:
Asymptotics of 3-Stack-Sortable Permutations. Electron. J. Comb. 28(2): 2 (2021) - 2020
- [j25]Alin Bostan, Andrew Elvey Price, Anthony John Guttmann, Jean-Marie Maillard:
Stieltjes Moment Sequences for Pattern-Avoiding Permutations. Electron. J. Comb. 27(4): 4 (2020) - [j24]Freeman J. Dyson, Norman E. Frankel, Anthony J. Guttmann:
SanD Primes and Numbers. J. Integer Seq. 23(3): 20.3.4 (2020) - [i3]Alin Bostan, Andrew Elvey Price, Anthony John Guttmann, Jean-Marie Maillard:
Stieltjes moment sequences for pattern-avoiding permutations. CoRR abs/2001.00393 (2020)
2010 – 2019
- 2019
- [j23]Andrew Elvey Price, Anthony J. Guttmann:
Numerical studies of Thompson's group F and related groups. Int. J. Algebra Comput. 29(2): 179-243 (2019) - [j22]Richard P. Brent, M. L. Glasser, Anthony J. Guttmann:
A Conjectured Integer Sequence Arising From the Exponential Integral. J. Integer Seq. 22(4): 19.4.7 (2019) - 2018
- [j21]Andrew R. Conway, Anthony J. Guttmann, Paul Zinn-Justin
1324-avoiding permutations revisited. Adv. Appl. Math. 96: 312-333 (2018) - [j20]Andrew Elvey Price
Counting planar Eulerian orientations. Eur. J. Comb. 71: 73-98 (2018) - 2017
- [j19]Andrew Elvey Price
Permutations sortable by two stacks in series. Adv. Appl. Math. 83: 81-96 (2017) - [j18]Nicholas R. Beaton
On consecutive pattern-avoiding permutations of length 4, 5 and beyond. Discret. Math. Theor. Comput. Sci. 19(2) (2017) - [j17]Andrew Elvey Price
Permutations sortable by deques and by two stacks in parallel. Eur. J. Comb. 59: 71-95 (2017) - 2015
- [j16]Andrew R. Conway, Anthony J. Guttmann
On 1324-avoiding permutations. Adv. Appl. Math. 64: 50-69 (2015) - [i2]Andrew Elvey Price, Anthony J. Guttmann:
Permutations sortable by two stacks in series. CoRR abs/1510.08663 (2015) - 2014
- [i1]Andrew R. Conway, Anthony J. Guttmann:
On the growth rate of 1324-avoiding permutations. CoRR abs/1405.6802 (2014) - 2012
- [j15]Nicholas R. Beaton
Some New Self-avoiding Walk and Polygon Models. Fundam. Informaticae 117(1-4): 19-33 (2012) - 2011
- [j14]Nicholas R. Beaton
The enumeration of prudent polygons by area and its unusual asymptotics. J. Comb. Theory A 118(8): 2261-2290 (2011)
2000 – 2009
- 2009
- [j13]Philip Broadbridge, Anthony J. Guttmann
Concepts of Entropy and Their Applications. Entropy 11(1): 59-61 (2009) - 2008
- [j12]Christoph Richard, Iwan Jensen, Anthony J. Guttmann:
Area Distribution and Scaling Function for Punctured Polygons. Electron. J. Comb. 15(1) (2008) - [j11]John C. Dethridge, Anthony J. Guttmann
Prudent Self-Avoiding Walks. Entropy 10(3): 309-318 (2008) - 2005
- [j10]W. R. G. James, Anthony J. Guttmann
Families of m-convex polygons: m=1. Adv. Appl. Math. 34(4): 812-844 (2005) - 2003
- [j9]Markus Vöge, Anthony J. Guttmann
On the number of hexagonal polyominoes. Theor. Comput. Sci. 307(2): 433-453 (2003) - [c1]Yao-ban Chan, Anthony J. Guttmann:
Some results for directed lattice walkers in a strip. DRW 2003: 27-38 - 2002
- [j8]Markus Vöge, Anthony J. Guttmann
On the Number of Benzenoid Hydrocarbons. J. Chem. Inf. Comput. Sci. 42(3): 456-466 (2002) - 2001
- [j7]Anthony J. Guttmann
Enumerations in statistical mechanics and combinatorics. Comput. Sci. Eng. 3(3): 42-47 (2001) - 2000
- [j6]Anthony J. Guttmann:
Indicators of solvability for lattice models. Discret. Math. 217(1-3): 167-189 (2000)
1990 – 1999
- 1993
- [j5]Anthony J. Guttmann, C. J. Thompson:
Subsonic Potential Flow and the Transonic Controversy. SIAM J. Appl. Math. 53(1): 48-59 (1993) - 1992
- [j4]Ian G. Enting, Anthony J. Guttmann, L. Bruce Richmond, Nicholas C. Wormald:
Enumeration of Almost-Convex Polygons on the Square Lattice. Random Struct. Algorithms 3(4): 445-462 (1992)
1970 – 1979
- 1976
- [j3]Anthony J. Guttmann
Programming recursively defined functions infortran. Int. J. Parallel Program. 5(2): 111-122 (1976) - [j2]Anthony J. Guttmann:
Multi-dimensional Summations in FORTRAN. Softw. Pract. Exp. 6(2): 221-224 (1976) - 1975
- [j1]Robert S. Anderssen, Anthony J. Guttmann
A Rationale for the Numerical Differentiation of Experimental Data. Inf. Process. Lett. 4(2): 48-50 (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 20:29 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: