First Page | Document Content | |
---|---|---|
![]() Date: 2005-07-03 22:51:50Software engineering Abstract data types Data types Persistent data structure Dynamization Priority queue Binary search tree Bin Linked list Computing Data management Data structures | Add to Reading List |
![]() | CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Searching for Frequent Colors in Rectangles Marek Karpinski∗ AbstractDocID: 17NUg - View Document |
![]() | Searching for Frequent Colors in Rectangles Marek Karpinski∗ Abstract We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction τ of alDocID: 17ENx - View Document |
![]() | Retroactive Data Structures (extended abstract) Erik D. Demaine John IaconoDocID: ZL8T - View Document |
![]() | Retroactive Data Structures (extended abstract) Erik D. Demaine John IaconoDocID: nU7U - View Document |
![]() | Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. Yoav Giyora ∗ AbstractDocID: niUC - View Document |