Jérémy Barbay

Johannes Fischer

Stefan Kratsch

Srinivasa Rao Satti

Dagstuhl Reports, 2018

Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation.

[BibT_eX]

[DOI]

Andrés Olivares

Proceedings of the String Processing and Information Retrieval, 2018

Adaptive Computation of the Discrete Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

Synergistic Solutions for Merging and Computing Planar Convex Hulls.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Instance-Optimal Geometric Algorithms.

[BibT_eX]

[DOI]

Peyman Afshani

Timothy M. Chan

J. ACM, 2017

Multivariate Analysis for Computing Maxima in High Dimensions.

[BibT_eX]

[DOI]

Javiel Rojas

CoRR, 2017

Synergistic Computation of Planar Maxima and Convex Hull.

[BibT_eX]

[DOI]

CoRR, 2017

Synergistic Solutions on MultiSets.

[BibT_eX]

[DOI]

Srinivasa Rao Satti

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Depth Distribution in High Dimensions.

[BibT_eX]

[DOI]

Javiel Rojas-Ledesma

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Succinct and Compressed Data Structures for Permutations and Integer Functions.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Near-optimal online multiselection in internal and external memory.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

Synergistic Sorting and Deferred Data Structures on MultiSets.

[BibT_eX]

[DOI]

Srinivasa Rao Satti

CoRR, 2016

Bouncing Towers move faster than Hanoi Towers, but still require exponential time.

[BibT_eX]

[DOI]

CoRR, 2016

Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

"Teaching is learning": Pedagogical material created and evaluated by students.

[BibT_eX]

[DOI]

Jocelyn Simmonds

Adriana Keiko Nishida

Monael Pinheiro Ribeiro

Proceedings of the 2016 IEEE Frontiers in Education Conference, 2016

2015

Adaptive Computation of the Klee's Measure in High Dimensions.

[BibT_eX]

[DOI]

Javiel Rojas-Ledesma

CoRR, 2015

Adaptive Computation of the Swap-Insert Edition Distance.

[BibT_eX]

[DOI]

CoRR, 2015

Refining the Analysis of Divide and Conquer: How and When.

[BibT_eX]

[DOI]

CoRR, 2015

Dynamic Online Multiselection in Internal and External Memory.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014

Maximum-weight planar boxes in O(n<sup>2</sup>) time (and better).

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Efficient Fully-Compressed Sequence Representations.

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

On compressing permutations and adaptive sorting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Compact binary relation representations with rich functionality.

[BibT_eX]

[DOI]

Francisco Claude

Inf. Comput., 2013

Theory and Implementation of Online Multiselection Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Space-Efficient Data Structures, 2013

2012

LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations.

[BibT_eX]

[DOI]

Johannes Fischer

Theor. Comput. Sci., 2012

Review of understanding and applying cryptography and data security by Adam J. Elbirt.

[BibT_eX]

[DOI]

SIGACT News, 2012

Competitive Online Selection in Main and External Memory

[BibT_eX]

[DOI]

CoRR, 2012

Succinct Representation of Labeled Graphs.

[BibT_eX]

[DOI]

Luca Castelli Aleardi

Meng He

J. Ian Munro

Algorithmica, 2012

Adaptive Techniques to find Optimal Planar Boxes.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Succinct indexes for strings, binary relations and multilabeled trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

2010

LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations

[BibT_eX]

[DOI]

Johannes Fischer

CoRR, 2010

Compact Rich-Functional Binary Relation Representations.

[BibT_eX]

[DOI]

Francisco Claude

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Alphabet Partitioning for Compressed Rank/Select and Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

An experimental investigation of set intersection algorithms for text searching.

[BibT_eX]

[DOI]

Tyler Lu

Alejandro Salinger

ACM J. Exp. Algorithmics, 2009

Alphabet Partitioning for Compressed Rank/Select with Applications

[BibT_eX]

[DOI]

CoRR, 2009

Compressed Representations of Permutations, and Applications.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Adaptive Algorithm for Threshold Path Subset Queries.

[BibT_eX]

[DOI]

Aleh Veraskouski

Proceedings of the 2009 International Conference of the Chilean Computer Science Society, 2009

Efficient Algorithms for Context Query Evaluation over a Tagged Corpus.

[BibT_eX]

[DOI]

Alex López-Ortiz

Proceedings of the 2009 International Conference of the Chilean Computer Science Society, 2009

09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms.

[BibT_eX]

[DOI]

Rolf Klein

Rolf Niedermeier

Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms.

[BibT_eX]

[DOI]

Rolf Klein

Rolf Niedermeier

Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

2008

Succinct Encoding of Permutations: Applications to Text Indexing.

[BibT_eX]

[DOI]

J. Ian Munro

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Alternation and redundancy analysis of the intersection problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis.

[BibT_eX]

Eric Y. Chen

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Adaptive searching in succinctly encoded binary relations and tree-structured documents.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Succinct indexes for strings, binary relations and multi-labeled trees.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Faster Adaptive Set Intersections for Text Searching.

[BibT_eX]

[DOI]

Tyler Lu

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2003

Optimality of Randomized Algorithms for the Intersection Problem.

[BibT_eX]

[DOI]

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2003

Deterministic Algorithm for the t-Threshold Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Adaptive intersection and t-threshold problems.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

On the discrete Bak-Sneppen model of self-organized criticality.

[BibT_eX]

[DOI]