Suchergebnisse - "((\"computing algorithms AND informatics\") OR (\"computing algorithms AND informatik\"))~"

Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs

Autoren: Bringmann, Karl Dueholm Hansen, Thomas Krinninger, Sebastian et al.

Weitere Verfasser: Bringmann, Karl Dueholm Hansen, Thomas Krinninger, Sebastian et al.

Quelle: 44th International Colloquium on Automata, Languages, and Programming
Leibniz International Proceedings in Informatics
Bringmann, K, Hansen, T D & Krinninger, S 2017, Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. in I Chatzigiannakis, P Indyk, F Kuhn & A Muscholl (eds), 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). vol. 80, 124, Dagstuhl Publishing, Dagstuhl, Germany, Leibniz International Proceedings in Informatics, no. 80, pp. 124:1-124:16, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, Warsaw, Poland, 10/07/2017. https://doi.org/10.4230/LIPIcs.ICALP.2017.124

Schlagwörter: FOS: Computer and information sciences, shortest paths, Shortest paths, quantitative verification and synthesis, Quantitative verification and synthesis, Parametric search, 0102 computer and information sciences, Negative cycle detection, 01 natural sciences, 7. Clean energy, parametric search, 102031 Theoretische Informatik, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, negative cycle detection

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1704.08122
https://dblp.uni-trier.de/db/journals/corr/corr1704.html#BringmannHK17
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_2459539
https://uni-salzburg.elsevierpure.com/de/publications/improved-algorithms-for-computing-the-cycle-of-minimum-cost-to-ti-2
https://arxiv.org/abs/1704.08122
https://pure.mpg.de/pubman/item/item_2459539_1/component/file_2459538/arXiv%3A1704.08122.pdf
https://drops.dagstuhl.de/opus/volltexte/2017/7439/
http://ui.adsabs.harvard.edu/abs/2017arXiv170408122B/abstract
http://export.arxiv.org/pdf/1704.08122
https://arxiv.org/pdf/1704.08122.pdf
https://arxiv.org/abs/1704.08122
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.124
http://hdl.handle.net/11858/00-001M-0000-002D-89BE-0
http://hdl.handle.net/11858/00-001M-0000-002D-89BC-3
http://hdl.handle.net/11858/00-001M-0000-002D-89C4-F
https://pure.au.dk/ws/files/120542210/LIPIcs_ICALP_2017_124.pdf

LaRA 2: parallel and vectorized program for sequence–structure alignment of RNA sequences

Autoren: Winkler, Jörg. Urgese, Gianvito. Ficarra, Elisa. et al.

Quelle: BMC Bioinformatics
BMC Bioinformatics, Vol 23, Iss 1, Pp 1-22 (2022)

Schlagwörter: FOS: Computer and information sciences, Parallel computing, 0301 basic medicine, QH301-705.5, Bioinformatics, Computer applications to medicine. Medical informatics, 0206 medical engineering, R858-859.7, 02 engineering and technology, Structural alignment, 03 medical and health sciences, Humans, Biology (General), 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung, Informatik, Base Sequence, Sequence Analysis, RNA, 500 Naturwissenschaften und Mathematik::570 Biowissenschaften, Biologie::570 Biowissenschaften, Biologie, RNA secondary structure, Integer linear program, Algorithms, RNA, Nucleic Acid Conformation, Sequence Alignment, Software

Dateibeschreibung: application/pdf

Zugangs-URL: https://bmcbioinformatics.biomedcentral.com/track/pdf/10.1186/s12859-021-04532-7
https://pubmed.ncbi.nlm.nih.gov/34991448
https://doaj.org/article/f1fe5a027864460d85056977030019a8
http://hdl.handle.net/21.11116/0000-0009-E229-A
http://hdl.handle.net/21.11116/0000-0009-E22B-8
https://link.springer.com/article/10.1186/s12859-021-04532-7
https://doi.org/10.1186/s12859-021-04532-7
https://hdl.handle.net/11583/2954514
https://refubium.fu-berlin.de/handle/fub188/33565
https://doi.org/10.17169/refubium-33286
https://doi.org/10.1186/s12859-021-04532-7

