Number of the records: 1
Nearly All Reals Can Be Sorted with Linear Time Complexity
SYS 0544787 LBL 01000a^^22220027750^450 005 20240103230119.8 017 $2 DOI 100 $a 20210427d m y slo 03 ba 101 $a eng 102 $a CZ 200 1-
$a Nearly All Reals Can Be Sorted with Linear Time Complexity 210 $a Prague $c ICS CAS $d 2021 215 $a 22 s. 225 $a Technical Report $v V-1285 610 $a sorting 610 $a algorithm 610 $a real sorting key 610 $a time complexity 610 $a linear complexity 700 -1
$3 cav_un_auth*0100769 $a Jiřina $b Marcel $p UIVT-O $i Oddělení strojového učení $j Department of Machine Learning $w Department of Machine Learning $T Ústav informatiky AV ČR, v. v. i.
Number of the records: 1