Search Results - Theory of computation - Design and analysis of algorithms

ParkView: Visualizing Monotone Interleavings: Visualizing Monotone Interleavings

Authors: Beurskens, Thijs Van Den Broek, Steven Simons, Arjen et al.

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

Subject Terms: 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

Access URL: 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

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

Authors: Agarwal, Pankaj, K. Aronov, Boris Devillers, Olivier et al.

Contributors: Agarwal, Pankaj, K. Aronov, Boris Devillers, Olivier et al.

Source: 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⟩

Subject Terms: 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]

Subject Geographic: Kanazawa, Japan

Availability: 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

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

Authors: Koh, Zhuan Khye Loho, Georg Zhuan Khye Koh and Georg Loho et al.

Contributors: Koh, Zhuan Khye Loho, Georg Zhuan Khye Koh and Georg Loho et al.

Source: Logical Methods in Computer Science. 21

Subject Terms: 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

File Description: application/pdf

Access URL: 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

Authors: Eden Pelleg Stanislav Živný Eden Pelleg and Stanislav Živný et al.

Contributors: Eden Pelleg Stanislav Živný Eden Pelleg and Stanislav Živný et al.

Source: European Symposium on Algorithms

Subject Terms: 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

File Description: application/pdf

Access URL: 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

Authors: Gottesbüren, Lars Maas, Nikolai Rosch, Dominik et al.

Source: ISSN: 1868-8969.

Subject Terms: 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

File Description: 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

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

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

Authors: Gorbachev, Egor Künnemann, Marvin Chambers, Erin W. et al.

Source: ISSN: 1868-8969.

Subject Terms: 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

File Description: 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

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

Learning within Fiber-Crafted Algorithms: Posthumanist Perspectives for Capturing Human-Material Collaboration

Authors: Anna Keune (ORCID 0000-0002-1985-2313)

Source: International Journal of Computer-Supported Collaborative Learning. 2024 19(1):37-65.

Peer Reviewed: Y

Page Count: 29

Descriptors: Design Crafts, Visual Arts, Algorithms, Cooperation, Learning Strategies, Computation, Middle School Students, Handicrafts, Art Materials, Educational Technology, Information Technology, Theories

Clique-Based Separators for Geometric Intersection Graphs

Authors: Mark de Berg Sándor Kisfaludi-Bak Morteza Monemizadeh et al.

Contributors: Mark de Berg Sándor Kisfaludi-Bak Morteza Monemizadeh et al.

Source: 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)

Subject Terms: 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

File Description: application/pdf; application/application/pdf

Access URL: 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

Formal Methods

Contributors: Platzer, Andre Rozier, Kristin Yvonne Pradella, Matteo et al.

Subject Terms: architecture verification and validation, artificial intelligence, design and analysis of algorithms, computational complexity and cryptography, embedded systems, model checking, formal methods, formal logic, machine learning, formal languages and automata theory, models of computation, semantics and reasoning, software engineering, theory and algorithms for application domains, Software Engineering, Mathematical theory of computation, Expert systems / knowledge-based systems, Programming and scripting languages: general, Computer hardware, Natural language and machine translation

File Description: application/pdf

Relation: Lecture Notes in Computer Science

Access URL: https://library.oapen.org/handle/20.500.12657/93255

Linearly Ordered Colourings of Hypergraphs

Authors: Nakajima, Tamio-Vesa Živný, Stanislav Tamio-Vesa Nakajima and Stanislav Živný et al.

Contributors: Nakajima, Tamio-Vesa Živný, Stanislav Tamio-Vesa Nakajima and Stanislav Živný et al.

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

Subject Terms: 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

File Description: application/pdf

Access URL: 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

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

Authors: Belazzougui, Djamal Kucherov, Gregory Walzer, Stefan et al.

Contributors: Belazzougui, Djamal Kucherov, Gregory Walzer, Stefan et al.

Subject Terms: 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

File Description: application/pdf

Access URL: 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

Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform

Authors: Brisebarre, Nicolas Joldes, Mioara Muller, Jean-Michel et al.

Contributors: Brisebarre, Nicolas Joldes, Mioara Muller, Jean-Michel et al.

Source: ACM Transactions on Mathematical Software. 46:1-27