The Complexity of Homomorphism Reconstructibility

Autoren: Jan Böker Louis Härtel Nina Runde et al.

Weitere Verfasser: Jan Böker Louis Härtel Nina Runde et al.

Quelle: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14
41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)

Schlagwörter: FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), Theory of computation → Graph algorithms analysis, graph homomorphism, parameterised complexity, Computer Science - Data Structures and Algorithms, counting complexity, FOS: Mathematics, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2310.09009
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.19
https://publications.rwth-aachen.de/record/981455

Evaluation of Single-Chip, Real-Time Tomographic Data Processing on FPGA SoC Devices

Autoren: G. Korcyl B. C. Hiesmayr B. Jasinska et al.

Quelle: IEEE Transactions on Medical Imaging. 37:2526-2535

Schlagwörter: system design, Physics - Instrumentation and Detectors, parallel computing, FOS: Physical sciences, Equipment Design, Instrumentation and Detectors (physics.ins-det), 102020 Medical informatics, 16. Peace & justice, 102020 Medizinische Informatik, 01 natural sciences, 03 medical and health sciences, 0302 clinical medicine, Positron-Emission Tomography, Image Interpretation, Computer-Assisted, 0103 physical sciences, computer-aided detection and diagnosis, Nuclear imaging, Algorithms

Zugangs-URL: https://ieeexplore.ieee.org/ielx7/42/8514078/08360475.pdf
https://pubmed.ncbi.nlm.nih.gov/29994248
http://arxiv.org/abs/1807.10754
https://ucrisportal.univie.ac.at/de/publications/41c5a087-fa03-4c9b-b853-fc5b4d89cb0d
https://doi.org/10.1109/TMI.2018.2837741
https://arxiv.org/abs/1807.10754
https://ui.adsabs.harvard.edu/abs/2018arXiv180710754K/abstract
https://arxiv.org/pdf/1807.10754
https://dblp.uni-trier.de/db/journals/tmi/tmi37.html#KorcylBCCDFGGGH18
https://ieeexplore.ieee.org/document/8360475/
http://europepmc.org/abstract/MED/29994248
https://pubmed.ncbi.nlm.nih.gov/29994248/
https://ruj.uj.edu.pl/xmlui/handle/item/59773
https://www.ncbi.nlm.nih.gov/pubmed/29994248
https://ruj.uj.edu.pl/xmlui/handle/item/59773

MedShapeNet – a large-scale dataset of 3D medical shapes for computer vision: a large-scale dataset of 3D medical shapes for computer vision

Autoren: Li, Jianning Zhou, Zongwei Yang, Jiancheng et al.

Weitere Verfasser: Li, Jianning Zhou, Zongwei Yang, Jiancheng et al.

Quelle: Biomedical engineering 70(1), 71-90 (2025). doi:10.1515/bmt-2024-0396

Schlagwörter: ddc:004, FOS: Computer and information sciences, 0301 basic medicine, Technology, Computer Science - Machine Learning, 3D medical shapes, Image Processing, Computer Vision and Pattern Recognition (cs.CV), Medizin, SEGMENTATION, Computer Science - Computer Vision and Pattern Recognition, DISEASE, Imaging, Machine Learning (cs.LG), Engineering, benchmark, Computer vision and pattern recognition, 0302 clinical medicine, 0903 Biomedical Engineering, Three-Dimensional/methods, Computer-Assisted/methods, Image Processing, Computer-Assisted, BRAIN, anatomy education, Brain Neoplasms, Databases (cs.DB), [SDV] Life Sciences [q-bio], Sonstiges, machine learning, Brain Neoplasms/diagnostic imaging, Printing, Three-Dimensional, augmented reality, shapeomics, virtual reality, Printing, diagnostic imaging [Brain Neoplasms], Life Sciences & Biomedicine, Algorithms, MRI, methods [Imaging, Three-Dimensional], databases, [SPI] Engineering Sciences [physics], Biomedical Engineering, 03 medical and health sciences, Imaging, Three-Dimensional, Computer Science - Databases, [INFO.INFO-IM]Computer Science [cs]/Medical Imaging, Humans, ddc:610, Engineering, Biomedical, 4003 Biomedical engineering, Science & Technology, DATA processing & computer science, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], 68T01, Informatik, Three-Dimensional, Medical Informatics

