activity
20032026
most citedTranslation from Classical Two-Way Automata to Pebble Two-Way Automata

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2003

An In-Place Sorting with O(n log n) Comparisons and O(n) Moves

Gianni Franceschini, Viliam Geffert

We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O(n log n) element comparisons and O(n) element transports. This so…