Výsledky vyhledávání - "Theory of computation - Design and analysis of algorithms"

ParkView: Visualizing Monotone Interleavings: Visualizing Monotone Interleavings

Autoři: Beurskens, Thijs Van Den Broek, Steven Simons, Arjen a další

Zdroj: 2025 IEEE 18th Pacific Visualization Conference (PacificVis). :118-127

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, Human-centered computing - Visualization - Visualization techniques, Networks - Topology analysis and generation, Computer Science - Computational Geometry, Theory of computation - Design and analysis of algorithms

Přístupová URL adresa: http://arxiv.org/abs/2501.10728
https://research-portal.uu.nl/en/publications/b628947a-8e6f-47cf-a843-8f3ba8317ebb
https://doi.org/10.1109/PacificVis64226.2025.00018

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees: Strategy Iteration with Universal Trees

Autoři: Koh, Zhuan Khye Loho, Georg Zhuan Khye Koh and Georg Loho a další

Přispěvatelé: Koh, Zhuan Khye Loho, Georg Zhuan Khye Koh and Georg Loho a další

Zdroj: Logical Methods in Computer Science. 21

Témata: universal trees, FOS: Computer and information sciences, Data Structures and Algorithms, Discrete Mathematics (cs.DM), value iteration, Discrete Mathematics, Logic in Computer Science, Theory of computation → Design and analysis of algorithms, Mathematics of computing → Discrete mathematics, 0102 computer and information sciences, Theory of computation → Logic and verification, 01 natural sciences, Logic in Computer Science (cs.LO), parity games, strategy iteration, progress measure, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2108.13338
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.63
http://eprints.lse.ac.uk/116860/

Additive Sparsification of CSPs

Autoři: Eden Pelleg Stanislav Živný Eden Pelleg and Stanislav Živný a další

Přispěvatelé: Eden Pelleg Stanislav Živný Eden Pelleg and Stanislav Živný a další

Zdroj: European Symposium on Algorithms

Témata: graphs, FOS: Computer and information sciences, minimum cuts, Discrete Mathematics (cs.DM), Theory of computation → Design and analysis of algorithms, Theory of computation → Sparsification and spanners, additive sparsification, 0102 computer and information sciences, 01 natural sciences, hypergraphs, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2106.14757
https://arxiv.org/abs/2106.14757
https://drops.dagstuhl.de/opus/volltexte/2021/14656/pdf/LIPIcs-ESA-2021-75.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2106.html#abs-2106-14757
https://ora.ox.ac.uk/objects/uuid:9d412617-8c82-44a4-80b6-2346f1cfdccd
https://arxiv.org/pdf/2106.14757
https://ora.ox.ac.uk/objects/uuid:9d412617-8c82-44a4-80b6-2346f1cfdccd
https://doi.org/10.4230/lipics.esa.2021.75
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.75

Linear-Time Multilevel Graph Partitioning via Edge Sparsification

Autoři: Gottesbüren, Lars Maas, Nikolai Rosch, Dominik a další

Zdroj: ISSN: 1868-8969.

Témata: Graph Partitioning, Graph Algorithms, Linear Time Algorithms, Graph Sparsification, Theory of computation → Design and analysis of algorithms, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004

Popis souboru: application/pdf

Relation: Leibniz international proceedings in informatics : LIPIcs / Schloss Dagstuhl Leibniz-Zentrum für Informatik; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-395-9; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000186957; https://publikationen.bibliothek.kit.edu/1000186957/169409927; https://doi.org/10.5445/IR/1000186957

Dostupnost: https://publikationen.bibliothek.kit.edu/1000186957
https://publikationen.bibliothek.kit.edu/1000186957/169409927
https://doi.org/10.5445/IR/1000186957

A Subquadratic Algorithm for Computing the L1-distance between Two Terrains

Autoři: Agarwal, Pankaj, K. Aronov, Boris Devillers, Olivier a další

Přispěvatelé: Agarwal, Pankaj, K. Aronov, Boris Devillers, Olivier a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; Symposium on Computational Geometry (SoCG) ; https://hal.science/hal-04908634 ; Symposium on Computational Geometry (SoCG), Jun 2025, Kanazawa, Japan. pp.4:1-4:17, ⟨10.4230/LIPIcs.SoCG.2025.4⟩

Témata: polynomial interpolation, Theory of computation → Design and analysis of algorithms, Theory of computation → Computational geometry, bivariate multipoint evaluation, geometric cuttings, volume computation, Terrain similarity, Terrains, Computational geometry, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]

