Alejandro Salinger

According to our database1, Alejandro Salinger authored at least 24 papers between 2005 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Putting the Human Back in the AutoML Loop.
Proceedings of the Workshops of the EDBT/ICDT 2020 Joint Conference, 2020

2018
On the Smoothness of Paging Algorithms.
Theory Comput. Syst., 2018

2016
Analyzing Cache Behaviour in Multicore Architectures.
Encyclopedia of Algorithms, 2016

2015
Algorithms in the Ultra-Wide Word Model.
Proceedings of the Theory and Applications of Models of Computation, 2015

2014
The Hausdorff Core Problem on Simple Polygons.
J. Comput. Geom., 2014

Toward a Generic Hybrid CPU-GPU Parallelization of Divide-and-Conquer Algorithms.
Int. J. Netw. Comput., 2014

2013
Models for Parallel Computation in Multi-Core, Heterogeneous, and Ultra Wide-Word Architectures.
PhD thesis, 2013

Broadcasting in Conflict-Aware Multi-channel Networks.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

On the Sublinear Processor Gap for Parallel Architectures.
Proceedings of the Theory and Applications of Models of Computation, 2013

2012
Minimizing Cache Usage in Paging.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Paging for multi-core shared caches.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Untangled monotonic chains and adaptive range search.
Theor. Comput. Sci., 2011

Brief announcement: paging for multicore processors.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

2010
An Improved Line-Separable Algorithm for Discrete Unit Disk Cover.
Discret. Math. Algorithms Appl., 2010

Fast Intersection Algorithms for Sorted Sequences.
Proceedings of the Algorithms and Applications, 2010

2009
An experimental investigation of set intersection algorithms for text searching.
ACM J. Exp. Algorithmics, 2009

Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM).
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

2006
A Simple Alphabet-independent Fm-index.
Int. J. Found. Comput. Sci., 2006

FM-KZ: An even simpler alphabet-independent FM-index.
Proceedings of the Prague Stringology Conference, 2006

2005
Bit-parallel (<i>delta</i>, <i>gamma</i>)-matching and suffix automata.
J. Discrete Algorithms, 2005

A simple alphabet-independent FM-index.
Proceedings of the Prague Stringology Conference, 2005

Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences.
Proceedings of the String Processing and Information Retrieval, 2005


  Loading...