5 citations · 7 across the 6 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
External-memory dictionaries with worst-case update cost
Rathish Das, John Iacono, Yakov Nekrich
The -tree [Brodal and Fagerberg 2003] is a simple I/O-efficient external-memory-model data structure that supports updates orders of magnitude faster than B-tree with a query…
cs.DS2022
Shortest Beer Path Queries in Interval Graphs
Rathish Das, Meng He, Eitan Kondratovsky +3
Our interest is in paths between pairs of vertices that go through at least one of a subset of the vertices known as beer vertices. Such a path is called a beer path, and the beer…