97 citations · 392 across the 64 of their papers we have counts for
Showing 2018 · cs.DSShow all
2 papers · 2 filters
cs.DS2018★ 2 cited
Hashing with Linear Probing and Referential Integrity
Peter Sanders
We describe a variant of linear probing hash tables that never moves elements and thus supports referential integrity, i.e., pointers to elements remain valid while this element is…
cs.DS2018
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
Tobias Heuer, Peter Sanders, Sebastian Schlag
We present a refinement framework for multilevel hypergraph partitioning that uses max-flow computations on pairs of blocks to improve the solution quality of a -way partition.…