Subject Terms: [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic, Numeric approximation algorithms, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], Fast Fourier Transform, Floating-point arithmetic, 01 natural sciences, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Rounding error analysis, • Theory of computation → Design and analysis of algorithms, Additional Key Words and Phrases: Floating-point arithmetic, Rounding error analysis ACM Reference format, CCS Concepts: • Mathematics of computing → Mathematical software, [INFO.INFO-AO] Computer Science [cs]/Computer Arithmetic, 0101 mathematics

File Description: application/pdf

Access URL: https://hal.archives-ouvertes.fr/hal-01949458v2/file/Bounds-FFT-HaLV2-oct19.pdf
https://hal.science/hal-01949458v2/document
https://doi.org/10.1145/3368619
https://hal.science/hal-01949458v2
https://hal.archives-ouvertes.fr/hal-01949458/document
https://doi.org/10.1145/3368619
https://hal.archives-ouvertes.fr/hal-01949458
https://dblp.uni-trier.de/db/journals/toms/toms46.html#BrisebarreJMNP20
https://dl.acm.org/doi/abs/10.1145/3368619

Scheduling lower bounds via AND subset sum

Authors: Abboud, Amir Bringmann, Karl Hermelin, Danny et al.

Contributors: Abboud, Amir Bringmann, Karl Hermelin, Danny et al.

Source: 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

Subject Terms: 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

File Description: application/pdf

Access URL: 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

Word-processing-based routing for Cayley graphs

Authors: Aguirre Guerrero, Daniela

Contributors: University/Department: Universitat de Girona. Departament d'Arquitectura i Tecnologia de Computadors, University/Department: Universitat de Girona. Institut d'Informàtica i Aplicacions

Thesis Advisors: Vilà Talleda, Pere, Fàbrega i Soler, Lluís

Source: TDX (Tesis Doctorals en Xarxa)

Subject Terms: Fault-tolerant routing, Encaminamiento tolerante a fallos, Encaminament tolerant a fallades, Cayley graphs, Grafos de Cayley, Grafs de Cayley, Automatic group theory, Teoría de grupos automáticos, Teoria de grups automàtics, Path computation algorithms, Algoritmos de búsqueda de caminos, Algoritmes de cerca de camins

File Description: application/pdf

Access URL: http://hdl.handle.net/10803/667410

Leveraging Multicriteria Integer Programming Optimization for Effective Team Formation

Authors: Pallavi Singh Phat K. Huynh Dang Nguyen et al.

Source: IEEE Transactions on Learning Technologies. 2025 18:72-84.

Peer Reviewed: Y

Page Count: 13

Descriptors: Teamwork, Group Dynamics, Research Design, Models, Skills, Background, Personality Traits, Algorithms, Task Analysis, Computation

Global Benchmark Database

Authors: Iser, Markus Jabs, Christoph Chakraborty, Supratik et al.

Subject Terms: 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

File Description: application/pdf

Access URL: https://publikationen.bibliothek.kit.edu/1000174127
https://publikationen.bibliothek.kit.edu/1000174127/154621049
https://doi.org/10.5445/IR/1000174127

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

Authors: Djamal, Belazzougui Kucherov, Gregory Walzer, Stefan et al.

Contributors: Djamal, Belazzougui Kucherov, Gregory Walzer, Stefan et al.

Source: 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⟩

Subject Terms: 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]

Subject Geographic: Tallinn, Estonia

Time: Tallinn, Estonia

Availability: 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

Graph Exploration: The Impact of a Distance Constraint

Authors: Devismes, Stéphane Dieudonné, Yoann Labourel, Arnaud et al.

Contributors: Devismes, Stéphane Dieudonné, Yoann Labourel, Arnaud et al.

Subject Terms: 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

File Description: application/pdf

Access URL: 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)

Authors: Beyersdorff, Olaf Kanté, Mamadou Moustapha Kupferman, Orna et al.

Contributors: Beyersdorff, Olaf Kanté, Mamadou Moustapha Kupferman, Orna et al.

Subject Terms: 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

Access URL: https://hal.science/hal-04859229v1

DynaVLC 13 towards dynamic GTS allocation in VLC networks

Authors: Kurunathan, John Harrison Gutiérrez Gaitán, Miguel Sámano-Robles, Ramiro et al.

Contributors: Kurunathan, John Harrison Gutiérrez Gaitán, Miguel Sámano-Robles, Ramiro et al.

Subject Terms: Computer systems organization, Real-time systems, Networks, Network protocols, Theory of computation, Design and analysis of algorithms

File Description: application/pdf

Availability: http://hdl.handle.net/10400.22/25318