Paul LaFollette

According to our database1, Paul LaFollette authored at least 14 papers between 1990 and 2006.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2006
A loopless Gray code for rooted trees.
ACM Trans. Algorithms, 2006

2004
Constant time generation of derangements.
Inf. Process. Lett., 2004

Loopless Array Generation of Multiset Permutations.
Comput. J., 2004

2003
Loopless Algorithms and Schröder Trees.
Int. J. Comput. Math., 2003

Loopless Generation of Schröder Trees.
Comput. J., 2003

2002
Loopless Generation of Linear Extensions of a Poset.
Order, 2002

Loopless Generation of Trees with Specified Degrees.
Comput. J., 2002

2000
A Visual Interface for Effortless Animation of C/C++ Programs.
J. Vis. Lang. Comput., 2000

A Loopless Algorithm for Generation of Basic Minimal Interval Orders.
Order, 2000

Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence.
J. Algorithms, 2000

1999
Loopless Generation of Gray Codes for <i>k</i>-Ary Trees.
Inf. Process. Lett., 1999

1998
A system for program visualization in the classroom.
Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998

1991
Isthmus critical points for solving jigsaw puzzles in computer vision.
IEEE Trans. Syst. Man Cybern., 1991

1990
A Computer Vision System that Assembles Canonical Jigsaw Puzzles Using the Euclidean Skeleton and Isthmus Critical Points.
Proceedings of IAPR Workshop on Machine Vision Applications, 1990


  Loading...