Geografické téma: Kanazawa, Japan

Dostupnost: https://hal.science/hal-04908634
https://hal.science/hal-04908634v1/document
https://hal.science/hal-04908634v1/file/socg-abs.pdf
https://doi.org/10.4230/LIPIcs.SoCG.2025.4

Linearly Ordered Colourings of Hypergraphs

Autoři: Nakajima, Tamio-Vesa Živný, Stanislav Tamio-Vesa Nakajima and Stanislav Živný a další

Přispěvatelé: Nakajima, Tamio-Vesa Živný, Stanislav Tamio-Vesa Nakajima and Stanislav Živný a další

Zdroj: ACM Transactions on Computation Theory. 14:1-19

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Theory of computation → Design and analysis of algorithms, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), promise constraint satisfaction, algebraic approach, 01 natural sciences, PCSP, minions, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Theory of computation → Constraint and logic programming, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, hypegraph colourings, polymorphisms, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2204.05628
https://ora.ox.ac.uk/objects/uuid:aeb2c090-f064-478a-81c3-bb2ac8df1192
https://doi.org/10.1145/3570909
https://ora.ox.ac.uk/objects/uuid:86b24d89-ef66-45f8-8a80-8f7507eb601d
https://doi.org/10.4230/lipics.icalp.2022.128
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.128

Clique-Based Separators for Geometric Intersection Graphs

Autoři: Mark de Berg Sándor Kisfaludi-Bak Morteza Monemizadeh a další

Přispěvatelé: Mark de Berg Sándor Kisfaludi-Bak Morteza Monemizadeh a další

Zdroj: 32nd International Symposium on Algorithms and Computation
Leibniz International Proceedings in Informatics
Leibniz International Proceedings in Informatics (LIPIcs), 212
32nd International Symposium on Algorithms and Computation (ISAAC 2021)

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, Intersection graphs, Theory of computation → Design and analysis of algorithms, 0102 computer and information sciences, 16. Peace & justice, intersection graphs, 01 natural sciences, Computational geometry, separator theorems, Separator theorems, Computer Science - Computational Geometry, ddc:004, 0101 mathematics

Popis souboru: application/pdf; application/application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2109.09874
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.22
http://hdl.handle.net/21.11116/0000-0009-B811-4
http://hdl.handle.net/21.11116/0000-0009-B813-2
http://hdl.handle.net/20.500.11850/520031
https://aaltodoc.aalto.fi/handle/123456789/122340

Scheduling lower bounds via AND subset sum

Autoři: Abboud, Amir Bringmann, Karl Hermelin, Danny a další

Přispěvatelé: Abboud, Amir Bringmann, Karl Hermelin, Danny a další

Zdroj: 47th International Colloquium on Automata, Languages, and Programming
Leibniz International Proceedings in Informatics
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Journal of Computer and System Sciences

Témata: FOS: Computer and information sciences, Theory of computation → Design and analysis of algorithms, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Subset Sum, 01 natural sciences, fine grained complexity, Computer Science - Data Structures and Algorithms, SETH, Data Structures and Algorithms (cs.DS), scheduling, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/2003.07113
http://arxiv.org/abs/2003.07113
http://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-07113
https://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-07113
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3256912
https://doi.org/10.4230/LIPIcs.ICALP.2020.4
https://drops.dagstuhl.de/opus/volltexte/2020/12411/pdf/LIPIcs-ICALP-2020-4.pdf/
https://arxiv.org/abs/2003.07113
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.4
http://hdl.handle.net/21.11116/0000-0007-2A52-E
http://hdl.handle.net/21.11116/0000-0007-2A54-C
http://hdl.handle.net/21.11116/0000-0007-2826-2

Global Benchmark Database

Autoři: Iser, Markus Jabs, Christoph Chakraborty, Supratik a další

Témata: ddc:004, Theory of computation → Design and analysis of algorithms, DATA processing & computer science, Information systems → Information integration, Maintenance and Distribution of Benchmark Instances and their Features, Theory of computation → Logic

Popis souboru: application/pdf

Přístupová URL adresa: https://publikationen.bibliothek.kit.edu/1000174127
https://publikationen.bibliothek.kit.edu/1000174127/154621049
https://doi.org/10.5445/IR/1000174127

Graph Exploration: The Impact of a Distance Constraint

Autoři: Devismes, Stéphane Dieudonné, Yoann Labourel, Arnaud a další

Přispěvatelé: Devismes, Stéphane Dieudonné, Yoann Labourel, Arnaud a další

