Matthew Skala

According to our database1, Matthew Skala authored at least 29 papers between 2005 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Local Routing in Convex Subdivisions.
Int. J. Comput. Geom. Appl., 2020

2018
On Combinatorial Depth Measures.
Int. J. Comput. Geom. Appl., 2018

2017
The projection median as a weighted average.
J. Comput. Geom., 2017

Approximate furthest neighbor with application to annulus query.
Inf. Syst., 2017

2016
Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees.
Algorithmica, 2016

Bit-Vector Search Filtering with Application to a Kanji Dictionary.
Proceedings of the Similarity Search and Applications - 9th International Conference, 2016

2015
Cycle-maximal triangle-free graphs.
Discret. Math., 2015

Linear-Space Data Structures for Range Minority Query in Arrays.
Algorithmica, 2015

Approximate Furthest Neighbor in High Dimensions.
Proceedings of the Similarity Search and Applications - 8th International Conference, 2015

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

A Structural Query System for Han Characters.
CoRR, 2014

Indexed Geometric Jumbled Pattern Matching.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
Robust nonparametric Simplification of Polygonal Chains.
Int. J. Comput. Geom. Appl., 2013

Range majority in constant time and linear space.
Inf. Comput., 2013

Top-k Color Queries on Tree Paths.
Proceedings of the String Processing and Information Retrieval, 2013

On k-Enclosing Objects in a Coloured Point Set.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Array Range Queries.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Robust Non-Parametric Data Approximation of Pointsets via Data Reduction
CoRR, 2012

Robust Nonparametric Data Approximation of Point Sets via Data Reduction.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

The Cover Contact Graph of Discs Touching a Line.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

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

Approximate Bit Vectors for Fast Unification.
Proceedings of the Mathematics of Language - 12th Biennial Conference, 2011

Realizing Site Permutations.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
A Generalized-Zero-Preserving Method for Compact Encoding of Concept Lattices.
Proceedings of the ACL 2010, 2010

2009
Counting distance permutations.
J. Discrete Algorithms, 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

2008
Aspects of Metric Spaces in Computation.
PhD thesis, 2008

On the complexity of reverse similarity search.
Proceedings of the 24th International Conference on Data Engineering Workshops, 2008

2005
Measuring the Difficulty of Distance-Based Indexing.
Proceedings of the String Processing and Information Retrieval, 2005


  Loading...