'Query answer rightmost leaf' presentation slideshows

The Encoding Complexity of Two Dimensional Range Minimum Data Structures

Assumption 1 ? m ? n. Cost Space (bits) Query time Preprocessing time Models Indexing (input accessible ) Encoding (input not accessible ). The Encoding Complexity of Two Dimensional Range Minimum Data Structures. i 1. i 2. j 1. j 2. RMQ( i 1 , i 2 , j 1 , j 2 ) = (2,3)

306 views • 8 slides