Joan M. Lucas

16 papers A 3B 1Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
2015 A conf
Illustrating the Interaction of Algorithms and Data Structures Using the Matching Problem.
SIGCSE
Joan M. Lucas
2015 J jnl
Teaching greedy algorithms using a single problem domain.
J. Comput. Sci. Coll.
Joan M. Lucas
2010 J jnl
An improved kernel size for rotation distance in binary trees.
Inf. Process. Lett.
Joan M. Lucas
2009 J jnl
K-6 outreach using "Computer Science Unplugged".
J. Comput. Sci. Coll.
Joan M. Lucas
2008 J jnl
Effective splaying with restricted rotations.
Int. J. Comput. Math.
Joan M. Lucas
2008 A conf
Incorporating transformations into jflap for enhanced understanding of automata.
SIGCSE
Joan M. Lucas, Jonathan Jarvis
2008 A conf
Mock trials and role-playing in computer ethics courses.
SIGCSE
Roxanne L. Canosa, Joan M. Lucas
2008 J jnl
Understanding the Universal Turing Machine: an implementation in JFLAP.
J. Comput. Sci. Coll.
Jonathan Jarvis, Joan M. Lucas
2004 J jnl
A direct algorithm for restricted rotation distance.
Inf. Process. Lett.
Joan M. Lucas
2004 J jnl
Untangling Binary Trees via Rotations.
Comput. J.
Joan M. Lucas
1993 J jnl
On Rotations and the Generation of Binary Trees.
J. Algorithms
Joan M. Lucas, Dominique Roelants van Baronaigien, Frank Ruskey
1992 J jnl
Efficient Parallel Algorithms for Path Problems in Directed Graphs.
Algorithmica
Joan M. Lucas, Marian Gunsher Sackrowitz
1991 — conf
On the Competitiveness of Splay Trees: Relations to the Union-Find Problem.
On-Line Algorithms
Joan M. Lucas
1990 J jnl
Postorder Disjoint Set Union is Linear.
SIAM J. Comput.
Joan M. Lucas
1989 B conf
Efficient Parallel Algorithms for Path Problems in Directed Graphs.
SPAA
Joan M. Lucas, Marian Gunsher Sackrowitz
1987 J jnl
The Rotation Graph of Binary Trees is Hamiltonian.
J. Algorithms
Joan M. Lucas