Výsledky vyhľadávania - "sublinear-space algorithm"

Substring Complexity in Sublinear Space

Autori: Giulia Bernardini Gabriele Fici Paweł Gawrychowski a ďalší

Prispievatelia: Giulia Bernardini Gabriele Fici Paweł Gawrychowski a ďalší

Predmety: string algorithm, sublinear-space algorithm, substring complexity, Settore INFO-01/A - Informatica

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001556429800012; ispartofbook:34th International Symposium on Algorithms and Computation (ISAAC 2023); International Symposium on Algorithms and Computation, ISAAC 2023; volume:283; firstpage:1; lastpage:19; numberofpages:19; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/2434/1131463

Dostupnosť: https://hdl.handle.net/2434/1131463
https://doi.org/10.4230/lipics.isaac.2023.12

Substring Complexity in Sublinear Space

Autori: Giulia Bernardini Gabriele Fici Paweł Gawrychowski a ďalší

Prispievatelia: Giulia Bernardini Gabriele Fici Paweł Gawrychowski a ďalší

Predmety: FOS: Computer and information sciences, substring complexity, sublinear-space algorithm, string algorithm, Settore INF/01 - Informatica, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), sublinear-space algorithm, string algorithm, substring complexity, ddc:004

Popis súboru: ELETTRONICO; application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2007.08357
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.12
https://hdl.handle.net/11368/3065698
https://inria.hal.science/hal-04385532v1/document
https://inria.hal.science/hal-04385532v1
https://doi.org/10.4230/lipics.isaac.2023.12
https://hdl.handle.net/2434/1131463
https://doi.org/10.4230/lipics.isaac.2023.12
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.12
https://hdl.handle.net/10447/619240
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.12
https://doi.org/10.4230/lipics.isaac.2023.12
https://hdl.handle.net/11368/3065698

An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability

Autori: Jain, Rahul Tewari, Raghunath Rahul Jain and Raghunath Tewari

Prispievatelia: Jain, Rahul Tewari, Raghunath Rahul Jain and Raghunath Tewari

Predmety: graph reachability, grid graph, graph algorithm, sublinear space algorithm

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 150, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.19

Dostupnosť: https://doi.org/10.4230/LIPIcs.FSTTCS.2019.19
https://nbn-resolving.org/urn:nbn:de:0030-drops-115813
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.19

O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem

Autori: Ashida, Ryo Nakagawa, Kotaro Ryo Ashida and Kotaro Nakagawa

Prispievatelia: Ashida, Ryo Nakagawa, Kotaro Ryo Ashida and Kotaro Nakagawa

Predmety: graph reachability, grid graph, graph algorithm, sublinear space algorithm

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.5

Dostupnosť: https://doi.org/10.4230/LIPIcs.SoCG.2018.5
https://nbn-resolving.org/urn:nbn:de:0030-drops-87182
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.5

$\tilde{O}(n^{1/3})$-Space Algorithm for the Grid Graph Reachability Problem

Autori: Ashida, Ryo Nakagawa, Kotaro Ryo Ashida and Kotaro Nakagawa

Prispievatelia: Ashida, Ryo Nakagawa, Kotaro Ryo Ashida and Kotaro Nakagawa

Zdroj: arXiv: Data Structures and Algorithms.

Predmety: FOS: Computer and information sciences, sublinear space algorithm, graph algorithm, 4. Education, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), grid graph, 0102 computer and information sciences, ddc:004, 01 natural sciences, 7. Clean energy, graph reachability

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/1803.07097
http://export.arxiv.org/pdf/1803.07097
https://arxiv.org/abs/1803.07097
http://ui.adsabs.harvard.edu/abs/2018arXiv180307097A/abstract
https://arxiv.org/pdf/1803.07097v3
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.5

A Space-Efficient Separator Algorithm for Planar Graphs

Autori: Osamu WATANABE Ryo ASHIDA Sebastian KUHNERT

Zdroj: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2019, E102.A(9):1007

Substring complexity in sublinear space

Autori: Bernardini, G. (Giulia) Fici, G. (Gabriele) Gawrychowski, P. (Paweł) a ďalší

Témy: String algorithm, Sublinear-space algorithm, Substring complexity, info:eu-repo/semantics/conferenceObject

URL: https://ir.cwi.nl/pub/33609
info:eu-repo/grantAgreement/EC/H2020/872539
info:eu-repo/grantAgreement/EC/H2020/956229