Alvaro Martín

Orcid: 0000-0001-8601-1242

According to our database1, Alvaro Martín authored at least 28 papers between 2004 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Contact tracing solutions for COVID-19: applications, data privacy and security.
CLEI Electron. J., 2022

Methodology for the development of a scalable module based on a Smart Campus approach to transform a traditional library into a smart library through Indicators and planning of projects.
Proceedings of the IEEE International Smart Cities Conference, 2022

2021
RENANO: a REference-based compressor for NANOpore FASTQ files.
Bioinform., 2021

Proximity tracing applications for COVID-19: data privacy and security.
Proceedings of the XLVII Latin American Computing Conference, 2021

2020
ENANO: Encoder for NANOpore FASTQ files.
Bioinform., 2020

2019
Asymptotically Tight Bounds on the Depth of Estimated Context Trees.
IEEE Trans. Inf. Theory, 2019

Adaptive techniques in e-Learning for transnational programs.
Proceedings of the Seventh International Conference on Technological Ecosystems for Enhancing Multiculturality, 2019

Compression of Nanopore FASTQ Files.
Proceedings of the Bioinformatics and Biomedical Engineering, 2019

2018
Wireless EEG System Achieving High Throughput and Reduced Energy Consumption Through Lossless and Near-Lossless Compression.
IEEE Trans. Biomed. Circuits Syst., 2018

An Inexpensive and Easy to Use Cervical Range of Motion Measurement Solution Using Inertial Sensors.
Sensors, 2018

2017
Efficient Sequential Compression of Multichannel Biomedical Signals.
IEEE J. Biomed. Health Informatics, 2017

2016
Efficient sequential compression of multi-channel biomedical signals.
CoRR, 2016

Asymptotically tight bounds on the depth of estimated context trees.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Wearable EEG via lossless compression.
Proceedings of the 38th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2016

2015
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation.
Theor. Comput. Sci., 2015

Accelerating the Min-Min Heuristic.
Proceedings of the Parallel Processing and Applied Mathematics, 2015

EEG Signal Pre-Processing for the P300 Speller.
Proceedings of the Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2015

2014
Universal Enumerative Coding for Tree Models.
IEEE Trans. Inf. Theory, 2014

Low-complexity, multi-channel, lossless and near-lossless EEG compression.
Proceedings of the 22nd European Signal Processing Conference, 2014

2013
An efficient implementation of the Min-Min heuristic.
Comput. Oper. Res., 2013

2012
Type Classes of Context Trees.
IEEE Trans. Inf. Theory, 2012

Bounds on estimated Markov orders of individual sequences.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2010
Twice-universal simulation of Markov sources and individual sequences.
IEEE Trans. Inf. Theory, 2010

2008
Enumerative coding for tree sources.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Type Classes of Tree Models.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2005
Is image steganography natural?
IEEE Trans. Image Process., 2005

2004
Linear time universal coding and time reversal of tree sources via FSM closure.
IEEE Trans. Inf. Theory, 2004

Linear time universal coding of tree sources via FSM closure.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004


  Loading...