Výsledky vyhledávání - "ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY"
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. :21-31
Témata: pseudo-stabilization, sources, [INFO.INFO-DC]Computer Science [cs]/Distributed, sinks, speculation, leader election, dynamic graphs, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, 0102 computer and information sciences, ACM: F.: Theory of Computation, Parallel, 01 natural sciences, self-stabilization, and Cluster Computing [cs.DC], timely sinks, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], timely sources, [INFO]Computer Science [cs]
Popis souboru: application/pdf
Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-02979166/file/evolvingSourceElection.pdf
https://hal.science/hal-03346225v1/document
https://doi.org/10.1145/3465084.3467917
https://hal.science/hal-03346225v1
https://hal.archives-ouvertes.fr/hal-02979166/document
https://dblp.uni-trier.de/db/conf/podc/podc2021.html#AltisenDDJP21
https://hal.archives-ouvertes.fr/hal-02979166
https://dl.acm .org/doi/pdf/10.1145/3465084.3467917
https://www.podc.org/podc2021/list-of-accepted-papers/#17 -
2
Autoři: a další
Přispěvatelé: a další
Zdroj: Discrete Applied Mathematics. 245:59-64
Témata: 2. Zero hunger, 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], ACM: F.: Theory of Computation, Approximation algorithm, 01 natural sciences, 7. Clean energy, 12. Responsible consumption, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, Shortest Common Superstring Problem, Data compression, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Stringology, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]
Popis souboru: application/pdf
-
3
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.science/hal-03846646 ; 2021.
Témata: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing
-
4
Autoři: a další
Přispěvatelé: a další
Zdroj: Journal of Computer and System Sciences. 104:165-183
Témata: Overlap, 2. Zero hunger, Contracted de Bruijn graph, Bioinformatics, Computer Networks and Communications, Applied Mathematics, 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, 0206 medical engineering, 1. No poverty, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Dynamic update, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Index, Theoretical Computer Science, Suffix tree, Computational Theory and Mathematics, Data structure, Suffix array, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Algorithms, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]
Popis souboru: application/pdf
Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/jcss/jcss104.html#CazauxLR19
https://core.ac.uk/display/82441636
https://www.sciencedirect.com/science/article/pii/S0022000016300502
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01617207
https://doi.org/10.1016/j.jcss.2016.06.008
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01617207/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01617207v1/document
https://doi.org/10.1016/j.jcss.2016.06.008
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01617207v1 -
5
Autoři: a další
Přispěvatelé: a další
Zdroj: Theoretical Computer Science. 775:76-92
Témata: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Computational Social Choice, 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], Robust optimisation, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Algorithmic Complexity, 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], NP-completeness, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, Stable Matching, Artificial inteligence, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], 0202 electrical engineering, electronic engineering, information engineering, Robust Stable Marriage, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Schaefer's Dichotomy, Robustness
Popis souboru: application/pdf
Přístupová URL adresa: https://hal.laas.fr/hal-01974431/file/19-TCS.pdf
https://www.sciencedirect.com/science/article/pii/S0304397518307503
https://doi.org/10.1016/j.tcs.2018.12.017
https://hal.laas.fr/hal-01974431/document
https://dblp.uni-trier.de/db/journals/tcs/tcs775.html#GencSSO19
https://hal.laas.fr/hal-01974431 -
6
Autoři: a další
Přispěvatelé: a další
Zdroj: https://univ-evry.hal.science/hal-05183371 ; 2025.
Témata: 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
-
7
Autoři: a další
Přispěvatelé: a další
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
Témata: 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]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1811.01270; ARXIV: 1811.01270
-
8
Autoři:
Přispěvatelé:
Zdroj: https://hal.archives-ouvertes.fr/hal-02902407 ; 2021.
Témata: 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
-
9
Autoři: a další
Přispěvatelé: a další
Zdroj: Discrete Applied Mathematics. 212:48-60
Témata: [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]
Přístupová URL adresa: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01286943v1
https://doi.org/10.1016/j.dam.2015.06.003 -
10
Autoři: a další
Přispěvatelé: a další
Zdroj: Bioinformatics
Témata: 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 souboru: application/pdf
Pří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 -
11
Autoři: a další
Přispěvatelé: a další
Zdroj: Journal of Discrete Algorithms. 37:56-67
Témata: 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 souboru: application/pdf
Pří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 -
12
Autoři: a další
Přispěvatelé: a další
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⟩Témata: 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]
-
13
Autoři: a další
Přispěvatelé: a další
Zdroj: MICNON 2018 - 2nd IFAC Conference on Modelling, Identification and Control of Nonlinear ; https://hal.science/hal-03053030 ; MICNON 2018 - 2nd IFAC Conference on Modelling, Identification and Control of Nonlinear, Jun 2018, Jalisco, Mexico. pp.543-548, ⟨10.1016/j.ifacol.2018.07.336⟩ ; https://www.micnon2018.org/
Témata: Euler-Lagrange and Quaternion Modeling, Stochastic vs Deterministic State Estimation, Aerial Manipulation, Nonlinear Control, ACM: I.: Computing Methodologies/I.6: SIMULATION AND MODELING, 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], [SPI.AUTO]Engineering Sciences [physics]/Automatic
-
14
Autoři: a další
Přispěvatelé: a další
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.htmlTémata: 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]
-
15
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.science/hal-02979166 ; [Research Report] Université Grenoble Alpes, VERIMAG, UMR 5104, France; LIMOS, Université Clermont Auvergne, CNRS, UMR 6158, France; Université de Bordeaux, LaBRI, UMR 5800, France; Sorbonne Université, Paris, LIP6, UMR 7606, France. 2020.
Témata: sources, sinks, timely sources, timely sinks, speculation, self-stabilization, dynamic graphs, leader election, pseudo-stabilization, ACM: F.: Theory of Computation, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO]Computer Science [cs], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
-
16
Autoři:
Přispěvatelé:
Zdroj: https://hal.archives-ouvertes.fr/hal-02902407 ; 2020.
Témata: algorithm analysis, asymptotic approximations, divide- and-conquer sequences, recurrence relations, ACM: F.: Theory of Computation, 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], [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-02902407/document; https://hal.archives-ouvertes.fr/hal-02902407/file/MICHAEL_GUEDJ_EEE1__MAIN.pdf
-
17
Autoři: a další
Přispěvatelé: a další
Zdroj: ICALP 2017 - 44th International Colloquium on Automata, Languages and Programming ; https://hal.science/hal-01494246 ; ICALP 2017 - 44th International Colloquium on Automata, Languages and Programming, Jul 2017, Warsaw, Poland. pp.1-14, ⟨10.4230/LIPIcs.ICALP.2017.99⟩ ; https://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16038
Témata: Horn formulas, linear time, picture languages, local induction, descriptive complexity, logic programming, cellular automata of any dimension, second-order logic, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
-
18
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 0098-3500 ; ACM Transactions on Mathematical Software ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01415472 ; ACM Transactions on Mathematical Software, 2018, 44 (3), pp.#27. ⟨10.1145/3145573⟩.
Témata: ACM: G.: Mathematics of Computing, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]
-
19
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 0178-2770.
Témata: ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS, ACM: D.: Software/D.1: PROGRAMMING TECHNIQUES, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO]Computer Science [cs], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF]
-
20
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 1045-9219 ; IEEE Transactions on Parallel and Distributed Systems ; https://inria.hal.science/hal-01687189 ; IEEE Transactions on Parallel and Distributed Systems, 2018, 29 (6), pp.1357-1370. ⟨10.1109/TPDS.2018.2793886⟩.
Témata: malleable tasks, task graph, Scheduling, proportional mapping, approximation algorithms, speedup model, ACM: G.: Mathematics of Computing, 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-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Nájsť tento článok vo Web of Science 
Full Text Finder 
Full Text