Témata: FOS: Computer and information sciences, [INFO.INFO-MC] Computer Science [cs]/Mobile Computing, mobile agent, Theory of computation → Design and analysis of algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, graph, exploration

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2410.13386
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.68

LIPIcs, Volume 289, STACS 2024, Complete Volume: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)

Autoři: Beyersdorff, Olaf Kanté, Mamadou Moustapha Kupferman, Orna a další

Přispěvatelé: Beyersdorff, Olaf Kanté, Mamadou Moustapha Kupferman, Orna a další

Témata: Theory of computation → Models of computation, Mathematics of computing → Graph theory, STACS 2024, Theory of computation → Design and analysis of algorithms, Theory of computation → Formal languages and automata theory, Complete Volume, [INFO] Computer Science [cs], Volume 289, Theory of computation → Computational complexity and cryptography, Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs

Přístupová URL adresa: https://hal.science/hal-04859229v1

Better space-time-robustness trade-offs for set reconciliation

Autoři: Belazzougui, Djamal Kucherov, Gregory Walzer, Stefan a další

Přispěvatelé: Belazzougui, Djamal Kucherov, Gregory Walzer, Stefan a další

Témata: Theory of computation → Sketching and sampling, FOS: Computer and information sciences, invertible Bloom lookup tables, random hypergraphs, Theory of computation → Error-correcting codes, ddc:000, Theory of computation → Design and analysis of algorithms, information & general works, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Computer science, BCH codes, hashing, data structures, set reconciliation, Theory of computation → Randomness, Computer Science - Data Structures and Algorithms, geometry and discrete structures, Data Structures and Algorithms (cs.DS), ddc:004, Computer science, information & general works

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2404.09607
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.20
https://cnrs.hal.science/hal-04799765v1
https://cnrs.hal.science/hal-04799765v1/document
https://doi.org/10.4230/lipics.icalp.2024.20
https://publikationen.bibliothek.kit.edu/1000172842/153765734
https://publikationen.bibliothek.kit.edu/1000172842
https://doi.org/10.5445/IR/1000172842

Faster Minimization of Tardy Processing Time on a Single Machine

Autoři: Bringmann, Karl Fischer, Nick Hermelin, Danny a další

Přispěvatelé: Bringmann, Karl Fischer, Nick Hermelin, Danny a další

Zdroj: Algorithmica
47th International Colloquium on Automata, Languages, and Programming
Leibniz International Proceedings in Informatics
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)

Témata: FOS: Computer and information sciences, convolutions, Theory of computation → Design and analysis of algorithms, Computer Science - Data Structures and Algorithms, sumsets, Data Structures and Algorithms (cs.DS), ddc:004, Weighted number of tardy jobs

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/2003.07104
http://arxiv.org/abs/2003.07104
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3257283
https://pure.mpg.de/pubman/item/item_3257283_2/component/file_3257284/arXiv%3A2003.07104.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2020.19
https://dblp.uni-trier.de/db/conf/icalp/icalp2020.html#BringmannFHSW20
https://drops.dagstuhl.de/opus/volltexte/2020/12426/
https://drops.dagstuhl.de/opus/volltexte/2020/12426/pdf/LIPIcs-ICALP-2020-19.pdf/
http://arxiv.org/pdf/2003.07104.pdf
https://arxiv.org/abs/2003.07104
https://ui.adsabs.harvard.edu/abs/2020arXiv200307104B/abstract
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.19
http://hdl.handle.net/21.11116/0000-0009-FAD4-E
http://hdl.handle.net/21.11116/0000-0007-287E-0
http://hdl.handle.net/21.11116/0000-0007-2A4E-4
http://hdl.handle.net/21.11116/0000-0007-2A50-0

Better Space-Time-Robustness Trade-Offs for Set Reconciliation

Autoři: Djamal, Belazzougui Kucherov, Gregory Walzer, Stefan a další

Přispěvatelé: Djamal, Belazzougui Kucherov, Gregory Walzer, Stefan a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) ; https://cnrs.hal.science/hal-04799765 ; 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Jul 2024, Tallinn, Estonia. pp.20:1-20:19, ⟨10.4230/LIPIcs.ICALP.2024.20⟩

Témata: Theory of computation → Error-correcting codes, Theory of computation → Sketching and sampling, geometry and discrete structures, Theory of computation → Randomness, Theory of computation → Design and analysis of algorithms, BCH codes, random hypergraphs, invertible Bloom lookup tables, set reconciliation, hashing, data structures, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Geografické téma: Tallinn, Estonia

