101 citations · 211 across the 45 of their papers we have counts for
Showing 2012 · cs.DSShow all
3 papers · 2 filters
cs.DS2012
A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
Ran Duan, Kurt Mehlhorn
We present the first combinatorial polynomial time algorithm for computing the equilibrium of the Arrow-Debreu market model with linear utilities.
cs.DS2012
The Cost of Address Translation
Tomasz Jurkiewicz, Kurt Mehlhorn
Modern computers are not random access machines (RAMs). They have a memory hierarchy, multiple cores, and virtual memory. In this paper, we address the computational cost of addres…
cs.DS2012★ 10 cited
Certifying 3-Edge-Connectivity
Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
We present a certifying algorithm that tests graphs for 3-edge-connectivity; the algorithm works in linear time. If the input graph is not 3-edge-connected, the algorithm returns a…