ELTE logo ELTE Eötvös Loránd University
ANNALES Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae
Sectio Computatorica

Volumes » Volume 40 (2013)

https://doi.org/10.71352/ac.40.173

Lonely runners with complex time

Péter Burcsi

Abstract. In this short note we propose a generalization of the so called lonely runner problem to complex times. We give definitions, prove some basic results and formulate open questions.

Key words and phrases. Lonely runner problem, complex time.

Full text PDF
Journal cover