25 citations · 54 across the 7 of their papers we have counts for
3 papers · 1 filter
Sort well with energy-constrained comparisons
Barbara Geissmann, Paolo Penna
We study very simple sorting algorithms based on a probabilistic comparator model. In our model, errors in comparing two elements are due to (1) the energy or effort put in the com…
Collaborative Delivery with Energy-Constrained Mobile Robots
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das +5
We consider the problem of collectively delivering some message from a specified source to a designated target location in a graph, using multiple mobile agents. Each agent has a l…
On computing the total displacement number via weighted Motzkin paths
Andreas Bärtschi, Barbara Geissmann, Daniel Graf +3
Counting the number of permutations of a given total displacement is equivalent to counting weighted Motzkin paths of a given area (Guay-Paquet and Petersen, 2014). The former comb…