Dateibeschreibung: application/pdf; image/jpeg

Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/39733351
http://arxiv.org/abs/2308.16139
https://research.tue.nl/en/publications/5137c767-30e8-49a6-a73f-560ef8ba4dc5
https://doi.org/10.48550/arXiv.2308.16139
https://pub.dzne.de/record/276343
https://lirias.kuleuven.be/handle/20.500.12942/756293
https://doi.org/10.1515/bmt-2024-0396
https://biblio.vub.ac.be/vubir/medshapenet--a-largescale-dataset-of-3d-medical-shapes-for-computer-vision(65464c90-bcda-4794-88cb-08a5fc66ec39).html

Organic Computing : Doctoral Dissertation Colloquium 2015

Autoren: Sven Tomforde Bernhard Sick

Resource Type: eBook.

Schlagworte: Natural computation, Nature-inspired algorithms

Categories: TECHNOLOGY & ENGINEERING / Mechanical

An Algorithmic Meta Theorem for Homomorphism Indistinguishability

Autoren: Seppelt, Tim Frederik Tim Seppelt

Weitere Verfasser: Seppelt, Tim Frederik Tim Seppelt

Quelle: Saarbrücken/Wadern, Germany : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 306, 82:1-82:19 (2024). doi:10.4230/LIPIcs.MFCS.2024.82
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera49. International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, 2024-08-26-2024-08-30
49th International Symposium on Mathematical Foundations of Computer Science

Schlagwörter: Computer Science - Logic in Computer Science, Mathematics of computing → Graph theory, recognisability, Mathematics of computing → Combinatorics, graph minor, Courcelle's Theorem, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, graph homomorphism, randomised algorithm, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, homomorphism indistinguishability, ddc:004, Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2402.08989
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.82
https://publications.rwth-aachen.de/record/991819

An Efficient Algorithm for All-Pairs Bounded Edge Connectivity

Autoren: Shyan Akmal Ce Jin Shyan Akmal and Ce Jin et al.

Weitere Verfasser: Shyan Akmal Ce Jin Shyan Akmal and Ce Jin et al.

Quelle: Algorithmica. 86:1623-1656

Schlagwörter: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), all-pairs, 0102 computer and information sciences, 01 natural sciences, connectivity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, matrix rank, maximum flow, Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2305.02132
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.11

Computing a Subtrajectory Cluster from c-packed Trajectories

Autoren: Gudmundsson, Joachim Huang, Zijin van Renssen, André et al.

Weitere Verfasser: Gudmundsson, Joachim Huang, Zijin van Renssen, André et al.

Quelle: Gudmundsson, J, Huang, Z, van Renssen, A & Wong, S 2023, Computing a Subtrajectory Cluster from c-Packed Trajectories . in S Iwata, S Iwata & N Kakimura (eds), 34th International Symposium on Algorithms and Computation, ISAAC 2023 ., 34, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 283, 34th International Symposium on Algorithms and Computation, ISAAC 2023, Kyoto, Japan, 03/12/2023 . https://doi.org/10.4230/LIPIcs.ISAAC.2023.34

Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, Subtrajectory cluster, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, c-packed trajectories, Computational geometry

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2307.10610
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.34
https://curis.ku.dk/ws/files/390893263/LIPIcs.ISAAC.2023.34.pdf

Computational Complexity of the Weisfeiler-Leman Dimension

Autoren: Lichter, Moritz Raßmann, Simon Schweitzer, Pascal et al.

Weitere Verfasser: Lichter, Moritz Raßmann, Simon Schweitzer, Pascal et al.

