Blar i Institutt for datateknologi og informatikk på tidsskrift "Theoretical Computer Science"

Viser treff 1-2 av 2

    • Approximate query processing over static sets and sliding windows 

      Basat, Ran Ben; Jo, Seungbum; Satti, Srinivasa Rao; Ugare, Shubham (Journal article; Peer reviewed, 2021)
      Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and ...

    • Succinct navigational oracles for families of intersection graphs on a circle 

      Acan, Huseyin; Chakraborty, Sankardeep; Jo, Seungbum; Nakashima, Kei; Sadakane, Kunihiko; Satti, Srinivasa Rao (Peer reviewed; Journal article, 2022)
      We consider the problem of designing succinct navigational oracles, i.e., succinct data structures supporting basic navigational queries such as degree, adjacency and neighborhood efficiently for intersection graphs on a ...