default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Skala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j12]Prosenjit Bose, Stephane Durocher
, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid:
Local Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. 30(1): 1-17 (2020)
2010 – 2019
- 2018
- [j11]Stephane Durocher, Robert Fraser, Alexandre Leblanc, Jason Morrison, Matthew Skala:
On Combinatorial Depth Measures. Int. J. Comput. Geom. Appl. 28(4): 381-398 (2018) - 2017
- [j10]Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala:
Approximate furthest neighbor with application to annulus query. Inf. Syst. 64: 152-162 (2017) - [j9]Stephane Durocher, Alexandre Leblanc, Matthew Skala:
The projection median as a weighted average. J. Comput. Geom. 8(1): 78-104 (2017) - 2016
- [j8]Stephane Durocher, Rahul Shah, Matthew Skala, Sharma V. Thankachan:
Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees. Algorithmica 74(1): 344-366 (2016) - [c23]Matthew Skala:
Bit-Vector Search Filtering with Application to a Kanji Dictionary. SISAP 2016: 137-150 - [i3]Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala:
Approximate Furthest Neighbor with Application to Annulus Query. CoRR abs/1611.07303 (2016) - 2015
- [j7]Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Minority Query in Arrays. Algorithmica 72(4): 901-913 (2015) - [j6]Stephane Durocher, David S. Gunderson, Pak Ching Li, Matthew Skala:
Cycle-maximal triangle-free graphs. Discret. Math. 338(2): 274-290 (2015) - [c22]Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala:
Approximate Furthest Neighbor in High Dimensions. SISAP 2015: 3-14 - [c21]Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid:
Local Routing in Convex Subdivisions. SOFSEM 2015: 140-151 - 2014
- [j5]Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala:
The Hausdorff Core Problem on Simple Polygons. J. Comput. Geom. 5(1): 14-40 (2014) - [c20]Stephane Durocher, Robert Fraser, Alexandre Leblanc, Jason Morrison, Matthew Skala:
On Combinatorial Depth Measures. CCCG 2014 - [c19]Stephane Durocher, Robert Fraser, Travis Gagie, Debajyoti Mondal, Matthew Skala, Sharma V. Thankachan:
Indexed Geometric Jumbled Pattern Matching. CPM 2014: 110-119 - [i2]Matthew Skala:
A Structural Query System for Han Characters. CoRR abs/1404.5585 (2014) - 2013
- [j4]Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala:
Range majority in constant time and linear space. Inf. Comput. 222: 169-179 (2013) - [j3]Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala:
Robust nonparametric Simplification of Polygonal Chains. Int. J. Comput. Geom. Appl. 23(6): 427-442 (2013) - [c18]Matthew Skala:
Array Range Queries. Space-Efficient Data Structures, Streams, and Algorithms 2013: 333-350 - [c17]Luis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi, Debajyoti Mondal, Jason Morrison, Matthew Skala, Mohammad Abdul Wahid:
On k-Enclosing Objects in a Coloured Point Set. CCCG 2013 - [c16]Stephane Durocher, Rahul Shah, Matthew Skala, Sharma V. Thankachan:
Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees. MFCS 2013: 325-336 - [c15]Stephane Durocher, Rahul Shah, Matthew Skala, Sharma V. Thankachan:
Top-k Color Queries on Tree Paths. SPIRE 2013: 109-115 - 2012
- [c14]Stephane Durocher, Saeed Mehrabi, Matthew Skala, Mohammad Abdul Wahid:
The Cover Contact Graph of Discs Touching a Line. CCCG 2012: 59-64 - [c13]Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala:
Robust Nonparametric Data Approximation of Point Sets via Data Reduction. ISAAC 2012: 319-331 - [c12]Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Minority Query in Arrays. SWAT 2012: 295-306 - [i1]Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala:
Robust Non-Parametric Data Approximation of Pointsets via Data Reduction. CoRR abs/1205.6717 (2012) - 2011
- [j2]Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala:
Untangled monotonic chains and adaptive range search. Theor. Comput. Sci. 412(32): 4200-4211 (2011) - [c11]Stephane Durocher, Saeed Mehrabi, Debajyoti Mondal, Matthew Skala:
Realizing Site Permutations. CCCG 2011 - [c10]Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala:
Range Majority in Constant Time and Linear Space. ICALP (1) 2011: 244-255 - [c9]Matthew Skala, Gerald Penn:
Approximate Bit Vectors for Fast Unification. MOL 2011: 158-173 - 2010
- [c8]Matthew Skala, Victoria Krakovna, János Kramár, Gerald Penn:
A Generalized-Zero-Preserving Method for Compact Encoding of Concept Lattices. ACL 2010: 1512-1521
2000 – 2009
- 2009
- [j1]Matthew Skala:
Counting distance permutations. J. Discrete Algorithms 7(1): 49-61 (2009) - [c7]Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala:
Untangled Monotonic Chains and Adaptive Range Search. ISAAC 2009: 203-212 - [c6]Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala:
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. WADS 2009: 218-229 - 2008
- [b1]Matthew Skala:
Aspects of Metric Spaces in Computation. University of Waterloo, Ontario, Canada, 2008 - [c5]Matthew Skala:
Counting distance permutations. ICDE Workshops 2008: 362-369 - [c4]Matthew Skala:
On the complexity of reverse similarity search. ICDE Workshops 2008: 436-443 - [c3]Matthew Skala:
Counting Distance Permutations. SISAP 2008: 69-76 - [c2]Matthew Skala:
On the Complexity of Reverse Similarity Search. SISAP 2008: 149-156 - 2005
- [c1]Matthew Skala:
Measuring the Difficulty of Distance-Based Indexing. SPIRE 2005: 103-114
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