Quelle: Saarbrücken/Wadern, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, February, Leibniz International Proceedings in Informatics : LIPIcs 326, 13:1-13:22 (2025). doi:10.4230/LIPIcs.CSL.2025.13
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz33. EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, Netherlands, 2025-02-10-2025-02-14

Schlagwörter: FOS: Computer and information sciences, Weisfeiler-Leman algorithm, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Theory of computation → Problems, reductions and completeness, coherent configurations, Computational Complexity (cs.CC), Computer Science - Computational Complexity, dimension, ddc:004, Theory of computation → Complexity theory and logic, complexity, Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2402.11531
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.13
https://publications.rwth-aachen.de/record/1003905

Generalized Probabilistic Approximate Optimization Algorithm.

Autoren: Abdelrahman AS Chowdhury S Morone F et al.

Quelle: Nature communications [Nat Commun] 2025 Dec 08. Date of Electronic Publication: 2025 Dec 08.

Publikationsart: Journal Article

Info zur Zeitschrift: Publisher: Nature Pub. Group Country of Publication: England NLM ID: 101528555 Publication Model: Print-Electronic Cited Medium: Internet ISSN: 2041-1723 (Electronic) Linking ISSN: 20411723 NLM ISO Abbreviation: Nat Commun Subsets: MEDLINE

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata

Autoren: Bacci, Giorgio Bacci, Giovanni Larsen, Kim G. et al.

Weitere Verfasser: Bacci, Giorgio Bacci, Giovanni Larsen, Kim G. et al.

Quelle: Logical Methods in Computer Science, Vol Volume 17, Issue 1 (2021)
Bacci, G, Bacci, G, Larsen, K G, Mardare, R, Tang, Q & van Breugel, F 2021, 'Computing Probabilistic Bisimilarity Distances for Probabilistic Automata', Logical Methods in Computer Science, vol. 17, no. 1, 9, pp. 1-36. https://doi.org/10.23638/LMCS-17(1:9)2021
Bacci, G, Bacci, G, Larsen, K G, Mardare, R, Tang, Q & van Breugel, F 2019, Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. in W Fokkink & R van Glabbeek (eds), 30th International Conference on Concurrency Theory (CONCUR 2019)., 9, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik GmbH, Leibniz International Proceedings in Informatics, vol. 140, pp. 9:1-9:17, 30th International Conference on Concurrency Theory, Amsterdam, Netherlands, 26/08/2019. https://doi.org/10.4230/LIPIcs.CONCUR.2019.9
30th International Conference on Concurrency Theory (CONCUR 2019)
Logic in Computer Science

Schlagwörter: Simple policy iteration algorithm, QA75, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Logic, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, 7. Clean energy, 01 natural sciences, Simple stochastic games, Behavioural pseudometrics, computer science - logic in computer science, 11. Sustainability, 0202 electrical engineering, electronic engineering, information engineering, Probabilistic automata, 14. Life underwater, 000 Computer science, knowledge, general works, BC1-199, probabilistic automata, Behavioural metrics, 4. Education, QA75.5-76.95, 16. Peace & justice, Logic in Computer Science (cs.LO), computer science - formal languages and automata theory, Electronic computers. Computer science, Computer Science, ddc:004, Stochastic games

Dateibeschreibung: application/pdf; text

