Conference paper
The bionic DBMS is coming, but what will it look like?
Ryan Johnson, Ippokratis Pandis
CIDR 2013
Paper
New kth-shortest path algorithm
Abstract
This paper presents a new algorithm for finding the kth- shortest paths between a specified pair of vertices in a directed graph with arcs having non-negative costs.
Related
Michael Factor, Dafna Sheinwald
Information Sciences
Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
Paper
Magic functions
Cynthia Dwork, Moni Naor, et al.
Journal of the ACM