default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilip J. Hanlon
Person information
- affiliation: Dartmouth College, USA
- affiliation: University of Michigan, Ann Arbor, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j17]Philip J. Hanlon, William Andrew Lorenz, Dave Strenski:
Least-squares fit of genomic data by sums of epistatic effects. J. Parallel Distributed Comput. 63(7-8): 683-691 (2003)- 2002
- [j16]Phil Hanlon, Michelle L. Wachs:
On the Property M Conjecture for the Heisenberg Lie Algebra. J. Comb. Theory A 99(2): 219-231 (2002) - 2001
- [j15]Philip J. Hanlon, Dean Chung, Siddhartha Chatterjee, Daniela Genius, Alvin R. Lebeck, Erin Parker:
The Combinatorics of Cache Misses during Matrix Multiplication. J. Comput. Syst. Sci. 63(1): 80-126 (2001) - [c2]Siddhartha Chatterjee, Erin Parker, Philip J. Hanlon, Alvin R. Lebeck:
Exact Analysis of the Cache Behavior of Nested Loops. PLDI 2001: 286-297
1990 – 1999
- 1996
- [j14]Phil Hanlon:
A random walk on the rook placements on a Ferrers board. Electron. J. Comb. 3(2) (1996) - [j13]Phil Hanlon:
Otter's Method and the Homology of Homeomorphically Irreduciblek-Trees. J. Comb. Theory A 74(2): 301-320 (1996) - 1994
- [c1]Phil Hanlon:
A Survey of Combinatorial Problems in Lie Algebra Homolgy. Formal Power Series and Algebraic Combinatorics 1994: 89-113 - 1992
- [j12]Phil Hanlon:
A Markov chain on the symmetric group and Jack symmetric functions. Discret. Math. 99(1-3): 123-140 (1992) - [j11]Phil Hanlon:
Some Remarkable Combinatorial Matrices. J. Comb. Theory A 59(2): 218-239 (1992) - [j10]Phil Hanlon, Sheila Sundaram:
On a Bijection between Littlewood-Richardson Fillings of Conjugate Shape. J. Comb. Theory A 60(1): 1-18 (1992) - 1990
- [j9]Jerrold R. Griggs, Phil Hanlon, Andrew M. Odlyzko, Michael S. Waterman:
On the number of alignments of k sequences. Graphs Comb. 6(2): 133-146 (1990)
1980 – 1989
- 1988
- [j8]Phil Hanlon:
Jack symmetric functions and some combinatorial properties of young symmetrizers. J. Comb. Theory A 47(1): 37-70 (1988) - 1986
- [j7]A. Robert Calderbank, Phil Hanlon:
The extension to root systems of a theorem on tournaments. J. Comb. Theory A 41(2): 228-245 (1986) - 1985
- [j6]Philip J. Hanlon:
The chromatic polynomial of an unlabeled graph. J. Comb. Theory B 38(3): 226-239 (1985) - 1983
- [j5]Phil Hanlon:
A Proof of a Conjecture of Stanley Concerning Partitions of a Set. Eur. J. Comb. 4(2): 137-141 (1983) - 1982
- [j4]Philip J. Hanlon, Robert W. Robinson:
Counting bridgeless graphs. J. Comb. Theory B 33(3): 276-305 (1982) - 1981
- [j3]Phil Hanlon:
A Cycle Index Sum Inversion Theorem. J. Comb. Theory A 30(3): 248-269 (1981)
1970 – 1979
- 1979
- [j2]Phil Hanlon:
The enumeration of bipartite graphs. Discret. Math. 28(1): 49-57 (1979) - [j1]Phil Hanlon:
Enumeration of graphs by degree sequence. J. Graph Theory 3(3): 295-299 (1979)
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:32 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:
