Jayapaul, Varunkumar; Jo, Seungbum; Palem, Krishna; Satti, Srinivasa Rao Energy efficient sorting, selection and searching. (English) Zbl 07770291 Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 179-190 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{V. Jayapaul} et al., Lect. Notes Comput. Sci. 13973, 179--190 (2023; Zbl 07770291) Full Text: DOI
Erlebach, Thomas; Hoffmann, Michael; de Lima, Murilo Santos Round-competitive algorithms for uncertainty problems with parallel queries. (English) Zbl 1506.68182 Algorithmica 85, No. 2, 406-443 (2023). MSC: 68W27 68P10 68W10 PDFBibTeX XMLCite \textit{T. Erlebach} et al., Algorithmica 85, No. 2, 406--443 (2023; Zbl 1506.68182) Full Text: DOI arXiv
Biswas, Arindam; Jayapaul, Varunkumar; Raman, Venkatesh; Satti, Srinivasa Rao Finding kings in tournaments. (English) Zbl 1498.05111 Discrete Appl. Math. 322, 240-252 (2022). MSC: 05C20 05C69 05C85 68W40 68P10 PDFBibTeX XMLCite \textit{A. Biswas} et al., Discrete Appl. Math. 322, 240--252 (2022; Zbl 1498.05111) Full Text: DOI
Chaplick, Steven; Halldórsson, Magnús M.; de Lima, Murilo S.; Tonoyan, Tigran Query minimization under stochastic uncertainty. (English) Zbl 1514.68054 Theor. Comput. Sci. 895, 75-95 (2021). MSC: 68P10 68W20 68W27 68W40 90C15 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Theor. Comput. Sci. 895, 75--95 (2021; Zbl 1514.68054) Full Text: DOI arXiv Link
Halldórsson, Magnús M.; de Lima, Murilo Santos Query-competitive sorting with uncertainty. (English) Zbl 1462.68031 Theor. Comput. Sci. 867, 50-67 (2021). MSC: 68P10 68W20 68W27 PDFBibTeX XMLCite \textit{M. M. Halldórsson} and \textit{M. S. de Lima}, Theor. Comput. Sci. 867, 50--67 (2021; Zbl 1462.68031) Full Text: DOI arXiv Link
Geissmann, Barbara Longest increasing subsequence under persistent comparison errors. (English) Zbl 1444.68307 Theory Comput. Syst. 64, No. 4, 662-680 (2020). MSC: 68W32 68Q17 68W25 68W40 PDFBibTeX XMLCite \textit{B. Geissmann}, Theory Comput. Syst. 64, No. 4, 662--680 (2020; Zbl 1444.68307) Full Text: DOI arXiv
Geissmann, Barbara; Leucci, Stefano; Liu, Chih-Hung; Penna, Paolo Optimal dislocation with persistent errors in subquadratic time. (English) Zbl 1433.68111 Theory Comput. Syst. 64, No. 3, 508-521 (2020). MSC: 68P10 68W40 PDFBibTeX XMLCite \textit{B. Geissmann} et al., Theory Comput. Syst. 64, No. 3, 508--521 (2020; Zbl 1433.68111) Full Text: DOI Link
Halldórsson, Magnús M.; De Lima, Murilo Santos Query-competitive sorting with uncertainty. (English) Zbl 1516.68035 Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 7, 15 p. (2019). MSC: 68P10 68Q25 68W20 68W27 PDFBibTeX XMLCite \textit{M. M. Halldórsson} and \textit{M. S. De Lima}, LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 7, 15 p. (2019; Zbl 1516.68035) Full Text: DOI
Geissmann, Barbara; Leucci, Stefano; Liu, Chih-Hung; Penna, Paolo Optimal sorting with persistent comparison errors. (English) Zbl 07525486 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 49, 14 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{B. Geissmann} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 49, 14 p. (2019; Zbl 07525486) Full Text: DOI arXiv
Geissmann, Barbara; Leucci, Stefano; Liu, Chih-Hung; Penna, Paolo Optimal dislocation with persistent errors in subquadratic time. (English) Zbl 1487.68088 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 36, 13 p. (2018). MSC: 68P10 68W40 PDFBibTeX XMLCite \textit{B. Geissmann} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 36, 13 p. (2018; Zbl 1487.68088) Full Text: DOI
Acharya, Jayadev; Falahatgar, Moein; Jafarpour, Ashkan; Orlitsky, Alon; Suresh, Ananda Theertha Maximum selection and sorting with adversarial comparators. (English) Zbl 1407.68118 J. Mach. Learn. Res. 19, Paper No. 59, 31 p. (2018). MSC: 68P10 62G07 68Q25 PDFBibTeX XMLCite \textit{J. Acharya} et al., J. Mach. Learn. Res. 19, Paper No. 59, 31 p. (2018; Zbl 1407.68118) Full Text: Link
Biswas, Arindam; Jayapaul, Varunkumar; Raman, Venkatesh; Satti, Srinivasa Rao The complexity of finding (approximate sized) distance-\(d\) dominating set in tournaments. (English) Zbl 1494.68189 Xiao, Mingyu (ed.) et al., Frontiers in algorithmics. 11th international workshop, FAW 2017, Chengdu, China, June 23–25, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10336, 22-33 (2017). MSC: 68R10 05C20 05C69 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{A. Biswas} et al., Lect. Notes Comput. Sci. 10336, 22--33 (2017; Zbl 1494.68189) Full Text: DOI