Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting H. Kaplan, E. Ramos, and H. Kaplan submitted (Preliminary version with somewhat worse results in SODA'06) Processing Top-k Queries from Samples E. Cohen, N. Grossuag, and H. Kaplan To appear in Computer Networks (Perliminary version in CoNEXT'06) Linear-time pointer-machine algorithms for path-evaluation problems on trees and graphs A.L. Buchsbaum, L. Georgiadis, H. Kaplan, A. Rogers, R.E. Tarjan, and J.R. Westbrook To appear in SIAM J. Comput. (Perliminary version in STOC'98) Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. H.~Kaplan, N.~Rubin, and M.~Sharir To appear in Algorithmica (Perliminary version in ESA'07) Weak epsilon-nets and interval chains N. Alon, H. Kaplan, G. Nivasch, M. Sharir, and S. Smorodinsky To appear in Journal of the ACM (Perliminary version in SODA'08) Online conflict free coloring for halfplanes, congruent disks, and axis-parallel rectangles K. Chen, H. Kaplan, and M. Sharir To appear in ACM transactions on algorithms