Philip J. Hanlon

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2003

Least-squares fit of genomic data by sums of epistatic effects.

Philip J. Hanlon, William Andrew Lorenz, Dave Strenski

J. Parallel Distributed Comput., 2003

2002

On the Property M Conjecture for the Heisenberg Lie Algebra.

Phil Hanlon, Michelle L. Wachs

J. Comb. Theory A, 2002

2001

The Combinatorics of Cache Misses during Matrix Multiplication.

Philip J. Hanlon, Dean Chung, Siddhartha Chatterjee, Daniela Genius, Alvin R. Lebeck, Erin Parker

J. Comput. Syst. Sci., 2001

Exact Analysis of the Cache Behavior of Nested Loops.

Siddhartha Chatterjee, Erin Parker, Philip J. Hanlon, Alvin R. Lebeck

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.

Phil Hanlon

J. Comb. Theory A, 1996

A random walk on the rook placements on a Ferrers board.

Phil Hanlon

Electron. J. Comb., 1996

1994

A Survey of Combinatorial Problems in Lie Algebra Homolgy.

Phil Hanlon

Proceedings of the Formal Power Series and Algebraic Combinatorics, 1994

1992

On a Bijection between Littlewood-Richardson Fillings of Conjugate Shape.

Phil Hanlon, Sheila Sundaram

J. Comb. Theory A, 1992

Some Remarkable Combinatorial Matrices.

Phil Hanlon

J. Comb. Theory A, 1992

A Markov chain on the symmetric group and Jack symmetric functions.

Phil Hanlon

Discret. Math., 1992

1990

On the number of alignments of <i>k</i> sequences.

Jerrold R. Griggs, Phil Hanlon, Andrew M. Odlyzko, Michael S. Waterman

Graphs Comb., 1990

1988

Jack symmetric functions and some combinatorial properties of young symmetrizers.

Phil Hanlon

J. Comb. Theory A, 1988

1986

The extension to root systems of a theorem on tournaments.

A. Robert Calderbank, Phil Hanlon

J. Comb. Theory A, 1986

1985

The chromatic polynomial of an unlabeled graph.

Philip J. Hanlon

J. Comb. Theory B, 1985

1983

A Proof of a Conjecture of Stanley Concerning Partitions of a Set.

Phil Hanlon

Eur. J. Comb., 1983

1982

Counting bridgeless graphs.

Philip J. Hanlon, Robert W. Robinson

J. Comb. Theory B, 1982

1981

A Cycle Index Sum Inversion Theorem.

Phil Hanlon

J. Comb. Theory A, 1981

1979

Enumeration of graphs by degree sequence.

Phil Hanlon

J. Graph Theory, 1979

The enumeration of bipartite graphs.

Phil Hanlon

Discret. Math., 1979