Paul K. Stockmeyer

According to our database1, Paul K. Stockmeyer authored at least 16 papers between 1976 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
A note on the Frame-Stewart conjecture.
Discret. Math. Algorithms Appl., 2019

2009
Erratum to: "The falsity of the reconstruction conjecture for tournaments".
J. Graph Theory, 2009

DeBruijn Counting for Visualization Algorithms.
Proceedings of the Mathematical Foundations of Scientific Visualization, 2009

2004
Counting Cases in Substitope Algorithms.
IEEE Trans. Vis. Comput. Graph., 2004

2003
Algebraic Graph Theory.
Proceedings of the Handbook of Graph Theory., 2003

2000
A Formula for the Pell Sequence: 10663.
Am. Math. Mon., 2000

1999
Trees.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Graph Theory.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

1995
Exchanging disks in the tower of hanoi.
Int. J. Comput. Math., 1995

1991
Reconstruction of sequences.
Discret. Math., 1991

1981
Pseudosimilar vertices in a graph.
J. Graph Theory, 1981

A census of non-reconstructable digraphs, I: Six related families.
J. Comb. Theory, Ser. B, 1981

1980
On the Optimality of Linear Merge.
SIAM J. Comput., 1980

1977
The falsity of the reconstruction conjecture for tournaments.
J. Graph Theory, 1977

1976
A Comparison of Several Bandwidth and Profile Reduction Algorithms.
ACM Trans. Math. Softw., 1976

Algorithm 508: Matrix Bandwidth and Profile Reduction [F1].
ACM Trans. Math. Softw., 1976


  Loading...