Mircea Dima - Academia.edu (original) (raw)

Mircea Dima

Uploads

Papers by Mircea Dima

Research paper thumbnail of Efficient Range Minimum Queries using Binary Indexed Trees

OLYMPIADS IN INFORMATICS, 2015

We present new results on Binary Indexed Trees in order to efficiently solve Range Minimum Querie... more We present new results on Binary Indexed Trees in order to efficiently solve Range Minimum Queries. We introduce a way of using the Binary Indexed Trees so that we can answer different types of queries, e.g. the range minimum query, in O (log N) time complexity per operation, outperforming in speed similar data structures like Segment/Range Trees or the Sparse Table Algorithm.

Research paper thumbnail of Efficient Range Minimum Queries using Binary Indexed Trees

OLYMPIADS IN INFORMATICS, 2015

We present new results on Binary Indexed Trees in order to efficiently solve Range Minimum Querie... more We present new results on Binary Indexed Trees in order to efficiently solve Range Minimum Queries. We introduce a way of using the Binary Indexed Trees so that we can answer different types of queries, e.g. the range minimum query, in O (log N) time complexity per operation, outperforming in speed similar data structures like Segment/Range Trees or the Sparse Table Algorithm.

Log In