Výsledky vyhľadávania - "design and analysis of algorithms"

ParkView: Visualizing Monotone Interleavings: Visualizing Monotone Interleavings

Autori: Beurskens, Thijs Van Den Broek, Steven Simons, Arjen a ďalší

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

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

Prí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

Autori: Koh, Zhuan Khye Loho, Georg Zhuan Khye Koh and Georg Loho a ďalší

Prispievatelia: Koh, Zhuan Khye Loho, Georg Zhuan Khye Koh and Georg Loho a ďalší

Zdroj: Logical Methods in Computer Science. 21

Predmety: 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 súboru: application/pdf

Prí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

Autori: Eden Pelleg Stanislav Živný Eden Pelleg and Stanislav Živný a ďalší

Prispievatelia: Eden Pelleg Stanislav Živný Eden Pelleg and Stanislav Živný a ďalší

Zdroj: European Symposium on Algorithms

Predmety: 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 súboru: application/pdf

Prí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

Algorithmic Contract Theory: A Survey: Algorithmic contract theory: a survey

Autori: Dütting, Paul Feldman, Michal Talgam-Cohen, Inbal

Zdroj: Foundations and Trends® in Theoretical Computer Science

Predmety: FOS: Computer and information sciences, Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance, online learning, design and analysis of algorithms, algorithmic game theory, economics of information and the web, FOS: Economics and business, Computer Science - Computer Science and Game Theory, Economics - Theoretical Economics, Contract theory (moral hazard, adverse selection), Theoretical Economics (econ.TH), classification and prediction, game-theoretic learning, Algorithmic game theory and complexity, operations research, Computer Science and Game Theory (cs.GT)

Popis súboru: application/xml

Prístupová URL adresa: http://arxiv.org/abs/2412.16384
https://zbmath.org/7975758
https://doi.org/10.1561/0400000113

Linear-Time Multilevel Graph Partitioning via Edge Sparsification

Autori: Gottesbüren, Lars Maas, Nikolai Rosch, Dominik a ďalší

Zdroj: ISSN: 1868-8969.

Predmety: 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 súboru: 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

Dostupnosť: 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

Autori: Agarwal, Pankaj, K. Aronov, Boris Devillers, Olivier a ďalší

Prispievatelia: Agarwal, Pankaj, K. Aronov, Boris Devillers, Olivier a ďalší

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⟩

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

Dostupnosť: 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

Repetitive Processes and Their Surrogate-Model Congruent Encoding for Evolutionary Algorithms - A Theoretic Proposal

Autori: Christina Plump Bernhard Berger Rolf Drechsler

Zdroj: Proceedings of the Companion Conference on Genetic and Evolutionary Computation. :2289-2296

Predmety: algorithms for application, evolutionary algorithm, design and analysis of algorithms, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, surrogate model, theory

Reconstruction of Depth-4 Multilinear Circuits

Autori: Bhargava, Vishwas Saraf, Shubhangi Volkovich, Ilya

Zdroj: ACM Transactions on Computation Theory, (2025-03-28)

Predmety: Arithmetic Circuits, Reconstruction, Learning, Bounded-depth Circuits, Theory of computation, Algebraic complexity theory, Design and analysis of algorithms

Relation: https://authors.library.caltech.edu/communities/caltechauthors/; https://doi.org/10.1145/3726532

Dostupnosť: https://doi.org/10.1145/3726532

Formal Methods

Prispievatelia: Platzer, Andre Rozier, Kristin Yvonne Pradella, Matteo a ďalší

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

Popis súboru: application/pdf

Relation: Lecture Notes in Computer Science

Prístupová URL adresa: https://library.oapen.org/handle/20.500.12657/93255

Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow Routing

Autori: Wenkai Dai Klaus-Tycho Foerster David Fuchssteiner a ďalší

Zdroj: ACM Transactions on Modeling and Performance Evaluation of Computing Systems. 8:1-30

