M. Crochemore, M. Hasan, Tanaeem M. Moosa, M. S. Rahman
{"title":"Two dimensional Range Minimum/Maximum Query revisited","authors":"M. Crochemore, M. Hasan, Tanaeem M. Moosa, M. S. Rahman","doi":"10.1109/ICCITECHN.2010.5723824","DOIUrl":null,"url":null,"abstract":"In this paper, we present a cache oblivious efficient data structure to solve the two dimensional variant of the Range Minimum/Maximum Query (RMQ) problem.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 13th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2010.5723824","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we present a cache oblivious efficient data structure to solve the two dimensional variant of the Range Minimum/Maximum Query (RMQ) problem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
