Spremljaj
Bryan T. Wilkinson
Bryan T. Wilkinson
Preverjeni e-poštni naslov na cs.au.dk - Domača stran
Naslov
Navedeno
Navedeno
Leto
Linear-space data structures for range mode query in arrays
TM Chan, S Durocher, KG Larsen, J Morrison, BT Wilkinson
Theory of Computing Systems 55 (4), 719-741, 2014
582014
How to morph planar graph drawings
S Alamdari, P Angelini, F Barrera-Cruz, TM Chan, GD Lozzo, GD Battista, ...
SIAM Journal on Computing 46 (2), 824-852, 2017
432017
Adaptive and approximate orthogonal range counting
TM Chan, BT Wilkinson
ACM Transactions on Algorithms (TALG) 12 (4), 1-15, 2016
382016
Morphing planar graph drawings with a polynomial number of steps
S Alamdari, P Angelini, TM Chan, G Di Battista, F Frati, A Lubiw, ...
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013
362013
Linear-space data structures for range minority query in arrays
TM Chan, S Durocher, M Skala, BT Wilkinson
Scandinavian Workshop on Algorithm Theory, 295-306, 2012
272012
Amortized bounds for dynamic orthogonal range reporting
BT Wilkinson
Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014
92014
Concurrent range reporting in two-dimensional space
P Afshani, C Sheng, Y Tao, BT Wilkinson
Proceedings of the twenty-fifth annual ACM-SIAM Symposium on Discrete …, 2014
62014
Approximating convex shapes with respect to symmetric difference under homotheties
J Yon, SW Bae, SW Cheng, O Cheong, BT Wilkinson
32nd International Symposium on Computational Geometry (SoCG 2016), 2016
42016
Adaptive range counting and other frequency-based range query problems
BT Wilkinson
University of Waterloo, 2012
32012
Bichromatic line segment intersection counting in o (n√ log n) time
TMY Chan, BT Wilkinson
23rd Annual Canadian Conference on Computational Geometry, CCCG 2011, 2011
22011
Fast computation of categorical richness on raster data sets and related problems
M de Berg, C Tsirogiannis, BT Wilkinson
Proceedings of the 23rd SIGSPATIAL International Conference on Advances in …, 2015
12015
Exploring the problem space of orthogonal range searching
BT Wilkinson
Department Office Computer Science, Aarhus University, 2015
12015
Property Testing on Linked Lists.
P Afshani, K Matulef, BT Wilkinson
Electron. Colloquium Comput. Complex. 20, 187, 2013
12013
Bichromatic Line Segment Intersection Counting in O (n
TM Chan, BT Wilkinson
2011
Soroush Alamdari
MML Walk, M Vatshelle, H Vosoughpour, BT Wilkinson
Cell 2, 2C6, 0
TRE
S Alamdari, P Angelini, TM Chan, G Di Battista, F Frati, A Lubiw, ...
Revisiting Visibility in the Plane
BT Wilkinson
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–17