26 citations · 31 across the 2 of their papers we have counts for
2 papers
cs.DS2014★ 5 cited
Stable Roommates Problem with Random Preferences
Stephan Mertens
The stable roommates problem with agents has worst case complexity in time and space. Random instances can be solved faster and with less memory, however. We introduce…
cond-mat.stat-mech2011★ 26 cited
Counting Lattice Animals in High Dimensions
Sebastian Luther, Stephan Mertens
We present an implementation of Redelemeier's algorithm for the enumeration of lattice animals in high dimensional lattices. The implementation is lean and fast enough to allow us…