Joan M. Lucas

According to our database, Joan M. Lucas authored at least 12 papers between 1987 and 2015.

Collaborative distances:

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

2015

Illustrating the Interaction of Algorithms and Data Structures Using the Matching Problem.

Joan M. Lucas

Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

2010

An improved kernel size for rotation distance in binary trees.

Joan M. Lucas

Inf. Process. Lett., 2010

2008

Effective splaying with restricted rotations.

Joan M. Lucas

Int. J. Comput. Math., 2008

Incorporating transformations into jflap for enhanced understanding of automata.

Joan M. Lucas, Jonathan Jarvis

Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

Mock trials and role-playing in computer ethics courses.

Roxanne L. Canosa, Joan M. Lucas

Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

2004

A direct algorithm for restricted rotation distance.

Joan M. Lucas

Inf. Process. Lett., 2004

Untangling Binary Trees via Rotations.

Joan M. Lucas

Comput. J., 2004

1993

On Rotations and the Generation of Binary Trees.

Joan M. Lucas, Dominique Roelants van Baronaigien, Frank Ruskey

J. Algorithms, 1993

1992

Efficient Parallel Algorithms for Path Problems in Directed Graphs.

Joan M. Lucas, Marian Gunsher Sackrowitz

Algorithmica, 1992

1991

On the Competitiveness of Splay Trees: Relations to the Union-Find Problem.

Joan M. Lucas

Proceedings of the On-Line Algorithms, 1991

1990

Postorder Disjoint Set Union is Linear.

Joan M. Lucas

SIAM J. Comput., 1990

1987

The Rotation Graph of Binary Trees is Hamiltonian.

Joan M. Lucas

J. Algorithms, 1987