Zugangs-URL: http://arxiv.org/abs/1907.01768
https://strathprints.strath.ac.uk/70342/1/Bacci_etal_CONCUR2019_Computing_probabilistic_bisimilarity_distances_for_probabilistic_automata.pdf
https://doaj.org/article/c6f32619ae8444a09335d630eb19c76a
https://lmcs.episciences.org/7147
https://arxiv.org/abs/1907.01768v8
https://vbn.aau.dk/da/publications/6f633c01-bb37-4fcc-8d97-77cf0100395c
https://doi.org/10.23638/LMCS-17(1:9)2021
http://www.scopus.com/inward/record.url?scp=85101651826&partnerID=8YFLogxK
http://www.scopus.com/inward/record.url?scp=85071636423&partnerID=8YFLogxK
https://vbn.aau.dk/da/publications/027298dd-f55c-4787-aec8-379ff4fbd07a
https://doi.org/10.4230/LIPIcs.CONCUR.2019.9
https://vbn.aau.dk/ws/files/320301301/LIPIcs_CONCUR_2019_9.pdf
http://dblp.uni-trier.de/db/conf/concur/concur2019.html#BacciBLMTB19
https://strathprints.strath.ac.uk/70342/
http://drops.dagstuhl.de/opus/volltexte/2019/10911/
https://dblp.uni-trier.de/db/journals/corr/corr1907.html#abs-1907-01768
https://vbn.aau.dk/en/publications/computing-probabilistic-bisimilarity-distances-for-probabilistic-
http://doi.org/10.4230/LIPIcs.CONCUR.2019.9
https://vbn.aau.dk/da/publications/computing-probabilistic-bisimilarity-distances-for-probabilistic--2
https://dblp.uni-trier.de/db/journals/lmcs/lmcs17.html#BacciBLMTB21
https://ora.ox.ac.uk/objects/uuid:02d6cecb-6af5-4803-82f4-e005011cfed6
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.9

Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models

Autoren: BECKER R. FORSTER S. KARRENBAUER A. et al.

Weitere Verfasser: BECKER R. FORSTER S. KARRENBAUER A. et al.

Quelle: 31st International Symposium on Distributed Computing
Leibniz International Proceedings in Informatics

Schlagwörter: FOS: Computer and information sciences, Gradient descent, Shortest Paths, Shortest Transshipment, Shortest paths, Shortest transshipment, Spanner, Undirected min-cost flow, 0102 computer and information sciences, 01 natural sciences, 102031 Theoretische Informatik, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Gradient Descent, Data Structures and Algorithms (cs.DS), Undirected Min-cost Flow, ddc:004, Distributed algorithms, Streaming algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2017/8003/pdf/LIPIcs-DISC-2017-7.pdf
http://arxiv.org/abs/1607.05127
https://epubs.siam.org/doi/abs/10.1137/19M1286955
https://uni-salzburg.elsevierpure.com/en/publications/near-optimal-approximate-shortest-paths-and-transshipment-in-dist-3
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp50.html#BeckerFKL21
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3331646
https://arxiv.org/abs/1607.05127
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_2534318
https://dblp.uni-trier.de/db/conf/wdag/disc2017.html#BeckerKKL17
https://uni-salzburg.elsevierpure.com/de/publications/near-optimal-approximate-shortest-paths-and-transshipment-in-dist-2
http://pubman.mpdl.mpg.de/pubman/item/escidoc:2534318
https://pure.mpg.de/pubman/item/item_2351053_3/component/file_2388668/1607.05127v2
http://ui.adsabs.harvard.edu/abs/2016arXiv160705127B/abstract
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.7
http://hdl.handle.net/11858/00-001M-0000-002B-841B-E
http://hdl.handle.net/11858/00-001M-0000-002C-5582-A
http://hdl.handle.net/11858/00-001M-0000-002B-8419-1
http://hdl.handle.net/21.11116/0000-0000-3F19-F
https://hdl.handle.net/10278/5029569
https://doi.org/10.4230/LIPIcs.DISC.2017.7
https://hdl.handle.net/10278/5029540
https://doi.org/10.1137/19M1286955

Good r-divisions Imply Optimal Amortized Decremental Biconnectivity

Autoren: Jacob Holm Eva Rotenberg Jacob Holm and Eva Rotenberg et al.

Weitere Verfasser: Jacob Holm Eva Rotenberg Jacob Holm and Eva Rotenberg et al.

