Suchergebnisse - acm: f.: theory of computation/f.2: analysis of algorithms AND (problems OR problems) complexity~

Quelle: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics.
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
https://hal.science/hal-03573476
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Mar 2022, Marseille, France. pp.1-15, ⟨10.4230/LIPIcs.STACS.2022.18⟩
https://stacs2022.sciencesconf.org/

Schlagwörter: computability, tilings, effective subshift, sofic subshift, subshift of finite type, domino problem, aperiodicity, periodicity, subshift, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]

Geographisches Schlagwort: Marseille, France

Verfügbarkeit: https://hal.science/hal-03573476
https://hal.science/hal-03573476v1/document
https://hal.science/hal-03573476v1/file/HAL.pdf
https://doi.org/10.4230/LIPIcs.STACS.2022.18

View record from BASE

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

4

Analyse didactique d’un jeu de recherche : vers une situation fondamentale pour la complexité d’algorithmes et de problèmes

Autoren: Meyer, Antoine Modeste, Simon Laboratoire d'Informatique Gaspard-Monge (LIGM) et al.

Weitere Verfasser: Meyer, Antoine Modeste, Simon Laboratoire d'Informatique Gaspard-Monge (LIGM) et al.

Quelle: Didapro 8 – DidaSTIC, L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation ; https://hal.science/hal-03014372 ; Didapro 8 – DidaSTIC, L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation, Feb 2020, Lille, France ; https://www.didapro.org/8/

Schlagwörter: complexité, algorithme, problème, didactique, 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.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [SHS.EDU]Humanities and Social Sciences/Education

Geographisches Schlagwort: Lille, France

Relation: https://hal.science/hal-02474983v1

Verfügbarkeit: https://hal.science/hal-03014372
https://hal.science/hal-03014372v1/document
https://hal.science/hal-03014372v1/file/Didapro_8_paper_6.pdf

View record from BASE

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

5

Proof-theoretic aspects of the logic of scope

Autoren: Moot, Richard Exploration et exploitation de données textuelles (LIRMM Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) et al.

Weitere Verfasser: Moot, Richard Exploration et exploitation de données textuelles (LIRMM Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) et al.

Quelle: ISSN: 0925-8531.

Schlagwörter: Type-logical grammars, Proof theory, Proof nets, Parsing as deduction, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.3: Deduction and Theorem Proving/I.2.3.1: Deduction (e.g., natural, rule-based), ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing, [INFO]Computer Science [cs]

Verfügbarkeit: https://hal-lirmm.ccsd.cnrs.fr/lirmm-04839702
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04839702v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04839702v1/file/jnll.pdf

View record from BASE

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

6

Synchronous Gathering without Multiplicity Detection: a Certified Algorithm

Autoren: Thibaut Balabonski Sébastien Tixeuil Lionel Rieg et al.

Weitere Verfasser: Thibaut Balabonski Sébastien Tixeuil Lionel Rieg et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783319492582

Schlagwörter: [INFO.INFO-DC]Computer Science [cs]/Distributed, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.5: Reliability/D.4.5.2: Fault-tolerance, Parallel, 01 natural sciences, and Cluster Computing [cs.DC], ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, [INFO]Computer Science [cs], ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.3: Mechanical verification, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.4: Type structure

Dateibeschreibung: application/pdf

Zugangs-URL: https://link.springer.com/article/10.1007/s00224-017-9828-z
https://hal.archives-ouvertes.fr/hal-01894618
https://doi.org/10.1007/s00224-017-9828-z
https://dblp.uni-trier.de/db/journals/mst/mst63.html#BalabonskiDRTU19
https://rd.springer.com/chapter/10.1007/978-3-319-49259-9_2
https://doi.org/10.1007/978-3-319-49259-9_2
https://hal.archives-ouvertes.fr/hal-01491813
https://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://link.springer.com/chapter/10.1007/978-3-319-49259-9_2
http://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://hal.science/hal-01894618v1/document
https://doi.org/10.1007/s00224-017-9828-z
https://hal.science/hal-01894618v1
https://hal.sorbonne-universite.fr/hal-01491813v1
https://doi.org/10.1007/978-3-319-49259-9_2

