Philip J. Hanlon

Affiliations:
  • Dartmouth College, USA
  • University of Michigan, Ann Arbor, USA


According to our database1, Philip J. Hanlon authored at least 19 papers between 1979 and 2003.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2003
Least-squares fit of genomic data by sums of epistatic effects.
J. Parallel Distributed Comput., 2003

2002
On the Property M Conjecture for the Heisenberg Lie Algebra.
J. Comb. Theory A, 2002

2001
The Combinatorics of Cache Misses during Matrix Multiplication.
J. Comput. Syst. Sci., 2001

Exact Analysis of the Cache Behavior of Nested Loops.
Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2001

1996
Otter's Method and the Homology of Homeomorphically Irreduciblek-Trees.
J. Comb. Theory A, 1996

A random walk on the rook placements on a Ferrers board.
Electron. J. Comb., 1996

1994
A Survey of Combinatorial Problems in Lie Algebra Homolgy.
Proceedings of the Formal Power Series and Algebraic Combinatorics, 1994

1992
On a Bijection between Littlewood-Richardson Fillings of Conjugate Shape.
J. Comb. Theory A, 1992

Some Remarkable Combinatorial Matrices.
J. Comb. Theory A, 1992

A Markov chain on the symmetric group and Jack symmetric functions.
Discret. Math., 1992

1990
On the number of alignments of <i>k</i> sequences.
Graphs Comb., 1990

1988
Jack symmetric functions and some combinatorial properties of young symmetrizers.
J. Comb. Theory A, 1988

1986
The extension to root systems of a theorem on tournaments.
J. Comb. Theory A, 1986

1985
The chromatic polynomial of an unlabeled graph.
J. Comb. Theory B, 1985

1983
A Proof of a Conjecture of Stanley Concerning Partitions of a Set.
Eur. J. Comb., 1983

1982
Counting bridgeless graphs.
J. Comb. Theory B, 1982

1981
A Cycle Index Sum Inversion Theorem.
J. Comb. Theory A, 1981

1979
Enumeration of graphs by degree sequence.
J. Graph Theory, 1979

The enumeration of bipartite graphs.
Discret. Math., 1979


  Loading...