Výsledky vyhľadávania - ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY

Zdroj: 26th Annual European Symposium on Algorithms (ESA 2018)
https://hal.science/hal-01798381
26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. pp.4:1--4:13, ⟨10.4230/LIPIcs.ESA.2018.4⟩

Predmety: Sorting algorithms, Merge sorting algorithms, Analysis of al-gorithms, TimSort, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.6: Sorting and searching, [INFO]Computer Science [cs], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Geografické téma: Helsinki, Finland

Dostupnosť: https://hal.science/hal-01798381
https://hal.science/hal-01798381v1/document
https://hal.science/hal-01798381v1/file/timsort2018.pdf
https://doi.org/10.4230/LIPIcs.ESA.2018.4

View record from BASE

Nájsť tento článok vo Web of Science

7

The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings

Autori: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) a ďalší

Prispievatelia: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) a ďalší

Zdroj: Discrete Applied Mathematics. 212:48-60

Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Assembly, Greedy conjecture, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Approximation algorithm, 01 natural sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, Shortest Superstring Problem, Data compression, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Stringology, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Prístupová URL adresa: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01286943v1
https://doi.org/10.1016/j.dam.2015.06.003

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

8

A linear time algorithm for Shortest Cyclic Cover of Strings

Autori: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) a ďalší

Prispievatelia: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) a ďalší

Zdroj: Journal of Discrete Algorithms. 37:56-67

Predmety: Overlap, Minimum assignment, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Superstring, 16. Peace & justice, 01 natural sciences, Graph, Theoretical Computer Science, 3. Good health, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Computational Theory and Mathematics, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Shortest cyclic cover of strings, Greedy, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Popis súboru: application/pdf

Prístupová URL adresa: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01525995
https://dblp.uni-trier.de/db/journals/jda/jda37.html#CazauxR16
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01525995/document
https://www.sciencedirect.com/science/article/pii/S1570866716300065
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01525995v1/document
https://doi.org/10.1016/j.jda.2016.05.001
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01525995v1

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

9

Glucagon and insulin production in pancreatic cells modeled using Petri nets and Boolean networks.

Autori: Barylska, Kamila Delaplace, Franck Gogolińska, Anna a ďalší

Prispievatelia: Barylska, Kamila Delaplace, Franck Gogolińska, Anna a ďalší

Zdroj: https://univ-evry.hal.science/hal-05183371 ; 2025.

Predmety: bioinformatics, analysis, modelling, Boolean networks, Petri nets, biological system, glucagon secretion, insulin secretion, diabetes, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM]

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

Dostupnosť: https://univ-evry.hal.science/hal-05183371
https://doi.org/10.48550/arXiv.2504.21578

View record from BASE

Nájsť tento článok vo Web of Science

10

Exact Algorithm to Solve the Minimum Cost Multi-Constrained Multicast Routing Problem

Autori: Molnár, Miklós Methods, Algorithms for Operations REsearch (MAORE) Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) a ďalší

Prispievatelia: Molnár, Miklós Methods, Algorithms for Operations REsearch (MAORE) Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) a ďalší

Zdroj: ISSN: 2327-5219.

Predmety: Branch and Bound, Partial Minimum Spanning Hierarchy, Hierarchy, Multi-Constrained Steiner Problem, Quality of Service, Multicast Routing, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.3: Network problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Dostupnosť: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01405702
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01405702v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01405702v1/file/JCC_2016111515091113.pdf
https://doi.org/10.4236/jcc.2016.414005

View record from BASE

Nájsť tento článok vo Web of Science

11

Accurate self-correction of errors in long reads using de Bruijn graphs

Autori: Salmela, Leena Walve, Riku Rivals, Eric a ďalší

Prispievatelia: Salmela, Leena Walve, Riku Rivals, Eric a ďalší

Zdroj: Bioinformatics

Predmety: assembly, 0301 basic medicine, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, 0206 medical engineering, non hybrid correction, Recomb-Seq/Recomb-Cbb 2016, Saccharomyces cerevisiae, 02 engineering and technology, 03 medical and health sciences, substitution, Escherichia coli, Quantitative Biology - Genomics, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM], PacBio, Genomics (q-bio.GN), Computer and information sciences, Genome, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.6: Sorting and searching, Sequence analysis, High-Throughput Nucleotide Sequencing, DNA, Sequence Analysis, DNA, de Bruijn, indel, Genetics, developmental biology, physiology, NGS, FOS: Biological sciences, LoRDEC, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Algorithms, Software