View record at OpenAIRE

Full Text Finder

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

7

On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics

Autoren: Altisen, Karine Devismes, Stéphane Durand, Anaïs et al.

Weitere Verfasser: Altisen, Karine Devismes, Stéphane Durand, Anaïs et al.

Quelle: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. :21-31

Schlagwörter: 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]

Dateibeschreibung: application/pdf

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

View record at OpenAIRE

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

8

Relationship between superstring and compression measures: New insights on the greedy conjecture

Autoren: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) et al.

Weitere Verfasser: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) et al.

Quelle: Discrete Applied Mathematics. 245:59-64

Schlagwörter: 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]

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01800340
https://www.sciencedirect.com/science/article/pii/S0166218X1730183X
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01800340/document
https://www.sciencedirect.com/science/article/abs/pii/S0166218X1730183X

View record at OpenAIRE

Full Text Finder

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

9

Deterministic factoring with oracles ; Factorisation d'entiers déterministes à l'aide d'oracles

Autoren: Morain, François Renault, Guénaël Smith, Benjamin et al.

Weitere Verfasser: Morain, François Renault, Guénaël Smith, Benjamin et al.

Quelle: ISSN: 0938-1279.

Schlagwörter: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems/F.2.1.4: Number-theoretic computations (e.g., factoring, primality testing), [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

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

Verfügbarkeit: https://inria.hal.science/hal-01715832
https://inria.hal.science/hal-01715832v2/document
https://inria.hal.science/hal-01715832v2/file/hal-oracles.pdf
https://doi.org/10.1007/s00200-021-00521-8

View record from BASE

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

10

On the complexity of theF5Gröbner basis algorithm

Autoren: Bardet, Magali Faugère, Jean-Charles Salvy, Bruno et al.

Weitere Verfasser: Bardet, Magali Faugère, Jean-Charles Salvy, Bruno et al.

Quelle: Journal of Symbolic Computation. 70:49-70

Schlagwörter: [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], Complexity, Symbolic Computation (cs.SC), 16. Peace & justice, 01 natural sciences, Noether Position, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, Regular Sequences, 13. Climate action, Gröbner bases, F5 algorithm, 0101 mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1312.1655
https://www.sciencedirect.com/science/article/abs/pii/S0747717114000935
https://arxiv.org/pdf/1312.1655
https://dblp.uni-trier.de/db/journals/corr/corr1312.html#BardetFS13
https://arxiv.org/abs/1312.1655
https://dl.acm.org/doi/10.1016/j.jsc.2014.09.025
https://hal.inria.fr/hal-01064519/document

View record at OpenAIRE

Full Text Finder

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

11

Implementing number theoretic transforms

Autoren: van der Hoeven, Joris Lecerf, Grégoire Centre National de la Recherche Scientifique (CNRS) et al.

Weitere Verfasser: van der Hoeven, Joris Lecerf, Grégoire Centre National de la Recherche Scientifique (CNRS) et al.

Quelle: https://hal.science/hal-04841449 ; 2024.

Schlagwörter: number theoretic transform, finite fields, codelets, algorithm, complexity bound, integer multiplication, FFT, MSC 68W30, 68Q17, 68W40, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems/F.2.1.4: Number-theoretic computations (e.g., factoring, primality testing), ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.0: General/G.1.0.0: Computer arithmetic, [INFO]Computer Science [cs], [MATH]Mathematics [math]

Relation: info:eu-repo/grantAgreement//101142171/EU/Solving differential equations fast, precisely, and reliably/ODELIX

Verfügbarkeit: https://hal.science/hal-04841449
https://hal.science/hal-04841449v1/document
https://hal.science/hal-04841449v1/file/ntt.pdf

View record from BASE

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

12

Anytime search strategies for constraints satisfaction problem ; Stratégies de résolution anytime de problèmes de satisfaction de contraintes numériques

Autoren: Richard de Latour, Thomas Chenouard, Raphaël Granvilliers, Laurent et al.

Weitere Verfasser: Richard de Latour, Thomas Chenouard, Raphaël Granvilliers, Laurent et al.

Quelle: Journée Francophone de la Programmation par Contrainte ; https://hal.science/hal-03563938 ; Journée Francophone de la Programmation par Contrainte, Jun 2021, Nice, France

Schlagwörter: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.0: General/G.1.0.3: Interval arithmetic, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.0: General/G.1.0.5: Numerical algorithms, [INFO]Computer Science [cs]

Geographisches Schlagwort: Nice, France

Time: Nice, France

Verfügbarkeit: https://hal.science/hal-03563938
https://hal.science/hal-03563938v1/document
https://hal.science/hal-03563938v1/file/Anytime_BPA_JFPC.pdf

View record from BASE

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

13

Towards a Realistic Analysis of Some Popular Sorting Algorithms

Autoren: Clément, Julien Nguyen Thi, Thu Hien Vallée, Brigitte et al.

Weitere Verfasser: Clément, Julien Nguyen Thi, Thu Hien Vallée, Brigitte et al.

Quelle: Combinatorics, Probability and Computing. 24:104-144

Schlagwörter: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], 68Q87, 68P10, 68Q17Secondary 68W05, 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.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 68Q25, 68W40, 94A17, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 68P05, 94A15, 01 natural sciences, 30D10, 30E20, 30E15, 97I80, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], 0101 mathematics, Primary 68W32

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.archives-ouvertes.fr/hal-01103998/file/cpc-PF-style.pdf
https://dblp.uni-trier.de/db/journals/cpc/cpc24.html#ClementTV15
https://hal.archives-ouvertes.fr/hal-01103998