Quelle: Holm, J & Rotenberg, E 2021, Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity . in Proceedings of 38 th International Symposium on Theoretical Aspects of Computer Science ., 42, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, vol. 187, 38 th International Symposium on Theoretical Aspects of Computer Science, Saarbücken, Germany, 16/03/2021 . https://doi.org/10.4230/LIPIcs.STACS.2021.42
Holm, J & Rotenberg, E 2024, ' Good r-divisions Imply Optimal Amortized Decremental Biconnectivity ', Theory of Computing Systems, vol. 68, no. 4, pp. 1014-1048 . https://doi.org/10.1007/s00224-024-10181-z
Holm, J & Rotenberg, E 2021, Good r-divisions imply optimal amortized decremental biconnectivity . in M Blaser & B Monmege (eds), 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021 ., 42, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 187, pp. 1-18, 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, Virtual, Saarbrucken, Germany, 16/03/2021 . https://doi.org/10.4230/LIPIcs.STACS.2021.42

Schlagwörter: FOS: Computer and information sciences, graph separators, Graph minors, G.2.2, 0102 computer and information sciences, R-divisions, 01 natural sciences, 2-connectivity, Computer Science - Data Structures and Algorithms, Graph separators, Data Structures and Algorithms (cs.DS), ddc:004, E.1, graph minors, r-divisions, Dynamic graphs

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1808.02568
https://orbit.dtu.dk/en/publications/1f2fd1c6-b8f2-43f5-b9a6-632c1d694a79
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.42
https://curis.ku.dk/ws/files/413849893/s00224_024_10181_z.pdf
https://curis.ku.dk/ws/files/298953676/LIPIcs_STACS_2021_42.pdf

CAREx: context-aware read extension of paired-end sequencing data

Autoren: Felix Kallenborn Bertil Schmidt Johannes Gutenberg-Universität Mainz

Weitere Verfasser: Felix Kallenborn Bertil Schmidt Johannes Gutenberg-Universität Mainz

Quelle: BMC Bioinformatics
BMC Bioinformatics, Vol 25, Iss 1, Pp 1-18 (2024)

Schlagwörter: ddc:004, Pseudo-long reads, QH301-705.5, Computer applications to medicine. Medical informatics, GPU, R858-859.7, High-Throughput Nucleotide Sequencing, Sequence Analysis, DNA, 004 Informatik, Next-generation sequencing, Humans, Biology (General), Sequence Alignment, Algorithms, Software, 004 Data processing

Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/38730374
https://doaj.org/article/b0de1e2e458e43759e013b8add2833aa
https://openscience.ub.uni-mainz.de/handle/20.500.12030/10693
https://doi.org/10.25358/openscience-10675

Logarithmic Weisfeiler-Leman Identifies All Planar Graphs

Autoren: Grohe, Martin Kiefer, Sandra Martin Grohe and Sandra Kiefer

Weitere Verfasser: Grohe, Martin Kiefer, Sandra Martin Grohe and Sandra Kiefer

Quelle: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, LIPIcs-Leibniz International Proceedings in Informatics 198, 134:1-134:20 (2021). doi:10.4230/LIPICS.ICALP.2021.134
48th International Colloquium on Automata, Languages, and Programming : ICALP 2021, July 12-16, 2021, Glasgow, Scotland (virtual conference) / edited by Nikhil Bansal, Emanuela Merelli, James Worrell
48th International Colloquium on Automata, Languages, and Programming : ICALP 2021, July 12-16, 2021, Glasgow, Scotland (virtual conference) / edited by Nikhil Bansal, Emanuela Merelli, James Worrell48. International Colloquium on Automata, Languages, and Programming, ICALP 2021, online, 2021-07-12-2021-07-16

Schlagwörter: FOS: Computer and information sciences, Weisfeiler-Leman algorithm, Computer Science - Logic in Computer Science, Mathematics of computing → Graph theory, quantifier depth, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Computational Complexity (cs.CC), Theory of computation → Finite Model Theory, 7. Clean energy, 01 natural sciences, planar graphs, Logic in Computer Science (cs.LO), finite-variable logic, Computer Science - Computational Complexity, FOS: Mathematics, Mathematics - Combinatorics, iteration number, Combinatorics (math.CO), isomorphism testing, ddc:004, 0101 mathematics, Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2106.16218
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.134
https://publications.rwth-aachen.de/record/821975