Popis súboru: application/pdf

Prístupová URL adresa: https://academic.oup.com/bioinformatics/article-pdf/33/6/799/25147868/btw321.pdf
https://pubmed.ncbi.nlm.nih.gov/27273673
http://arxiv.org/abs/1604.02233
https://helda.helsinki.fi/handle/10138/182781
http://europepmc.org/articles/PMC5351550
http://dblp.uni-trier.de/db/journals/bioinformatics/bioinformatics33.html#SalmelaWRU17
https://www.ncbi.nlm.nih.gov/pubmed/27273673
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01385006/document
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5351550
http://hdl.handle.net/10138/182781
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01385006v1
https://doi.org/10.1093/bioinformatics/btw321
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01385006v1/document

View record at OpenAIRE

Full Text

Full Text Finder

Nájsť tento článok vo Web of Science

12

Superstrings with multiplicities

Autori: Rivals, Eric Cazaux, Bastien Institut de Biologie Computationnelle (IBC) a ďalší

Prispievatelia: Rivals, Eric Cazaux, Bastien Institut de Biologie Computationnelle (IBC) a ďalší

Zdroj: 29th Annual Symposium on Combinatorial Pattern Matching (CPM)
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01843225
29th Annual Symposium on Combinatorial Pattern Matching (CPM), Qingdao University, Jul 2018, Qingdao, China. pp.21:1-21:16, ⟨10.4230/LIPIcs.CPM.2018.21⟩
http://cpm2018.sdu.edu.cn/index.html

Predmety: algorithm analysis, overlap, subset system, APX, Cyclic covers, Approximation, greedy algorithm, ACM: F.: Theory of Computation, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.2: Approximation, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Geografické téma: Qingdao, China

Dostupnosť: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01843225
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01843225v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01843225v1/file/multi-super-2018-lipics.pdf
https://doi.org/10.4230/LIPIcs.CPM.2018.21

View record from BASE

Nájsť tento článok vo Web of Science

13

A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets

Autori: Basu, Saugata Roy, Marie-Françoise Safey El Din, Mohab a ďalší

Prispievatelia: Basu, Saugata Roy, Marie-Françoise Safey El Din, Mohab a ďalší

Zdroj: Foundations of Computational Mathematics. 14:1117-1172

