Bounded ordered dictionaries in O(loglogN) time and O(n) space
Information Processing Letters
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Multi-method dispatching: a geometric approach with applications to string matching problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Tight(er) worst-case bounds on dynamic searching and priority queues
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Journal of Algorithms
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Sublogarithmic searching without multiplications
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Faster deterministic sorting and searching in linear space
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
Efficient IP table lookup via adaptive stratified trees with selective reconstructions
Journal of Experimental Algorithmics (JEA)
Compressing rectilinear pictures and minimizing access control lists
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fast and compact regular expression matching
Theoretical Computer Science
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
A dynamic stabbing-max data structure with sub-logarithmic query time
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
SIAM Journal on Computing
| Hi-index | 0.00 |
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method look-up in object oriented programming languages and classification in IP firewalls. For such application, very fast, say constant, query time is extremely important, small space is very important, and fast updates are good but the least important. Previous solutions traded space and update time for fast queries. We show here that space needs not be sacrificed. We get the same trade-off between update time and query time but using only the space necessary for locating a query point among the interval end-points. All our bounds are optimal or near-optimal.