Aha! An Illuminating Perspective (2009)
David Ginat, Dan Garcia, William Gasarch
The ‘Aha! ’ phenomenon is familiar to us in many domains including computer science and mathematics (e.g., [2,3,6]). It often stems from an unexpected point of view that illuminates an appealing...
General Terms Algorithms, Theory. (2008)
Daniel D. Garcia, David Ginat, Peter Henderson
“Every game ever invented by mankind, is a way of making things hard for the fun of it! ” –John Ciardi At recent SIGCSE conferences, there appeared to be a refreshing revival of interest in...
A Tight Amortized Bound for Path Reversal, (1998)
Ginat, David, Sleator, Daniel D., Tarjan, Robert E.
Path reversal is a form of path compression used in a disjoint set union algorithm and a mutual exclusion algorithm. We derive a tight upper bound on the amortized cost of path reversal. (JHD)
Adaptive ordering of contending processes in distributed systems /--by David Ginat. (1989)
Thesis (Ph. D.)--University of Maryland at College Park, 1989.