An Investigation of the Recoverable Robust Assignment Problem

Autoren: Fischer, Dennis Hartmann, Tim A. Lendl, Stefan et al.

Weitere Verfasser: Fischer, Dennis Hartmann, Tim A. Lendl, Stefan et al.

Quelle: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, LIPIcs-Leibniz International Proceedings in Informatics 214, 19:1-19:14 (2021). doi:10.4230/LIPIcs.IPEC.2021.19
16th International Symposium on Parameterized and Exact Computation (IPEC 2021) / Herausgeber: Petr A. Golovach, Meirav Zehavi
16th International Symposium on Parameterized and Exact Computation (IPEC 2021) / Herausgeber: Petr A. Golovach, Meirav Zehavi16. International Symposium on Parameterized and Exact Computation, IPEC 2021, Lisbon, Portugal, 2021-09-08-2021-09-10

Schlagwörter: Mathematics of computing ��� Graph theory, FOS: Computer and information sciences, exact matching, 0211 other engineering and technologies, robust optimization, Theory of computation ��� Fixed parameter tractability, G.2.2, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theory of computation → Fixed parameter tractability, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Mathematics - Optimization and Control, fixed paramter tractablity, Mathematics of computing → Graph theory, assignment problem, F.2.2, 68R10, 68Q27, Optimization and Control (math.OC), RNC, ddc:004, matchings

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2010.11456
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.19
https://publications.rwth-aachen.de/record/835670

Isomorphism for Tournaments of Small Twin Width

Autoren: Grohe, Martin Neuen, Daniel Martin Grohe and Daniel Neuen

Weitere Verfasser: Grohe, Martin Neuen, Daniel Martin Grohe and Daniel Neuen

Quelle: Saarbrücken/Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 297, 78:[1]-78:20 (2024). doi:10.4230/LIPICS.ICALP.2024.78
51st International Colloquium on Automata, Languages, and Programming : ICALP 2024, July 8–12, 2024, Tallinn, Estonia / edited by Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson
51st International Colloquium on Automata, Languages, and Programming : ICALP 2024, July 8–12, 2024, Tallinn, Estonia / edited by Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson51. International Colloquium on Automata, Languages, and Programming, ICALP 2024, Tallinn, Estonia, 2024-07-08-2024-07-12
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming

Schlagwörter: Weisfeiler-Leman algorithm, FOS: Computer and information sciences, twin width, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Theory of computation → Finite Model Theory, tournament isomorphism, Theory of computation → Fixed parameter tractability, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2312.02048
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.78
https://publications.rwth-aachen.de/record/1006759

An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention

Autoren: Boigelot, Bernard Mainz, Isabelle Marsault, Victor et al.

Weitere Verfasser: Boigelot, Bernard Mainz, Isabelle Marsault, Victor et al.

Quelle: Leibniz International Proceedings in Informatics, 80 (2017-08); The 44th International Colloquium on Automata, Languages, and Programming, Warsaw, Poland [PL], Du 10 juillet 2017 au 14 juillet 2017

Schlagwörter: Integer-base systems, Automata, Recognisable sets, Periodic sets, Physical, chemical, mathematical & earth Sciences, Mathematics, Engineering, computing & technology, Computer science, Physique, chimie, mathématiques & sciences de la terre, Mathématiques, Ingénierie, informatique & technologie, Sciences informatiques

Relation: urn:issn:1868-8969

Zugangs-URL: https://orbi.uliege.be/handle/2268/212135

PAC: Computing Join Queries with Semi-Covers

Autoren: Aamer, Heba Ketsman, Bas Heba Aamer and Bas Ketsman et al.

Weitere Verfasser: Aamer, Heba Ketsman, Bas Heba Aamer and Bas Ketsman et al.

Schlagwörter: Worst-case optimal load, MPC model, join queries, ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2025.6
https://biblio.vub.ac.be/vubir/pac-computing-join-queries-with-semicovers(6958c7cd-8e2c-4d61-b00e-d6253e51ece3).html