Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Hadjicostas, Petros
and
Lakshmanan, K.B.
2011.
Recursive merge sort with erroneous comparisons.
Discrete Applied Mathematics,
Vol. 159,
Issue. 14,
p.
1398.
Geissmann, Barbara
and
Penna, Paolo
2018.
SOFSEM 2018: Theory and Practice of Computer Science.
Vol. 10706,
Issue. ,
p.
508.
Geissmann, Barbara
and
Penna, Paolo
2018.
Sorting processes with energy-constrained comparisons
*.
Physical Review E,
Vol. 97,
Issue. 5,
Geissmann, Barbara
2018.
Approximation and Online Algorithms.
Vol. 11312,
Issue. ,
p.
259.
Li, Sihuan
Li, Hongbo
Liang, Xin
Chen, Jieyang
Giem, Elisabeth
Ouyang, Kaiming
Zhao, Kai
Di, Sheng
Cappello, Franck
and
Chen, Zizhong
2019.
FT-iSort.
p.
1.
Geissmann, Barbara
2020.
Longest Increasing Subsequence under Persistent Comparison Errors.
Theory of Computing Systems,
Vol. 64,
Issue. 4,
p.
662.
Geissmann, Barbara
Leucci, Stefano
Liu, Chih-Hung
and
Penna, Paolo
2020.
Optimal Dislocation with Persistent Errors in Subquadratic Time.
Theory of Computing Systems,
Vol. 64,
Issue. 3,
p.
508.
Jayapaul, Varunkumar
Jo, Seungbum
Palem, Krishna
and
Satti, Srinivasa Rao
2023.
WALCOM: Algorithms and Computation.
Vol. 13973,
Issue. ,
p.
179.