View record at OpenAIRE

Full Text Finder

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

14

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

Autoren: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) et al.

Weitere Verfasser: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) et al.

Quelle: Discrete Applied Mathematics. 212:48-60

Schlagwörter: [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]

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

15

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

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

Weitere Verfasser: Molnár, Miklós Methods, Algorithms for Operations REsearch (MAORE) Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) et al.

Quelle: ISSN: 2327-5219.

Schlagwörter: 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]

Verfügbarkeit: 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

16

Linking indexing data structures to de Bruijn graphs: Construction and update

Autoren: Cazaux, Bastien Lecroq, Thierry Rivals, Eric et al.

Weitere Verfasser: Cazaux, Bastien Lecroq, Thierry Rivals, Eric et al.

Quelle: Journal of Computer and System Sciences. 104:165-183

Schlagwörter: 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]

Dateibeschreibung: application/pdf

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

View record at OpenAIRE

Full Text Finder

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

17

A linear time algorithm for Shortest Cyclic Cover of Strings

Autoren: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) et al.

Weitere Verfasser: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) et al.

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

Schlagwörter: 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]

Dateibeschreibung: application/pdf

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

18

On the Worst-Case Complexity of TimSort

Autoren: Auger, Nicolas Jugé, Vincent Nicaud, Cyril et al.

Weitere Verfasser: Auger, Nicolas Jugé, Vincent Nicaud, Cyril et al.

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

Schlagwörter: 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]

Geographisches Schlagwort: Helsinki, Finland

Verfügbarkeit: 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

19

Parameterized Hardness of Art Gallery Problems

Autoren: Bonnet, Edouard Miltzow, Tillmann Computer and Automation Research Institute Budapest (MTA SZTAKI )

Weitere Verfasser: Bonnet, Edouard Miltzow, Tillmann Computer and Automation Research Institute Budapest (MTA SZTAKI )

Quelle: LIPICS ; 24th European Symposium on Algorithms (ESA 2016) ; https://hal.archives-ouvertes.fr/hal-01994429 ; 24th European Symposium on Algorithms (ESA 2016), Aug 2016, Aarhus, Denmark. pp.19, ⟨10.4230/LIPIcs.ESA.2016.19⟩ ; http://conferences.au.dk/algo16/esa/

Schlagwörter: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]