Time: Tallinn, Estonia

Dostupnost: https://cnrs.hal.science/hal-04799765
https://cnrs.hal.science/hal-04799765v1/document
https://cnrs.hal.science/hal-04799765v1/file/LIPIcs.ICALP.2024.20.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2024.20

Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions d ≥ 4

Autoři: Gorbachev, Egor Künnemann, Marvin Chambers, Erin W. a další

Zdroj: ISSN: 1868-8969.

Témata: Fine-grained complexity theory, non-combinatorial lower bounds, computational geometry, clique detection, Theory of computation → Design and analysis of algorithms, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004

Popis souboru: application/pdf

Relation: Leibniz International Proceedings in Informatics (LIPIcs); info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-273-0; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000175555; https://publikationen.bibliothek.kit.edu/1000175555/155259158; https://doi.org/10.5445/IR/1000175555

Dostupnost: https://publikationen.bibliothek.kit.edu/1000175555
https://publikationen.bibliothek.kit.edu/1000175555/155259158
https://doi.org/10.5445/IR/1000175555

The Covering Canadian Traveller Problem Revisited

Autoři: Hahn, Niklas Xefteris, Michalis Niklas Hahn and Michalis Xefteris

Přispěvatelé: Hahn, Niklas Xefteris, Michalis Niklas Hahn and Michalis Xefteris

Témata: FOS: Computer and information sciences, Theory of computation → Design and analysis of algorithms, Computer Science - Data Structures and Algorithms, Canadian Traveller Problem, Data Structures and Algorithms (cs.DS), [INFO] Computer Science [cs], ddc:004, Online Algorithm, Travelling Salesperson Problem, Graph Exploration

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2304.14319
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.53
https://hal.sorbonne-universite.fr/hal-04208886v1
https://doi.org/10.4230/lipics.mfcs.2023.53

Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else

Autoři: Bampis, Evripidis Escoffier, Bruno Gouleakis, Themis a další

Přispěvatelé: Bampis, Evripidis Escoffier, Bruno Gouleakis, Themis a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 274
31st Annual European Symposium on Algorithms (ESA 2023)

Témata: FOS: Computer and information sciences, Competitive analysis, Theory of computation → Design and analysis of algorithms, Online algorithms, TSP, Learning-augmented algorithms, Algorithms with predictions, [INFO] Computer Science [cs], Theory of computation → Online algorithms, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf; application/application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2305.02169
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.12
https://hal.sorbonne-universite.fr/hal-04208875v1
https://doi.org/10.4230/lipics.esa.2023.12
http://hdl.handle.net/20.500.11850/637196

LIPIcs, Volume 254, STACS 2023, Complete Volume

Autoři: Berenbrink, Petra Bouyer, Patricia Dawar, Anuj a další

Přispěvatelé: Berenbrink, Petra Bouyer, Patricia Dawar, Anuj a další

Témata: Theory of computation → Models of computation, Mathematics of computing → Graph theory, Theory of computation → Formal languages and automata theory, Theory of computation → Design and analysis of algorithms, [INFO] Computer Science [cs], Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs, Volume 254, STACS 2023, Complete Volume, STACS 2023, Complete Volume, ddc:004, Theory of computation → Computational complexity and cryptography, Volume 254, LIPIcs

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023
https://hal.science/hal-04859252v1
https://doi.org/10.4230/lipics.stacs.2023

Non-Clairvoyant Makespan Minimization Scheduling with Predictions

Autoři: Bampis, Evripidis Kononov, Alexander Lucarelli, Giorgio a další

Přispěvatelé: Bampis, Evripidis Kononov, Alexander Lucarelli, Giorgio a další

Témata: Theory of computation → Design and analysis of algorithms, learning-augmented algorithm, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], scheduling, ddc:004, online

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.9

Structure and Independence in Hyperbolic Uniform Disk Graphs

Autoři: Bläsius, Thomas von der Heydt, Jean-Pierre Kisfaludi-Bak, Sándor a další

Zdroj: ISSN: 1868-8969.

Témata: hyperbolic geometry, unit disk graphs, independent set, treewidth, Theory of computation → Design and analysis of algorithms, Theory of computation → Computational geometry, Theory of computation → Graph algorithms analysis, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004

Relation: Leibniz International Proceedings in Informatics (LIPIcs); info:eu-repo/semantics/altIdentifier/isbn/978-395977370-6; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000184480

Dostupnost: https://publikationen.bibliothek.kit.edu/1000184480