Predmety: design and analysis of algorithms, network design, load optimization, optical networks, 0102 computer and information sciences, 02 engineering and technology, algorithms, network architectures, 01 natural sciences, networks, 0202 electrical engineering, electronic engineering, information engineering, complexity, theory of computation

Efficient Exact Online String Matching Through Linked Weak Factors

Autori: Matthew N. Palmer Simone Faro Stefano Scafiti a ďalší

Prispievatelia: Matthew N. Palmer Simone Faro Stefano Scafiti a ďalší

Predmety: String matching, text processing, weak recognition, hashing, experimental algorithms, design and analysis of algorithms, design and analysis of algorithms, experimental algorithms, String matching, text processing, ddc:004, weak recognition, hashing

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.24
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.24
https://hdl.handle.net/20.500.11769/641810
https://doi.org/10.4230/lipics.sea.2024.24

Linearly Ordered Colourings of Hypergraphs

Autori: Nakajima, Tamio-Vesa Živný, Stanislav Tamio-Vesa Nakajima and Stanislav Živný a ďalší

Prispievatelia: Nakajima, Tamio-Vesa Živný, Stanislav Tamio-Vesa Nakajima and Stanislav Živný a ďalší

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

Predmety: 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 súboru: application/pdf

Prí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

Autori: Mark de Berg Sándor Kisfaludi-Bak Morteza Monemizadeh a ďalší

Prispievatelia: Mark de Berg Sándor Kisfaludi-Bak Morteza Monemizadeh a ďalší

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)

Predmety: 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 súboru: application/pdf; application/application/pdf

Prí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

Autori: Abboud, Amir Bringmann, Karl Hermelin, Danny a ďalší

Prispievatelia: Abboud, Amir Bringmann, Karl Hermelin, Danny a ďalší

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

Predmety: 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 súboru: application/pdf

Prí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

DynaVLC 13 towards dynamic GTS allocation in VLC networks

Autori: Kurunathan, John Harrison Gutiérrez Gaitán, Miguel Sámano-Robles, Ramiro a ďalší

Prispievatelia: Kurunathan, John Harrison Gutiérrez Gaitán, Miguel Sámano-Robles, Ramiro a ďalší

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

Popis súboru: application/pdf

Dostupnosť: http://hdl.handle.net/10400.22/25318

On the average complexity of Berge Algorithm ; Sur la complexité moyenne de l'algorithme de Berge

Autori: David, Julien Gholami, Mostafa Lhote, Loïck a ďalší

Prispievatelia: David, Julien Gholami, Mostafa Lhote, Loïck a ďalší

Zdroj: https://hal.science/hal-04637413 ; 2025.

Predmety: 2012 ACM Subject Classification Design and analysis of algorithms Average Complexity, Minimal Transversal, Berge Algorithm, Hypergraphs, Analytic Combinatorics Digital Object Identifier, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Dostupnosť: https://hal.science/hal-04637413
https://hal.science/hal-04637413v1/document
https://hal.science/hal-04637413v1/file/Soumis%20%C3%A0%20SODA%20-%20On%20the%20average%20complexity%20of%20Berge%20Algorithm%20%281%29.pdf

Global Benchmark Database

Autori: Iser, Markus Jabs, Christoph Chakraborty, Supratik a ďalší

Predmety: 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 súboru: application/pdf

Prí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

Autori: Devismes, Stéphane Dieudonné, Yoann Labourel, Arnaud a ďalší

Prispievatelia: Devismes, Stéphane Dieudonné, Yoann Labourel, Arnaud a ďalší

Predmety: 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 súboru: application/pdf

Prí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)

Autori: Beyersdorff, Olaf Kanté, Mamadou Moustapha Kupferman, Orna a ďalší

Prispievatelia: Beyersdorff, Olaf Kanté, Mamadou Moustapha Kupferman, Orna a ďalší

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

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

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

Autori: Belazzougui, Djamal Kucherov, Gregory Walzer, Stefan a ďalší

Prispievatelia: Belazzougui, Djamal Kucherov, Gregory Walzer, Stefan a ďalší

Predmety: 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 súboru: application/pdf

Prí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