Joan M. Lucas

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2015
Illustrating the Interaction of Algorithms and Data Structures Using the Matching Problem.
Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

2010
An improved kernel size for rotation distance in binary trees.
Inf. Process. Lett., 2010

2008
Effective splaying with restricted rotations.
Int. J. Comput. Math., 2008

Incorporating transformations into jflap for enhanced understanding of automata.
Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

Mock trials and role-playing in computer ethics courses.
Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

2004
A direct algorithm for restricted rotation distance.
Inf. Process. Lett., 2004

Untangling Binary Trees via Rotations.
Comput. J., 2004

1993
On Rotations and the Generation of Binary Trees.
J. Algorithms, 1993

1992
Efficient Parallel Algorithms for Path Problems in Directed Graphs.
Algorithmica, 1992

1991
On the Competitiveness of Splay Trees: Relations to the Union-Find Problem.
Proceedings of the On-Line Algorithms, 1991

1990
Postorder Disjoint Set Union is Linear.
SIAM J. Comput., 1990

1989
Efficient Parallel Algorithms for Path Problems in Directed Graphs.
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

1987
The Rotation Graph of Binary Trees is Hamiltonian.
J. Algorithms, 1987


  Loading...