|
Fast Compressed Self Indexes With Deterministic Linear Time Construction
|
2020 |
1 |
artículo de investigación |
Algorithmica
|
WoS Scopus |
|
Optimal Time Text Indexing In Bwt Runs Bounded Space
|
2018 |
34 |
proceedings paper |
Soda'18: Proceedings Of The Twenty Ninth Annual Acm Siam Symposium On Discrete Algorithms
|
WoS Scopus |
|
Cell Cycle And Protein Complex Dynamics In Discovering Signaling Pathways
|
2019 |
0 |
artículo de investigación |
Journal Of Bioinformatics And Computational Biology
|
WoS Scopus |
|
Practical Indexing Of Repetitive Collections Using Relative Lempel Ziv
|
2019 |
2 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Space Efficient Computation Of The Burrows Wheeler Transform
|
2019 |
4 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Tunneling On Wheeler Graphs
|
2019 |
7 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Dv2v: A Dynamic Variable To Variable Compressor
|
2019 |
0 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
On The Reproducibility Of Experiments Of Indexing Repetitive Document Collections
|
2019 |
2 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
Document Listing On Repetitive Collections With Guaranteed Performance
|
2019 |
5 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Path Queries On Functions
|
2019 |
1 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Re Pair And All Irreducible Grammars Are Upper Bounded By High Order Empirical Entropy
|
2019 |
11 |
artículo de investigación |
Ieee Transactions On Information Theory
|
WoS Scopus |
|
A Self Index On Block Trees
|
2017 |
7 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Efficient Compression And Indexing Of Trajectories
|
2017 |
1 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Lz78 Compression In Low Main Memory Space
|
2017 |
0 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Optimal Dynamic Sequence Representations
|
2013 |
16 |
proceedings paper |
Proceedings Of The Twenty Fourth Annual Acm Siam Symposium On Discrete Algorithms (Soda 2013)
|
WoS Scopus |
|
Gra Ct: A Grammar Based Compressed Index For Trajectory Data
|
2019 |
15 |
artículo de investigación |
Information Sciences
|
WoS Scopus |
|
Universal Compressed Text Indexing
|
2019 |
16 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Lempel Ziv Compressed Structures For Document Retrieval
|
2019 |
1 |
artículo de investigación |
Information And Computation
|
WoS Scopus |
|
On The Approximation Ratio Of Lempel Ziv Parsing
|
2018 |
12 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Relative Suffix Trees
|
2018 |
3 |
artículo de investigación |
Computer Journal
|
WoS Scopus |
|
Fast And Compact Planar Embeddings
|
2017 |
1 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Guest Editorial: Special Issue On Compact Data Structures
|
2018 |
0 |
material editorial |
Algorithmica
|
WoS Scopus |
|
Space Efficient Construction Of Compressed Indexes In Deterministic Linear Time
|
2017 |
23 |
proceedings paper |
Life With Ore Deposits On Earth, Proceedings Of The 15 Th Sga Biennial Meeting, 2019, Vols 1 4
|
WoS Scopus |
|
Guest Editorial: Special Issue On Theoretical Informatics
|
2018 |
0 |
material editorial |
Algorithmica
|
WoS Scopus |
|
Protein Complex Prediction Via Dense Subgraphs And False Positive Analysis
|
2017 |
6 |
artículo de investigación |
P Lo S One
|
WoS Scopus |
|
Compressed Representation Of Dynamic Binary Relations With Applications
|
2017 |
12 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
Asymptotically Optimal Encodings Of Range Data Structures For Selection And Top K Queries
|
2017 |
2 |
artículo de investigación |
Acm Transactions On Algorithms
|
WoS Scopus |
|
Improved Range Minimum Queries
|
2017 |
5 |
artículo de investigación |
Journal Of Discrete Algorithms
|
WoS Scopus |
|
Grammar Compressed Sequences With Rank/Select Support
|
2017 |
1 |
artículo de investigación |
Journal Of Discrete Algorithms
|
WoS Scopus |
|
A Succinct Data Structure For Self Indexing Ternary Relations
|
2017 |
8 |
artículo de investigación |
Journal Of Discrete Algorithms
|
WoS Scopus |
|
Compressed Dynamic Range Majority Data Structures
|
2017 |
1 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Document Retrieval On Repetitive String Collections
|
2017 |
10 |
artículo de investigación |
Information Retrieval
|
WoS Scopus |
|
Top K Term Proximity In Succinct Space
|
2017 |
3 |
artículo de investigación |
Algorithmica
|
WoS Scopus |
|
Lz77 Like Compression With Fast Random Access
|
2010 |
36 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
A New Searchable Variable To Variable Compressor
|
2010 |
6 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Time Optimal Top K Document Retrieval
|
2017 |
12 |
artículo de investigación |
Siam Journal On Computing
|
WoS Scopus |
|
Inverted Treaps
|
2017 |
0 |
artículo de investigación |
Acm Transactions On Information Systems
|
WoS Scopus |
|
An Empirical Evaluation Of Intrinsic Dimension Estimators
|
2017 |
15 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
Improved Range Minimum Queries
|
2016 |
4 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Simple And Efficient Fully Functional Succinct Trees
|
2016 |
3 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Recent Trends
|
2016 |
3 |
artículo de investigación |
Compact Data Structures: A Practical Approach
|
WoS |
|
Dynamic Structures
|
2016 |
0 |
artículo de investigación |
Compact Data Structures: A Practical Approach
|
WoS |
|
Texts
|
2016 |
0 |
artículo de investigación |
Compact Data Structures: A Practical Approach
|
WoS |
|
Grids
|
2016 |
0 |
artículo de investigación |
Compact Data Structures: A Practical Approach
|
WoS |
|
Graphs
|
2016 |
0 |
artículo de investigación |
Compact Data Structures: A Practical Approach
|
WoS |
|
Trees
|
2016 |
0 |
artículo de investigación |
Compact Data Structures: A Practical Approach
|
WoS |
|
Sequences
|
2016 |
0 |
artículo de investigación |
Compact Data Structures: A Practical Approach
|
WoS |
|
Parentheses
|
2016 |
0 |
artículo de investigación |
Compact Data Structures: A Practical Approach
|
WoS |
|
Permutations
|
2016 |
0 |
artículo de investigación |
Compact Data Structures: A Practical Approach
|
WoS |
|
Arrays
|
2016 |
0 |
artículo de investigación |
Compact Data Structures: A Practical Approach
|
WoS |
|
Entropy And Coding
|
2016 |
1 |
artículo de investigación |
Compact Data Structures: A Practical Approach
|
WoS |
|
Bitvectors
|
2016 |
0 |
artículo de investigación |
Compact Data Structures: A Practical Approach
|
WoS |
|
Compact Data Structures A Practical Approach Introduction
|
2016 |
2 |
material editorial |
Compact Data Structures: A Practical Approach
|
WoS |
|
Efficient Representation Of Multidimensional Data Over Hierarchical Domains
|
2016 |
6 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Practical Dynamic Entropy Compressed Bitvectors With Applications
|
2016 |
3 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Document Counting In Compressed Space
|
2015 |
3 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Faster Compressed Quadtrees
|
2015 |
9 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Universal Indexes For Highly Repetitive Document Collections
|
2016 |
16 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints
|
2016 |
0 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
New Dynamic Metric Indices For Secondary Memory
|
2016 |
11 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
Aggregated 2 D Range Queries On Clustered Points
|
2016 |
6 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
An Empirical Evaluation Of Intrinsic Dimension Estimators
|
2015 |
1 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Optimal Encodings For Range Majority Queries
|
2016 |
4 |
artículo de investigación |
Algorithmica
|
WoS Scopus |
|
Practical Compressed String Dictionaries
|
2016 |
30 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
A Compact Rdf Store Using Suffix Arrays
|
2015 |
16 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Efficient And Compact Representations Of Prefix Codes
|
2015 |
9 |
artículo de investigación |
Ieee Transactions On Information Theory
|
WoS Scopus |
|
Bottom K Document Retrieval
|
2015 |
1 |
artículo de investigación |
Journal Of Discrete Algorithms
|
WoS Scopus |
|
Improved And Extended Locating Functionality On Compressed Suffix Arrays
|
2015 |
6 |
artículo de investigación |
Journal Of Discrete Algorithms
|
WoS Scopus |
|
Compressed Vertical Partitioning For Efficient Rdf Management
|
2015 |
27 |
artículo de investigación |
Knowledge And Information Systems
|
WoS Scopus |
|
Optimal Lower And Upper Bounds For Representing Sequences
|
2015 |
32 |
artículo de investigación |
Acm Transactions On Algorithms
|
WoS Scopus |
|
Top K Term Proximity In Succinct Space
|
2014 |
4 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Near Neighbor Searching With K Nearest References
|
2015 |
18 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
Pcap Wt: An Efficient Packet Extraction Tool For Large Volume Network Traces
|
2015 |
4 |
artículo de investigación |
Computer Networks
|
WoS Scopus |
|
Ranked Document Selection
|
2014 |
3 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Fast In Memory X Path Search Using Compressed Indexes
|
2015 |
8 |
artículo de investigación |
Software Practice & Experience
|
WoS Scopus |
|
K 2 Treaps: Range Top K Queries In Compact Space
|
2014 |
7 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Efficient Indexing And Representation Of Web Access Logs
|
2014 |
1 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Grammar Compressed Sequences With Rank/Select Support
|
2014 |
8 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Efficient Compressed Indexing For Approximate Top K String Retrieval
|
2014 |
2 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Parallel Family Trees For Transfer Matrices In The Potts Model
|
2015 |
2 |
artículo de investigación |
Computer Physics Communications
|
WoS Scopus |
|
Document Retrieval On Repetitive Collections
|
2014 |
5 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Dynamic List Of Clusters In Secondary Memory
|
2014 |
5 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Optimal Dynamic Sequence Representations
|
2014 |
21 |
artículo de investigación |
Siam Journal On Computing
|
WoS Scopus |
|
The Wavelet Matrix: An Efficient Wavelet Tree For Large Alphabets
|
2015 |
30 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
Alphabet Independent Compressed Text Indexing
|
2014 |
32 |
artículo de investigación |
Acm Transactions On Algorithms
|
WoS Scopus |
|
Top K Document Retrieval In Compact Space And Near Optimal Time
|
2013 |
2 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Improved And Extended Locating Functionality On Compressed Suffix Arrays
|
2014 |
1 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Faster Compressed Suffix Trees For Repetitive Text Collections
|
2014 |
8 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Document Listing On Repetitive Collections
|
2013 |
13 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Distributed Text Search Using Suffix Arrays
|
2014 |
5 |
artículo de investigación |
Parallel Computing
|
WoS Scopus |
|
Alphabet Independent Compressed Text Indexing
|
2011 |
26 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
New Lower And Upper Bounds For Representing Sequences
|
2012 |
21 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Encodings For Range Selection And Top K Queries
|
2013 |
9 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Encodings For Range Majority Queries
|
2014 |
1 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Compressed Representations For Web And Social Graphs
|
2014 |
28 |
artículo de investigación |
Knowledge And Information Systems
|
WoS Scopus |
|
Fully Functional Static And Dynamic Succinct Trees
|
2014 |
48 |
artículo de investigación |
Acm Transactions On Algorithms
|
WoS Scopus |
|
Xxs: Efficient X Path Evaluation On Compressed Xml Documents
|
2014 |
0 |
artículo de investigación |
Acm Transactions On Information Systems
|
WoS Scopus |
|
New Space/Time Tradeoffs For Top K Document Retrieval On Sequences
|
2014 |
6 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Special Section On Selected Papers From Sisap 2012
|
2014 |
0 |
material editorial |
Information Systems
|
WoS Scopus |
|
Maximum Weight Planar Boxes In O(n(2)) Time (And Better)
|
2014 |
13 |
artículo de investigación |
Information Processing Letters
|
WoS Scopus |
|
Spaces, Trees, And Colors: The Algorithmic Landscape Of Document Retrieval On Sequences
|
2014 |
45 |
artículo de investigación |
Acm Computing Surveys
|
WoS Scopus |
|
A Lempel Ziv Compressed Structure For Document Listing
|
2013 |
7 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Faster Top K Document Retrieval In Optimal Space
|
2013 |
8 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Compact Querieable Representations Of Raster Data
|
2013 |
30 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Encoding Range Minima And Range Top 2 Queries
|
2014 |
7 |
artículo de investigación |
Philosophical Transactions Of The Royal Society A Mathematical Physical And Engineering Sciences
|
WoS Scopus |
|
Efficient Fully Compressed Sequence Representations
|
2014 |
24 |
artículo de investigación |
Algorithmica
|
WoS Scopus |
|
Compact Representation Of Web Graphs With Extended Functionality
|
2014 |
81 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
Compact Binary Relation Representations With Rich Functionality
|
2013 |
16 |
artículo de investigación |
Information And Computation
|
WoS Scopus |
|
On Compressing Permutations And Adaptive Sorting
|
2013 |
14 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Entropy Bounded Representation Of Point Grids
|
2014 |
5 |
artículo de investigación |
Computational Geometry Theory And Applications
|
WoS Scopus |
|
Compressing Huffman Models On Large Alphabets
|
2013 |
4 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Faster Compact Top K Document Retrieval
|
2013 |
13 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Succinct Nearest Neighbor Search
|
2013 |
21 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
On Compressing And Indexing Repetitive Sequences
|
2013 |
64 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Colored Range Queries And Document Retrieval
|
2013 |
17 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Space Efficient Data Analysis Queries On Grids
|
2013 |
22 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Space Efficient Representations Of Rectangle Datasets Supporting Orthogonal Range Querying
|
2013 |
16 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
Da Cs: Bringing Direct Access To Variable Length Codes
|
2013 |
61 |
artículo de investigación |
Information Processing & Management
|
WoS Scopus |
|
Implicit Indexing Of Natural Language Text By Reorganizing Bytecodes
|
2012 |
17 |
artículo de investigación |
Information Retrieval
|
WoS Scopus |
|
Smaller Self Indexes For Natural Language
|
2012 |
2 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Dual Sorted Inverted Lists In Practice
|
2012 |
9 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Compressed Representation Of Web And Social Networks Via Dense Subgraphs
|
2012 |
11 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
The Wavelet Matrix
|
2012 |
17 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Improved Grammar Based Compressed Indexes
|
2012 |
37 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Ranked Document Retrieval In (Almost) No Space
|
2012 |
3 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Compressed Suffix Trees For Repetitive Texts
|
2012 |
3 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Lrm Trees: Compressed Indices, Adaptive Sorting, And Compressed Permutations
|
2012 |
6 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Compressed Dynamic Binary Relations
|
2012 |
15 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Space Efficient Data Analysis Queries On Grids
|
2011 |
8 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Improved Compressed Indexes For Full Text Document Retrieval
|
2011 |
2 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Self Indexing Based On Lz77
|
2011 |
37 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Lrm Trees: Compressed Indices, Adaptive Sorting, And Compressed Permutations
|
2011 |
1 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
New Algorithms On Wavelet Trees And Applications To Information Retrieval
|
2012 |
60 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Practical Compressed Document Retrieval
|
2011 |
22 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Compressed String Dictionaries
|
2011 |
18 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Word Based Self Indexes For Natural Language Text
|
2012 |
28 |
artículo de investigación |
Acm Transactions On Information Systems
|
WoS Scopus |
|
Stronger Lempel Ziv Based Compressed Text Indexing
|
2012 |
23 |
artículo de investigación |
Algorithmica
|
WoS Scopus |
|
Boosting Text Compression With Word Based Statistical Encoding(1)
|
2012 |
5 |
artículo de investigación |
Computer Journal
|
WoS Scopus |
|
Self Indexed Grammar Based Compression
|
2011 |
41 |
artículo de investigación |
Fundamenta Informaticae
|
WoS Scopus |
|
Alphabet Partitioning For Compressed Rank/Select And Applications
|
2010 |
39 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Fully Compressed Suffix Trees
|
2011 |
30 |
artículo de investigación |
Acm Transactions On Algorithms
|
WoS Scopus |
|
On Line Approximate String Matching With Bounded Errors
|
2011 |
1 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Improving Semistatic Compression Via Phrase Based Modeling
|
2011 |
2 |
artículo de investigación |
Information Processing & Management
|
WoS Scopus |
|
Stronger Quickheaps
|
2011 |
0 |
artículo de investigación |
International Journal Of Foundations Of Computer Science
|
WoS Scopus |
|
Space Efficient Construction Of Lempel Ziv Compressed Text Indexes
|
2011 |
9 |
artículo de investigación |
Information And Computation
|
WoS Scopus |
|
Fully Dynamic Metric Access Methods Based On Hyperplane Partitioning
|
2011 |
15 |
artículo de investigación |
Information Systems
|
WoS Scopus |
|
Range Queries Over A Compact Representation Of Minimum Bounding Rectangles
|
2010 |
2 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Dual Sorted Inverted Lists
|
2010 |
13 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Colored Range Queries And Document Retrieval
|
2010 |
21 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Top K Ranked Document Search In General Text Databases
|
2010 |
41 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Fast And Compact Web Graph Representations
|
2010 |
45 |
artículo de investigación |
Acm Transactions On The Web
|
WoS Scopus |
|
Dynamic Spatial Approximation Trees For Massive Data
|
2009 |
14 |
proceedings paper |
Sisap 2009: 2009 Second International Workshop On Similarity Search And Applications, Proceedings
|
WoS Scopus |
|
Egnat: A Fully Dynamic Metric Access Method For Secondary Memory
|
2009 |
4 |
proceedings paper |
Sisap 2009: 2009 Second International Workshop On Similarity Search And Applications, Proceedings
|
WoS Scopus |
|
Extended Compact Web Graph Representations
|
2010 |
27 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Fast And Compact Prefix Codes
|
2010 |
6 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Compact Rich Functional Binary Relation Representations
|
2010 |
17 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Practical Compressed Suffix Trees
|
2010 |
13 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Parallel And Distributed Compressed Indexes
|
2010 |
4 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
A Fun Application Of Compact Data Structures To Indexing Geographic Data
|
2010 |
12 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Dynamic Lightweight Text Compression
|
2010 |
17 |
artículo de investigación |
Acm Transactions On Information Systems
|
WoS Scopus |
|
Storage And Retrieval Of Highly Repetitive Sequence Collections
|
2010 |
91 |
artículo de investigación |
Journal Of Computational Biology
|
WoS Scopus |
|
A New Point Access Method Based On Wavelet Trees
|
2009 |
8 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
A Prototype For Querying Over Lzcs Transformed Documents
|
2009 |
0 |
artículo de investigación |
Ieee Latin America Transactions
|
WoS Scopus |
|
On Sorting, Heaps, And Minimum Spanning Trees
|
2010 |
9 |
artículo de investigación |
Algorithmica
|
WoS Scopus |
|
Indexing Variable Length Substrings For Exact And Approximate Matching
|
2009 |
5 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Directly Addressable Variable Length Codes
|
2009 |
24 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
K 2 Trees For Compact Web Graph Representation
|
2009 |
60 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
A Compressed Self Indexed Representation Of Xml Documents
|
2009 |
4 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Faster Entropy Bounded Compressed Suffix Trees
|
2009 |
51 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Rank/Select On Dynamic Compressed Sequences And Applications
|
2009 |
19 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Parameterized Matching On Non Linear Structures
|
2009 |
3 |
artículo de investigación |
Information Processing Letters
|
WoS Scopus |
|
Storage And Retrieval Of Individual Genomes
|
2009 |
24 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Dynamic Entropy Compressed Sequences And Full Text Indexes
|
2008 |
69 |
artículo de investigación |
Acm Transactions On Algorithms
|
WoS Scopus |
|
Improving The Space Cost Of K Nn Search In Metric Spaces By Using Distance Estimators
|
2009 |
7 |
artículo de investigación |
Multimedia Tools And Applications
|
WoS Scopus |
|
New Adaptive Compressors For Natural Language Text
|
2008 |
14 |
artículo de investigación |
Software Practice & Experience
|
WoS Scopus |
|
Effective Proximity Retrieval By Ordering Permutations
|
2008 |
114 |
artículo de investigación |
Ieee Transactions On Pattern Analysis And Machine Intelligence
|
WoS Scopus |
|
Extending General Compact Querieable Representations To Gis Applications
|
2020 |
9 |
artículo de investigación |
Information Sciences
|
WoS Scopus |
|
Compressed Filesystem For Managing Large Genome Collections
|
2019 |
1 |
artículo de investigación |
Bioinformatics
|
WoS Scopus |
|
Gra Ct: A Grammar Based Compressed Representation Of Trajectories
|
2016 |
5 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Efficient And Compact Representations Of Some Non Canonical Prefix Free Codes
|
2016 |
2 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Practical Rank/Select Queries Over Arbitrary Sequences
|
2008 |
75 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Run Length Compressed Indexes Are Superior For Highly Repetitive Sequence Collections
|
2008 |
32 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Indexed Hierarchical Approximate String Matching
|
2008 |
2 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Speeding Up Pattern Matching By Text Sampling
|
2008 |
1 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Self Indexing Natural Language
|
2008 |
9 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
An(other) Entropy Bounded Compressed Suffix Tree
|
2008 |
16 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Dynamic Fully Compressed Suffix Trees
|
2008 |
9 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
On Line Approximate String Matching With Bounded Errors
|
2008 |
1 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Re Pair Achieves High Order Entropy
|
2008 |
13 |
proceedings paper |
|
WoS |
|
Word Based Statistical Compressors As Natural Language Compression Boosters
|
2008 |
2 |
proceedings paper |
|
WoS |
|
On Self Indexing Images : Image Compression With Added
|
2008 |
3 |
proceedings paper |
|
WoS |
|
Improved Dynamic Rank Select Entropy Bound Structures
|
2008 |
12 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Fully Compressed Suffix Trees
|
2008 |
22 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Parallel Computation Of The Burrows Wheeler Transform In Compact Space
|
2020 |
1 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Ranked Document Selection
|
2020 |
3 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Compressed Dynamic Range Majority And Minority Data Structures
|
2020 |
1 |
artículo de investigación |
Algorithmica
|
WoS Scopus |
|
Fully Functional Suffix Trees And Optimal Text Searching In Bwt Runs Bounded Space
|
2020 |
43 |
artículo de investigación |
Journal Of The Acm
|
WoS Scopus |
|
Faster Repetition Aware Compressed Suffix Trees Based On Block Trees
|
2019 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Fast, Small, And Simple Document Listing On Repetitive Text Collections
|
2019 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Rpair: Rescaling Re Pair With Rsync
|
2019 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Implementing The Topological Model Succinctly
|
2019 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Faster Dynamic Compressed D Ary Relations
|
2019 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Improved Compressed String Dictionaries
|
2019 |
2 |
proceedings paper |
|
WoS Scopus |
|
Simulating The Dna Overlap Graph In Succinct Space
|
2019 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
Tree Path Majority Data Structures
|
2018 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
Preface
|
2018 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
A Grammar Compression Algorithm Based On Induced Suffix Sorting
|
2018 |
6 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Compact Representations Of Event Sequences
|
2018 |
1 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Two Dimensional Block Trees
|
2018 |
3 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Exploiting Computation Friendly Graph Compression Methods For Adjacency Matrix Multiplication
|
2018 |
3 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Fast Compressed Self Indexes With Deterministic Linear Time Construction
|
2017 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
Path Queries On Functions
|
2017 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
Document Listing On Repetitive Collections With Guaranteed Performance
|
2017 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
Practical Compact Indexes For Top K Document Retrieval
|
2017 |
0 |
|
Journal Of Experimental Algorithmics
|
Scopus WoS |
|
Implementing The Lz Index: Theory Versus Practice
|
2009 |
0 |
|
Journal Of Experimental Algorithmics
|
Scopus WoS |
|
Faster Compressed Suffix Trees For Repetitive Collections
|
2016 |
0 |
|
Journal Of Experimental Algorithmics
|
Scopus WoS |
|
Latin 2016: Theoretical Informatics 12th Latin American Symposium Ensenada, Mexico, April 11 15, 2016 Proceedings
|
2016 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints
|
2015 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Improved Single Term Top K Document Retrieval
|
2015 |
0 |
|
|
Scopus |
|
Maximum Weight Planar Boxes In O(n2) Time (And Better)
|
2013 |
0 |
|
|
Scopus |
|
Asymptotically Optimal Encodings For Range Selection
|
2014 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
K2 Treaps: Range Top K Queries In Compact Space
|
2014 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Locally Compressed Suffix Arrays
|
2014 |
0 |
|
Journal Of Experimental Algorithmics
|
Scopus WoS |
|
Interleaved <I>K</I><Sup>2</Sup> Tree: Indexing And Navigating Ternary Relations
|
2014 |
7 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Fast Fully Compressed Suffix Trees
|
2014 |
7 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Encoding Data Structures
|
2014 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Wavelet Trees For All
|
2014 |
0 |
|
Journal Of Discrete Algorithms
|
Scopus WoS |
|
Faster And Smaller Inverted Indices With Treaps
|
2013 |
0 |
|
|
Scopus |
|
Adaptive Techniques To Find Optimal Planar Boxes
|
2012 |
0 |
|
|
Scopus |
|
Better Space Bounds For Parameterized Range Majority And Minority
|
2013 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Practical Compressed Suffix Trees
|
2013 |
0 |
|
Algorithms
|
Scopus WoS |
|
Succinct Trees In Practice
|
2010 |
0 |
|
|
Scopus |
|
Compressed Representations Of Permutations, And Applications
|
2009 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
Improved Compressed Indexes For Full Text Document Retrieval
|
2013 |
0 |
|
Journal Of Discrete Algorithms
|
Scopus WoS |
|
Indexing Highly Repetitive Collections
|
2012 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Space Efficient Top K Document Retrieval
|
2012 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Fast, Small, Simple Rank/Select On Bitmaps
|
2012 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Wavelet Trees For All
|
2012 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Sorted Range Reporting
|
2012 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Top K Document Retrieval In Optimal Time And Linear Space
|
2012 |
0 |
|
|
Scopus |
|
String Matching With Alphabet Sampling
|
2012 |
0 |
|
Journal Of Discrete Algorithms
|
Scopus WoS |
|
Practical Approaches To Reduce The Space Requirement Of Lempel Ziv Based Compressed Text Indices
|
2010 |
0 |
|
Journal Of Experimental Algorithmics
|
Scopus WoS |
|
Approximate String Matching With Compressed Indexes
|
2009 |
0 |
|
Algorithms
|
Scopus WoS |
|
The Longest Common Extension Problem Revisited And Applications To Approximate String Searching
|
2010 |
0 |
|
Journal Of Discrete Algorithms
|
Scopus WoS |
|
Compressed Q Gram Indexing For Highly Repetitive Biological Sequences
|
2010 |
0 |
|
|
Scopus |
|
Fast In Memory Xpath Search Using Compressed Indexes
|
2010 |
0 |
|
Ieee 27 Th International Conference On Data Engineering (Icde 2011)
|
Scopus WoS |
|
Analyzing Metric Space Indexes: What For?
|
2009 |
11 |
proceedings paper |
Sisap 2009: 2009 Second International Workshop On Similarity Search And Applications, Proceedings
|
WoS Scopus |
|
Reorganizing Compressed Text
|
2008 |
0 |
|
|
Scopus |
|
Tree Path Majority Data Structures
|
2020 |
0 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
Lempel Ziv Like Parsing In Small Space
|
2020 |
4 |
artículo de investigación |
Algorithmica
|
WoS Scopus |
|
Fast And Compact Planar Embeddings
|
2020 |
11 |
artículo de investigación |
Computational Geometry Theory And Applications
|
WoS Scopus |
|
Improved Compressed String Dictionaries
|
2020 |
0 |
|
Dateso 2011: Databases, Texts, Specifications, Objects
|
Scopus WoS |
|
On The Reproducibility Of Experiments Of Indexing Repetitive Document Collections
|
2020 |
0 |
|
Dateso 2011: Databases, Texts, Specifications, Objects
|
Scopus WoS |
|
Text Indexing And Searching In Sublinear Time
|
2020 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
On Dynamic Succinct Graph Representations
|
2020 |
1 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Approximating Optimal Bidirectional Macro Schemes
|
2020 |
4 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Semantrix: A Compressed Semantic Matrix
|
2020 |
1 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Optimal Joins Using Compact Data Structures
|
2020 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
Latin America Regional Special Section
|
2020 |
0 |
material editorial |
Communications Of The Acm
|
WoS Scopus |
|
An Index For Moving Objects With Constant Time Access To Their Compressed Trajectories
|
2021 |
2 |
artículo de investigación |
International Journal Of Geographical Information Science
|
WoS Scopus |
|
Predecessor Search
|
2020 |
4 |
artículo de investigación |
Acm Computing Surveys
|
WoS Scopus |
|
Towards A Definitive Measure Of Repetitiveness
|
2020 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Contextual Pattern Matching
|
2020 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Practical Random Access To Slp Compressed Texts
|
2020 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Optimal Time Dictionary Compressed Indexes
|
2021 |
7 |
artículo de investigación |
Acm Transactions On Algorithms
|
WoS Scopus |
|
On The Approximation Ratio Of Ordered Parsings
|
2021 |
4 |
artículo de investigación |
Ieee Transactions On Information Theory
|
WoS Scopus |
|
Compact Structure For Sparse Undirected Graphs Based On A Clique Graph Partition
|
2021 |
7 |
artículo de investigación |
Information Sciences
|
WoS Scopus |
|
Indexing Highly Repetitive String Collections, Part I: Repetitiveness Measures
|
2021 |
6 |
artículo de investigación |
Acm Computing Surveys
|
WoS Scopus |
|
Indexing Highly Repetitive String Collections, Part Ii: Compressed Indexes
|
2021 |
4 |
artículo de investigación |
Acm Computing Surveys
|
WoS Scopus |
|
Block Trees
|
2021 |
4 |
artículo de investigación |
Journal Of Computer And System Sciences
|
WoS Scopus |
|
Range Majorities And Minorities In Arrays
|
2021 |
0 |
artículo de investigación |
Algorithmica
|
WoS Scopus |
|
Grammar Compressed Indexes With Logarithmic Search Time
|
2021 |
2 |
artículo de investigación |
Journal Of Computer And System Sciences
|
WoS Scopus |
|
A Grammar Compressor For Collections Of Reads With Applications To The Construction Of The Bwt
|
2021 |
2 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
A Disk Based Index For Trajectories With An In Memory Compressed Cache
|
2021 |
0 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Phoni: Streamed Matching Statistics With Multi Genome References
|
2021 |
1 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Compact Representation Of Spatial Hierarchies And Topological Relationships
|
2021 |
2 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Worst Case Optimal Graph Joins In Almost No Space
|
2021 |
9 |
proceedings paper |
Sigmod'18: Proceedings Of The 2018 International Conference On Management Of Data
|
WoS Scopus |
|
Efficient And Compact Representations Of Some Non Canonical Prefix Free Codes
|
2022 |
0 |
artículo de investigación |
Theoretical Computer Science
|
WoS Scopus |
|
A Practical Succinct Dynamic Graph Representation
|
2022 |
0 |
artículo de investigación |
Information And Computation
|
WoS Scopus |
|
Correction To: Graph Compression For Adjacency Matrix Multiplication (Sn Computer Science, (2022), 3, 3, (193), 10.1007/S42979 022 01084 2)
|
2022 |
0 |
|
|
Scopus |
|
Holz: High Order Entropy Encoding Of Lempel Ziv Factor Distances
|
2022 |
0 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Efficient Construction Of The Bwt For Repetitive Text Using String Compression
|
2022 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
Bi Directional R Indexes
|
2022 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
The Compression Power Of The Bwt
|
2022 |
1 |
material editorial |
Communications Of The Acm
|
WoS Scopus |
|
Optimal Joins Using Compressed Quadtrees
|
2022 |
2 |
artículo de investigación |
Acm Transactions On Database Systems
|
WoS Scopus |
|
Space/Time Efficient Rdf Stores Based On Circular Suffix Sorting
|
2023 |
0 |
artículo de investigación |
Journal Of Supercomputing
|
WoS Scopus |
|
Total Mutational Load And Clinical Features As Predictors Of The Metastatic Status In Lung Adenocarcinoma And Squamous Cell Carcinoma Patients
|
2022 |
0 |
artículo de investigación |
Journal Of Translational Medicine
|
WoS Scopus |
|
Faster Repetition Aware Compressed Suffix Trees Based On Block Trees
|
2022 |
1 |
artículo de investigación |
Information And Computation
|
WoS Scopus |
|
Balancing Run Length Straight Line Programs
|
2022 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Grammar Compression By Induced Suffix Sorting
|
2022 |
0 |
|
Journal Of Experimental Algorithmics
|
Scopus WoS |
|
Compact Data Structures Meet Databases
|
2023 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
Faster Compressed Quadtrees
|
2023 |
0 |
artículo de investigación |
Journal Of Computer And System Sciences
|
WoS Scopus |
|
Navigating Planar Topologies In Near Optimal Space And Time
|
2023 |
0 |
artículo de investigación |
Computational Geometry Theory And Applications
|
WoS Scopus |
|
Two Dimensional Block Trees
|
2022 |
0 |
artículo de investigación |
Computer Journal
|
WoS Scopus |
|
Time And Space Efficient Regular Path Queries
|
2022 |
1 |
proceedings paper |
Ieee 27 Th International Conference On Data Engineering (Icde 2011)
|
WoS Scopus |
|
Faster And Smaller Inverted Indices With Treaps
|
2013 |
19 |
proceedings paper |
|
WoS |
|
Near Optimal Search Time In δ Optimal Space
|
2022 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Compact Representations Of Spatial Hierarchical Structures With Support For Topological Queries
|
2023 |
0 |
artículo de investigación |
Information And Computation
|
WoS Scopus |
|
Toward A Definitive Compressibility Measure For Repetitive Sequences
|
2023 |
0 |
artículo de investigación |
Ieee Transactions On Information Theory
|
WoS Scopus |
|
An Lms Based Grammar Self Index With Local Consistency Properties
|
2021 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Engineering Practical Lempel Ziv Tries
|
2021 |
0 |
|
Journal Of Experimental Algorithmics
|
Scopus WoS |
|
Pfp Compressed Suffix Trees
|
2021 |
0 |
|
|
Scopus |
|
On Stricter Reachable Repetitiveness Measures
|
2021 |
0 |
|
Lecture Notes In Computer Science
|
Scopus WoS |
|
Efficient Construction Of The Bwt For Repetitive Text Using String Compression
|
2023 |
0 |
artículo de investigación |
Information And Computation
|
WoS Scopus |
|
Millennium Db: An Open Source Graph Database System
|
2023 |
0 |
artículo de investigación |
|
WoS Scopus |
|
Optimizing Rp Qs Over A Compact Graph Representation
|
2023 |
0 |
artículo de investigación |
Vldb Journal
|
WoS Scopus |
|
Improving Matrix Vector Multiplication Via Lossless Grammar Compressed Matrices
|
2022 |
0 |
artículo de investigación |
Proceedings Of The Vldb Endowment
|
WoS Scopus |
|
L Systems For Measuring Repetitiveness
|
2023 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
Computing Me Ms On Repetitive Text Collections
|
2023 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
Near Optimal Search Time In δ Optimal Space, And Vice Versa
|
2024 |
0 |
artículo de investigación |
Algorithmica
|
WoS Scopus |
|
Evaluating Regular Path Queries On Compressed Adjacency Matrices
|
2023 |
0 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
A Simple Grammar Based Index For Finding Approximately Longest Common Substrings
|
2023 |
0 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Constant Time And Space Updates For The Sigma Tau Problem
|
2023 |
0 |
proceedings paper |
Lecture Notes In Computer Science
|
WoS Scopus |
|
Faster Compressed Suffix Trees For Repetitive Collections
|
2016 |
0 |
|
Journal Of Experimental Algorithmics
|
Scopus WoS |
|
The Ring: Worst Case Optimal Joins In Graph Databases Using (Almost) No Extra Space
|
2024 |
0 |
artículo de investigación |
Acm Transactions On Database Systems
|
WoS Scopus |
|
Faster Maximal Exact Matches With Lazy Lcp Evaluation
|
2024 |
0 |
proceedings paper |
Proceedings Of The Data Compression Conference
|
WoS Scopus |
|
Space & Time Efficient Leapfrog Triejoin
|
2024 |
0 |
proceedings paper |
|
WoS Scopus |
|
Dynamic Compact Data Structure For Temporal Reachability With Unsorted Contact Insertions
|
2024 |
0 |
artículo de investigación |
Computer Journal
|
WoS Scopus |
|
Space Efficient Data Structures For The Inference Of Subsumption And Disjointness Relations
|
2024 |
0 |
artículo de investigación |
Software Practice & Experience
|
WoS Scopus |
|
Millennium Db: A Multi Modal, Multi Model Graph Database
|
2024 |
0 |
proceedings paper |
Sigmod'18: Proceedings Of The 2018 International Conference On Management Of Data
|
WoS Scopus |
|
Tackling Challenges In Implementing Large Scale Graph Databases
|
2024 |
0 |
|
Communications Of The Acm
|
Scopus WoS |
|
Bat Lz Out Of Hell
|
2024 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
A Textbook Solution For Dynamic Strings
|
2024 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
|
Taxonomic Classification With Maximal Exact Matches In Katka Kernels And Minimizer Digests
|
2024 |
0 |
|
Leibniz International Proceedings In Informatics, Lip Ics
|
Scopus WoS |