Predmety: [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Computer Science - Symbolic Computation, FOS: Computer and information sciences, [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], 4. Education, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, 0102 computer and information sciences, Symbolic Computation (cs.SC), 01 natural sciences, Primary 14Q20, Secondary 14P05, 68W05, Mathematics - Algebraic Geometry, FOS: Mathematics, Real algebraic variety, 0101 mathematics, Algebraic Geometry (math.AG), Baby step-giant step, Roadmaps

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/pdf/1201.6439.pdf
http://arxiv.org/abs/1201.6439
https://inria.hal.science/hal-01096209v1
https://inria.hal.science/hal-01096209v1/document
https://doi.org/10.1007/s10208-014-9212-1
https://dblp.uni-trier.de/db/journals/corr/corr1201.html#abs-1201-6439
http://core.ac.uk/display/2251749
https://hal.inria.fr/hal-01096209/document
https://hal.inria.fr/hal-01096209
https://hal-univ-rennes1.archives-ouvertes.fr/hal-01096209
https://link.springer.com/article/10.1007%2Fs10208-014-9212-1

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

14

The Parallel Complexity of Coloring Games

Autori: Ducoffe, Guillaume Combinatorics, Optimization and Algorithms for Telecommunications (COATI) Centre Inria d'Université Côte d'Azur a ďalší

Prispievatelia: Ducoffe, Guillaume Combinatorics, Optimization and Algorithms for Telecommunications (COATI) Centre Inria d'Université Côte d'Azur a ďalší

Zdroj: 9th International Symposium, SAGT 2016
https://hal.science/hal-01361056
9th International Symposium, SAGT 2016, Sep 2016, Liverpool, United Kingdom. pp.27-39, ⟨10.1007/978-3-662-53354-3_3⟩
http://sagt16.csc.liv.ac.uk/

Predmety: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Geografické téma: Liverpool, United Kingdom

Dostupnosť: https://hal.science/hal-01361056
https://hal.science/hal-01361056v1/document
https://hal.science/hal-01361056v1/file/Duc-SAGT16-finale.pdf
https://doi.org/10.1007/978-3-662-53354-3_3

View record from BASE

Nájsť tento článok vo Web of Science

15

Complexity of master–slave tasking on heterogeneous trees: Complexity of master-slave tasking on heterogeneous trees

Autori: Dutot, Pierre-François Parallel algorithms and load sharing (APACHE) Informatique et Distribution (ID-IMAG) a ďalší

Prispievatelia: Dutot, Pierre-François Parallel algorithms and load sharing (APACHE) Informatique et Distribution (ID-IMAG) a ďalší

Zdroj: European Journal of Operational Research. 164:690-695

Predmety: [INFO.INFO-DC]Computer Science [cs]/Distributed, Complexity theory, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, 02 engineering and technology, 16. Peace & justice, Parallel, 7. Clean energy, Heterogeneous platforms, and Cluster Computing [cs.DC], Master-Slave Tasks, 8. Economic growth, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Heterogeneous, NP-Completeness, Master-slave tasking, Performance evaluation, queueing, and scheduling in the context of computer systems

Popis súboru: application/xml; application/pdf

Prístupová URL adresa: https://hal.inria.fr/inria-00001076/file/d_ejor04.pdf
https://zbmath.org/2142263
https://doi.org/10.1016/j.ejor.2003.10.051
https://inria.hal.science/inria-00001076v1
https://hal.inria.fr/inria-00001076
https://dblp.uni-trier.de/db/journals/eor/eor164.html#Dutot05
https://www.sciencedirect.com/science/article/abs/pii/S037722170400116X
https://ideas.repec.org/a/eee/ejores/v164y2005i3p690-695.html
https://hal.inria.fr/inria-00001076/document
https://core.ac.uk/display/20695563

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

16

On the Complexity of Computing Treebreadth

Autori: Ducoffe, Guillaume Legay, Sylvain Nisse, Nicolas a ďalší

Prispievatelia: Ducoffe, Guillaume Legay, Sylvain Nisse, Nicolas a ďalší

Zdroj: 27th International Workshop on Combinatorial Algorithms (IWOCA 2016)
27th International Workshop on Combinatorial Algorithms, IWOCA 2016
https://inria.hal.science/hal-01354996
27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Aug 2016, Helsinki, Finland. pp.3-15, ⟨10.1007/978-3-319-44543-4_1⟩
http://iwoca2016.cs.helsinki.fi/

Predmety: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Geografické téma: Helsinki, Finland

Dostupnosť: https://inria.hal.science/hal-01354996
https://inria.hal.science/hal-01354996v1/document
https://inria.hal.science/hal-01354996v1/file/DLN-IWOCA16.pdf
https://doi.org/10.1007/978-3-319-44543-4_1

View record from BASE

Nájsť tento článok vo Web of Science

17

An Asymptotic Stability Theorem for Divide-and-Conquer Sequences

Autori: GUEDJ, Michael Chambre de commerce et d’industrie - Paris-Île de France (CCIP IDF)

Prispievatelia: GUEDJ, Michael Chambre de commerce et d’industrie - Paris-Île de France (CCIP IDF)

Zdroj: https://hal.archives-ouvertes.fr/hal-02902407 ; 2021.

Predmety: algorithm analysis, asymptotic approximations, divide- and-conquer sequences, recurrence relations, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Relation: hal-02902407; https://hal.archives-ouvertes.fr/hal-02902407; https://hal.archives-ouvertes.fr/hal-02902407v2/document; https://hal.archives-ouvertes.fr/hal-02902407v2/file/MICHAEL_GUEDJ__DAC__E1.pdf

Dostupnosť: https://hal.archives-ouvertes.fr/hal-02902407
https://hal.archives-ouvertes.fr/hal-02902407v2/document
https://hal.archives-ouvertes.fr/hal-02902407v2/file/MICHAEL_GUEDJ__DAC__E1.pdf

View record from BASE

Nájsť tento článok vo Web of Science

18

Multi-Round Cooperative Search Games with Multiple Players

Autori: Korman, Amos Rodeh, Yoav Networks, Graphs and Algorithms (GANG) a ďalší

Prispievatelia: Korman, Amos Rodeh, Yoav Networks, Graphs and Algorithms (GANG) a ďalší

Zdroj: ICALP 2019 - 46th International Colloquium on Automata, Languages and Programming ; https://hal.science/hal-02105524 ; ICALP 2019 - 46th International Colloquium on Automata, Languages and Programming, Jul 2019, Patras, Greece

Predmety: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT]