المؤلفون: Pissis, Solon P., Shekelyan, Michael, Liu, Chang, Loukides, Grigorios

المساهمون: Nardini, Franco Maria, Pisanti, Nadia, Venturini, Rossano

المصدر: Pissis , S P , Shekelyan , M , Liu , C & Loukides , G 2023 , Frequency-Constrained Substring Complexity . in F M Nardini , N Pisanti & R Venturini (eds) , String Processing and Information Retrieval : 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26–28, 2023, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 14240 LNCS , Springer Science and Business Media Deutschland GmbH , pp. 345-352 , 30th International Symposium on String Processing and Information Retrieval, SPIRE 2023 , Pisa , ....

مصطلحات موضوعية: Predecessor search, Substring complexity, Suffix tree

وصف الملف: application/pdf

Relation: urn:ISBN:9783031439797

الاتاحة: https://research.vu.nl/en/publications/e196449a-2fdc-4d5a-8bac-61e5d6df1046
https://doi.org/10.1007/978-3-031-43980-3_28
https://hdl.handle.net/1871.1/e196449a-2fdc-4d5a-8bac-61e5d6df1046
https://research.vu.nl/ws/files/356286189/Frequency-Constrained_Substring_Complexity.pdf
http://www.scopus.com/inward/record.url?scp=85174451379&partnerID=8YFLogxK
http://www.scopus.com/inward/citedby.url?scp=85174451379&partnerID=8YFLogxK
https://link.springer.com/book/10.1007/978-3-031-43980-3

المؤلفون: Ferragina P., Lillo Fabrizio, Vinciguerra G.

المساهمون: Ferragina, P., Lillo, Fabrizio, Vinciguerra, G.

مصطلحات موضوعية: B-tree, Data structure, Learned indexe, Predecessor search

