High-speed policy-based packet forwarding using efficient multi-dimensional range matching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Scalable high-speed prefix matching
ACM Transactions on Computer Systems (TOCS)
O(\log n) Dynamic Router-Tables for Prefixes and Ranges
IEEE Transactions on Computers
A data structure for multi-dimensional range reporting
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Tight bounds for dynamic convex hull queries (again)
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
O(logW) multidimensional packet classification
IEEE/ACM Transactions on Networking (TON)
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Data Structures for Approximate Orthogonal Range Counting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
External memory range reporting on a grid
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
I/O-efficient point location in a set of rectangles
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Delaunay triangulations in O(sort(n)) time and more
Journal of the ACM (JACM)
A fast algorithm for three-dimensional layers of maxima problem
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
| Hi-index | 0.01 |