Randomized Binary and Tree Search Under Pressure

Authors: Caracci, Agustín, Dürr, Christoph, Verschae, José

Contributors: Pontificia Universidad Católica de Chile = Pontifical Catholic University of Chile Santiago (PUC), Recherche Opérationnelle (RO), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), ANR-19-CE48-0016,AlgoriDAM,Théorie algorithmique de nouveaux modèles de données(2019), ANR-23-CE48-0010,PREDICTIONS,Algorithmes avec prédictions(2023)

Source: Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025) ; 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025) ; https://hal.science/hal-05184552 ; 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus (Denmark), Denmark. pp.1-19, ⟨10.4230/LIPIcs.ICALP.2025.41⟩

Subject Terms: Theory of computation → Dynamic programming, Theory of computation → Algorithmic game theory, Theory of computation → Sorting and searching, Nash Equilibrium, Search Trees on Trees, Binary Search, [INFO]Computer Science [cs]

Subject Geographic: Aarhus (Denmark), Denmark

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2406.06468; ARXIV: 2406.06468

Availability: https://hal.science/hal-05184552
https://hal.science/hal-05184552v1/document
https://hal.science/hal-05184552v1/file/2406.06468v2.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2025.41

Randomized Binary and Tree Search under Pressure

Authors: Caracci, Agustín, Dürr, Christoph, Verschae, José

Contributors: Agustín Caracci and Christoph Dürr and José Verschae, Dürr, Christoph

Subject Terms: Nash Equilibrium, FOS: Computer and information sciences, Theory of computation → Algorithmic game theory, Theory of computation → Sorting and searching, Binary Search, Computer Science - Computer Science and Game Theory, Search Trees on Trees, Computer Science - Data Structures and Algorithms, Theory of computation → Dynamic programming, Data Structures and Algorithms (cs.DS), [INFO] Computer Science [cs], ddc:004, Computer Science and Game Theory (cs.GT)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2406.06468
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.41
https://hal.science/hal-05184552v1/document
https://hal.science/hal-05184552v1
https://doi.org/10.4230/lipics.icalp.2025.41

Dynamic Maintenance of Monotone Dynamic Programs and Applications

Authors: Henzinger, Monika, Neumann, Stefan, Räcke, Harald, Schmid, Stefan

Contributors: Monika Henzinger and Stefan Neumann and Harald Räcke and Stefan Schmid, Berenbrink, Petra, Bouyer, Patricia, Dawar, Anuj, Kanté, Mamadou Moustapha

Subject Terms: Theory of computation → Dynamic graph algorithms, FOS: Computer and information sciences, data structures, dynamic algorithms, Computer Science - Data Structures and Algorithms, Theory of computation → Dynamic programming, Data Structures and Algorithms (cs.DS), ddc:004, Dynamic programming, Theory of computation → Packing and covering problems

File Description: application/pdf

Access URL: http://arxiv.org/abs/2301.01744
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.36

Indexable Elastic Founder Graphs of Minimum Height

Authors: Rizzo, Nicola, Mäkinen, Veli

Contributors: Bannai, Hideo, Holub, Jan, Department of Computer Science, Algorithmic Bioinformatics, Genome-scale Algorithmics research group / Veli Mäkinen, Nicola Rizzo and Veli Mäkinen

Subject Terms: dynamic programming, Computer and information sciences, suffix tree, Applied computing → Genomics, data structures, Theory of computation → Graph algorithms analysis, Theory of computation → Sorting and searching, pattern matching, segmentation algorithms, Theory of computation → Dynamic programming, multiple sequence alignment, Theory of computation → Pattern matching, ddc:004

File Description: application/pdf

Access URL: http://hdl.handle.net/10138/353005
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2022.19

Faster (1 + ϵ)-approximation for unsplittable flow on a path via resource augmentation and back

Authors: Grandoni, Fabrizio, Mömke, Tobias, Wiese, Andreas

Contributors: Fabrizio Grandoni and Tobias Mömke and Andreas Wiese, Mutzel, Petra, Pagh, Rasmus, Herman, Grzegorz

Source: 29th Annual European Symposium on Algorithms (ESA 2021)

Subject Terms: ddc:004, Unsplittable Flow, Dynamic Programming, Theory of computation → Dynamic programming, Approximation Algorithms, Theory of computation → Rounding techniques, Theory of computation → Packing and covering problems

File Description: application/pdf

Access URL: https://hdl.handle.net/1871.1/49377e06-d854-444e-978d-d50bd74f9767
https://doi.org/10.4230/LIPIcs.ESA.2021.49
https://research.vu.nl/en/publications/49377e06-d854-444e-978d-d50bd74f9767
https://research.vu.nl/en/publications/faster-1eps-approximation-for-unsplittable-flow-on-a-path-via-res
https://doi.org/10.4230/LIPIcs.ESA.2021.49
https://drops.dagstuhl.de/opus/volltexte/2021/14630/pdf/LIPIcs-ESA-2021-49.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/14630/
https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2F49377e06-d854-444e-978d-d50bd74f9767
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.49
https://opus.bibliothek.uni-augsburg.de/opus4/files/108430/108430.pdf
https://doi.org/10.4230/LIPIcs.ESA.2021.49
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/108430
https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-1084307

