Authors
Richard Beigel, Egemen Tanin
Publication date
1998/4/20
Book
Latin American Symposium on Theoretical Informatics
Pages
331-340
Publisher
Springer Berlin Heidelberg
Description
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.
Total citations
19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220233222342232412162131311
Scholar articles
R Beigel, E Tanin - Latin American Symposium on Theoretical Informatics, 1998