Susana Ladra

Orcid: 0000-0003-4616-0774

According to our database1, Susana Ladra authored at least 56 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Reproducible experiments with Learned Metric Index Framework.
Inf. Syst., September, 2023

Map algebra on raster datasets represented by compact data structures.
Softw. Pract. Exp., June, 2023

ViQUF: De Novo Viral Quasispecies Reconstruction Using Unitig-Based Flow Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Faster compressed quadtrees.
J. Comput. Syst. Sci., 2023

Augmented Thresholds for MONI.
Proceedings of the Data Compression Conference, 2023

2022
Memory-Efficient Assembly Using Flye.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Correction to: Graph Compression for Adjacency-Matrix Multiplication.
SN Comput. Sci., 2022

Graph Compression for Adjacency-Matrix Multiplication.
SN Comput. Sci., 2022

A Compact Representation of Indoor Trajectories.
IEEE Pervasive Comput., 2022

A practical succinct dynamic graph representation.
Inf. Comput., 2022

2021
Take one for the team: on the time efficiency of application-level buffer-aided relaying in edge cloud communication.
J. Cloud Comput., 2021

Compact structure for sparse undirected graphs based on a clique graph partition.
Inf. Sci., 2021

Inference of viral quasispecies with a paired de Bruijn graph.
Bioinform., 2021

2020
From Coarse to Fine-Grained Parcellation of the Cortical Surface Using a Fiber-Bundle Atlas.
Frontiers Neuroinformatics, 2020

Compressed Data Structures for Binary Relations in Practice.
IEEE Access, 2020

GeoSP: A parallel method for a cortical surface parcellation based on geodesic distance.
Proceedings of the 42nd Annual International Conference of the IEEE Engineering in Medicine & Biology Society, 2020

On Dynamic Succinct Graph Representations.
Proceedings of the Data Compression Conference, 2020

2019
Compact and efficient representation of general graph databases.
Knowl. Inf. Syst., 2019

Set operations over compressed binary relations.
Inf. Syst., 2019

Efficient processing of raster and vector data.
CoRR, 2019

Energy Consumption in Compact Integer Vectors: A Study Case.
IEEE Access, 2019

Space- and Time-Efficient Storage of LiDAR Point Clouds.
Proceedings of the String Processing and Information Retrieval, 2019

2018
Efficient Processing of top-K Vector-Raster Queries Over Compressed Data.
Proceedings of the 2018 Data Compression Conference, 2018

Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication.
Proceedings of the 2018 Data Compression Conference, 2018

About BIRDS project (Bioinformatics and Information Retrieval Data Structures Analysis and Design).
Proceedings of the 5th Spanish Conference on Information Retrieval, 2018

2017
Scalable and queryable compressed storage structure for raster data.
Inf. Syst., 2017

Competitive Author Profiling Using Compression-Based Strategies.
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2017

Exploiting Computation-Friendly Graph Compression Methods.
CoRR, 2017

Handwritten character recognition using some (anti)-diagonal structural features.
CoRR, 2017

2016
Compact and queryable representation of raster datasets.
Proceedings of the 28th International Conference on Scientific and Statistical Database Management, 2016

Compression-Inspired Author Profiling.
Proceedings of the 2016 Data Compression Conference, 2016

Fast compressed-based strategies for author profiling of social media texts.
Proceedings of the 4th Spanish Conference on Information Retrieval, 2016

2015
Faster Compressed Quadtrees.
Proceedings of the 2015 Data Compression Conference, 2015

Efficient Set Operations over k2-Trees.
Proceedings of the 2015 Data Compression Conference, 2015

2014
Compact representation of Web graphs with extended functionality.
Inf. Syst., 2014

2013
DACs: Bringing direct access to variable-length codes.
Inf. Process. Manag., 2013

Context-Based Algorithms for the List-Update Problem under Alternative Cost Models.
Proceedings of the 2013 Data Compression Conference, 2013

2012
Implicit indexing of natural language text by reorganizing bytecodes.
Inf. Retr., 2012

Approximate all-pairs suffix/prefix overlaps.
Inf. Comput., 2012

Exploiting SIMD Instructions in Current Processors to Improve Classical String Algorithms.
Proceedings of the Advances in Databases and Information Systems, 2012

2011
Practical representations for web and social graphs.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010
Information Loss for Synthetic Data through Fuzzy Clustering.
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2010

A compact representation of graph databases.
Proceedings of the Eighth Workshop on Mining and Learning with Graphs, 2010

Almacenamiento y explotación de grandes bases de datos orientadas a grafos.
Proceedings of the XV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2010), 2010

Evaluation of information loss for privacy preserving data mining through comparison of fuzzy partitions.
Proceedings of the FUZZ-IEEE 2010, 2010

2009
Directly Addressable Variable-Length Codes.
Proceedings of the String Processing and Information Retrieval, 2009

k2-Trees for Compact Web Graph Representation.
Proceedings of the String Processing and Information Retrieval, 2009

Reorganizing Compressed Text.
Proceedings of the XIV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2009), 2009

Desarrollo de un compresor de textos orientado a palabras basado en PPM.
Proceedings of the XIV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2009), 2009

Algorithm for Testing the Leibniz Algebra Structure.
Proceedings of the Computer Aided Systems Theory, 2009

2008
On the Comparison of Generic Information Loss Measures and Cluster-Specific Ones.
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2008

Rank and Select for Succinct Data Structures.
Proceedings of the 3rd International Workshop on Views On Designing Complex Architectures, 2008

A Toponym Resolution Service Following the OGC WPS Standard.
Proceedings of the Web and Wireless Geographical Information Systems, 2008

Implementing byte-oriented rank and select operations.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II, 2008

Cluster-Specific Information Loss Measures in Data Privacy: A Review.
Proceedings of the The Third International Conference on Availability, 2008

2007
A New Approach for Document Indexing UsingWavelet Trees.
Proceedings of the 18th International Workshop on Database and Expert Systems Applications (DEXA 2007), 2007


  Loading...