Algorithms and Complexity on Indexing Elastic Founder Graphs

Authors: Equi, Massimo, Norri, Tuukka, Alanko, Jarno, Cazaux, Bastien, Tomescu, Alexandru I., Mäkinen, Veli

Contributors: Ahn, Hee-Kap, Sadakane, Kunihiko, Department of Computer Science, Algorithmic Bioinformatics, Genome-scale Algorithmics research group / Veli Mäkinen, Bioinformatics, Helsinki Institute for Information Technology, Massimo Equi and Tuukka Norri and Jarno Alanko and Bastien Cazaux and Alexandru I. Tomescu and Veli Mäkinen

Subject Terms: Applied computing → Genomics, Theory of computation → Graph algorithms analysis, Computer and information sciences, Theory of computation → Sorting and searching, segmentation, Theory of computation → Problems, reductions and completeness, Theory of computation → Dynamic programming, multiple sequence alignment, orthogonal vectors hypothesis, Theory of computation → Pattern matching, ddc:004

File Description: application/pdf

Access URL: http://hdl.handle.net/10138/338450
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.20

enThe Pareto Cover Problem

Authors: Natura, Bento, Neuwohner, Meike, Weltge, Stefan

Contributors: Chechik, Shiri, Navarro, Gonzalo, Rotenberg, Eva, Herman, Grzegorz

Subject Terms: Covering, Optimization, Mathematics of computing → Discrete optimization, Theory of computation → Randomness, geometry and discrete structures, Theory of computation → Dynamic programming, Theory of computation → Problems, reductions and completeness, Theory of computation → Packing and covering problems, Pareto, Approximation Algorithm

Linear Time Construction of Indexable Founder Block Graphs

Authors: Mäkinen, Veli, Cazaux, Bastien, Equi, Massimo, Norri, Tuukka, Tomescu, Alexandru I.

Contributors: Kingsford, Carl, Pisanti, Nadia, Genome-scale Algorithmics research group / Veli Mäkinen, Helsinki Institute for Information Technology, Department of Computer Science, Bioinformatics, Algorithmic Bioinformatics, Veli Mäkinen and Bastien Cazaux and Massimo Equi and Tuukka Norri and Alexandru I. Tomescu, Carl Kingsford, Nadia Pisanti

Source: 20th International Workshop on Algorithms in Bioinformatics (WABI 2020)

Subject Terms: founder reconstruction, FOS: Computer and information sciences, Computer and information sciences, J.3, string matching, 4. Education, E.1, F.2.2, 0206 medical engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 3. Good health, compressed data structures, Applied computing → Genomics, Pangenome indexing, Theory of computation → Sorting and searching, Computer Science - Data Structures and Algorithms, Theory of computation → Dynamic programming, multiple sequence alignment, Data Structures and Algorithms (cs.DS), Theory of computation → Pattern matching, ddc:004

File Description: application/pdf

Access URL: http://arxiv.org/abs/2005.09342
https://helda.helsinki.fi/handle/10138/318732
https://drops.dagstuhl.de/opus/volltexte/2020/12796/
https://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-09342
https://researchportal.helsinki.fi/en/publications/linear-time-construction-of-indexable-founder-block-graphs
https://doi.org/10.4230/LIPIcs.WABI.2020.7
https://covid19.elsevierpure.com/en/publications/linear-time-construction-of-indexable-founder-block-graphs
http://hdl.handle.net/10138/318732
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2020.7

Breaking the Barrier of 2 for the Storage Allocation Problem

Authors: Mömke, Tobias, Wiese, Andreas

Contributors: Tobias Mömke and Andreas Wiese, Artur Czumaj, Anuj Dawar, Emanuela Merelli

Source: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020

Subject Terms: ddc:004, FOS: Computer and information sciences, Dynamic Programming, Discrete Mathematics (cs.DM), I.2.8, G.1.2, 0102 computer and information sciences, 01 natural sciences, Theory of computation → Packing and covering problems, F.2.2, 68W25, Resource Allocation, Computer Science - Data Structures and Algorithms, Theory of computation → Dynamic programming, Data Structures and Algorithms (cs.DS), Approximation Algorithms, Theory of computation → Rounding techniques, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/1911.10871
https://arxiv.org/abs/1911.10871
https://arxiv.org/pdf/1911.10871.pdf
https://www.arxiv-vanity.com/papers/1911.10871/
https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2Fad58a725-1533-400a-b417-809479e16357
https://doi.org/10.4230/LIPIcs.ICALP.2020.86
https://research.vu.nl/en/publications/breaking-the-barrier-of-2-for-the-storage-allocation-problem
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.86