Authors: Richard Beigel and Egemen Tanin
Abstract: We present a geometric counting problem that arises in browsing and solve it in constant time per query using nonexhaustive tables. On the other hand, we prove that several closely related problems require exhaustive tables, no matter how much time we allow per query.
Download Extended Abstract in gzipped postscript
Download Extended Abstract in html