وصف الملف: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000651623200008; volume:871; firstpage:107; lastpage:120; numberofpages:14; journal:THEORETICAL COMPUTER SCIENCE; info:eu-repo/grantAgreement/EC/H2020/SoBigData++ (INFRAIA-01-2018-2019, grant #871042); “Humane AI (grant #820437).; https://hdl.handle.net/11568/1115376; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85105340798; https://www.sciencedirect.com/science/article/pii/S0304397521002334

الاتاحة: https://hdl.handle.net/11568/1115376
https://doi.org/10.1016/j.tcs.2021.04.015
https://www.sciencedirect.com/science/article/pii/S0304397521002334

المؤلفون: Boninger, Joseph, Brody, Joshua, Kephart, Owen

المساهمون: Joseph Boninger and Joshua Brody and Owen Kephart

مصطلحات موضوعية: dynamic data structures, lower bounds, predecessor search, non-adaptivity

وصف الملف: application/pdf

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

الاتاحة: https://doi.org/10.4230/LIPIcs.FSTTCS.2017.20
https://nbn-resolving.org/urn:nbn:de:0030-drops-83892
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2017.20

المؤلفون: Külekci, M. Oğuzhan, Thankachan, Sharma V.

المصدر: Scopus Export 2015-2019

مصطلحات موضوعية: Data compression, Data structures, Predecessor search, Range searching

Relation: https://stars.library.ucf.edu/scopus2015/5405

الاتاحة: https://stars.library.ucf.edu/scopus2015/5405

المؤلفون: Boninger, Joseph W., , '16, Brody, Joshua, Kephart, Owen, , '18

المصدر: Computer Science Faculty Works

مصطلحات موضوعية: dynamic data structures, encoding, Predecessor Search, Computer Sciences

Relation: https://works.swarthmore.edu/fac-comp-sci/99; https://eccc.weizmann.ac.il/report/2017/050/

الاتاحة: https://works.swarthmore.edu/fac-comp-sci/99
https://eccc.weizmann.ac.il/report/2017/050/

المؤلفون: Rolf Fagerberg, John Howat, Prosenjit Bose, Pat Morin

المصدر: Bose, P, Fagerberg, R, Howat, J & Morin, P 2016, ' Biased Predecessor Search ', Algorithmica, vol. 76, no. 4, pp. 1097-1105 . https://doi.org/10.1007/s00453-016-0146-7

مصطلحات موضوعية: FOS: Computer and information sciences, Theoretical computer science, General Computer Science, Sublinear function, Logarithm, Computer science, media_common.quotation_subject, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Data structures Predecessor search Biased search trees Entropy trees dictionaries bounds space Computer Science Mathematics, 020204 information systems, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Entropy (information theory), Data Structures and Algorithms (cs.DS), Computer Science::Databases, media_common, Applied Mathematics, Linear space, Computer Science::Information Retrieval, Data structure, Universe, Computer Science Applications, 010201 computation theory & mathematics, Bounded function

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f406945bc8bde70b1b8e08265b41ed21

المؤلفون: Bose, Prosenjit, Fagerberg, Rolf, Howat, John, Morin, Pat

المصدر: Bose , P , Fagerberg , R , Howat , J & Morin , P 2016 , ' Biased Predecessor Search ' , Algorithmica , vol. 76 , no. 4 , pp. 1097-1105 . https://doi.org/10.1007/s00453-016-0146-7

مصطلحات موضوعية: Data structures Predecessor search Biased search trees Entropy trees dictionaries bounds space Computer Science Mathematics

Relation: https://portal.findresearcher.sdu.dk/da/publications/5e903c9c-3547-42a7-8c62-676f09a3ba0e

الاتاحة: https://portal.findresearcher.sdu.dk/da/publications/5e903c9c-3547-42a7-8c62-676f09a3ba0e
https://doi.org/10.1007/s00453-016-0146-7

المؤلفون: Rajeev Raman

مصطلحات موضوعية: Uncategorized, Succinct data structures, bit-vectors, predecessor search, sets

Relation: 2381/32216; https://figshare.com/articles/chapter/Rank_and_Select_Operations_on_Binary_Strings/10129148

الاتاحة: https://figshare.com/articles/chapter/Rank_and_Select_Operations_on_Binary_Strings/10129148

المؤلفون: Raman, Rajeev

مصطلحات موضوعية: Succinct data structures, bit-vectors, predecessor search, sets

Relation: Raman, R, Rank and Select Operations on Binary Strings, 'Encyclopaedia of Algorithms', Springer, 2016; http://hdl.handle.net/2381/32216; http://www.springer.com/gb/book/9781493928637

الاتاحة: http://hdl.handle.net/2381/32216
http://www.springer.com/gb/book/9781493928637

المؤلفون: Patrascu, M., Thorup, Mikkel

المصدر: Patrascu , M & Thorup , M 2014 , Dynamic integer sets with optimal rank, select, and predecessor search . in FOCS 2014 : 55th Annual Symposium on Foundations of Computer Science . IEEE , pp. 166-175 , IEEE Annual Symposium on Foundations of Computer Science (FOCS) , Philadelphia , United States , 18/10/2014 . https://doi.org/10.1109/FOCS.2014.26

مصطلحات موضوعية: computational complexity, data structures, random-access storage, data structure, dynamic fusion node, dynamic integer sets, dynamic predecessor, optimal rank, polynomial time, predecessor search, w-bit integers, w-bit word RAM, Computational modeling, Indexes, Polynomials, Probes, Random access memory, Standards, dynamic data structures, integer data structures

الاتاحة: https://researchprofiles.ku.dk/da/publications/dynamic-integer-sets-with-optimal-rank-select-and-predecessor-search(11ee1208-aaf8-4b3b-97fa-db10fa071fd6).html
https://doi.org/10.1109/FOCS.2014.26

المؤلفون: Bose, P. (Prosenjit), Douïeb, K. (Karim), Dujmović, V. (Vida), Howat, J. (John), Morin, P. (Pat)

المصدر: Computational Geometry vol. 46 no. 2, pp. 181-189

مصطلحات موضوعية: Bounded universe, Distance sensitivity, Nearest neighbour search, Predecessor search, Range search

Relation: https://ir.library.carleton.ca/pub/6390

الاتاحة: https://ir.library.carleton.ca/pub/6390
https://doi.org/10.1016/j.comgeo.2012.01.002

المؤلفون: Pissis, S. (Solon), Shekelyan, M. (Michael), Liu, C. (Chang), Loukides, G. (Grigorios)

مصطلحات الفهرس: Predecessor search, Substring complexity, Suffix tree, info:eu-repo/semantics/conferenceObject

URL: http://ir.cwi.nl/pub/33437

المؤلفون: Joseph Boninger and Joshua Brody and Owen Kephart, Boninger, Joseph, Brody, Joshua, Kephart, Owen

مصطلحات الفهرس: dynamic data structures, lower bounds, predecessor search, non-adaptivity, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2017.20
Is Part Of LIPIcs, Volume 93, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)