New kth-shortest path algorithm

H. Maruyama

IEICE Transactions on Information and Systems

Paper

01 Mar 1993

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.

Paper

Unreliable failure detectors for reliable distributed systems

Tushar Deepak Chandra, Sam Toueg

Journal of the ACM

Paper

On the Optimality of the Probability Ranking Scheme in Storage Applications

P.C. Yue, C.K. Wong

Journal of the ACM

Workshop paper

Load balancing of heterogeneous workloads in memcached clusters

Wei Zhang, Timothy Wood, et al.

ICAC 2014

Talk

ChemChat | Conversational Expert Assistant in Material Science and Data Visualization

Tim Erdmann, Stefan Zecevic, et al.

ACS Spring 2024

View all publications

Abstract

Related

Unreliable failure detectors for reliable distributed systems

On the Optimality of the Probability Ranking Scheme in Storage Applications

Load balancing of heterogeneous workloads in memcached clusters

ChemChat | Conversational Expert Assistant in Material Science and Data Visualization