Aarhus University Seal / Aarhus Universitets segl

Bryan T. Wilkinson

  1. Paper
  2. Published

    Revisiting visibility in the plane. / Wilkinson, Bryan Thomas.

    2015. Paper presented at International Symposium on Computational Geometry, Eindhoven, Netherlands.

    Research output: Contribution to conferencePaperResearchpeer-review

  3. Published

    Bichromatic Line Segment Intersection Counting in O(n sqrt{log n}) Time. / Chan, Timothy M.; Wilkinson, Bryan T.

    2011. Paper presented at Canadian Conference on Computational Geometry, Canada.

    Research output: Contribution to conferencePaperResearchpeer-review

  4. Published

    Linear-Space Data Structures for Range Minority Query in Arrays. / Chan, Timothy M.; Durocher, Stephane; Skala, Matthew; Wilkinson, Bryan T.

    2012.

    Research output: Contribution to conferencePaperResearchpeer-review

  5. Article in proceedings
  6. Published

    Fast Computation of Categorical Richness on Raster Data Sets and Related Problems. / de Berg, Mark; Tsirogiannis, Constantinos; Wilkinson, Bryan.

    Proceedings. Workshop on Massive Data Algorithmics (MASSIVE). 2015. p. 86-107.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  7. Published

    Fast computation of categorical richness on raster data sets and related problems. / de Berg, Mark; Tsirogiannis, Constantinos; Wilkinson, Bryan T.

    GIS '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems. 2015. 18.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  8. Published

    Approximating convex shapes with respect to symmetric difference under homotheties. / Yon, Juyoung; Won, Sang Bae; Cheng, Siu Wing; Cheong, Otfried; Wilkinson, Bryan T.

    32nd International Symposium on Computational Geometry, SoCG 2016. ed. / Sándor Fekete; Anna Lubiw. Vol. 51 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. p. 63.1-63.15 (Leibniz International Proceedings in Informatics, Vol. 51).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  9. Published

    Amortized bounds for dynamic orthogonal range reporting. / Wilkinson, Bryan T.

    Algorithms - ESA 2014: 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings. ed. / Andreas S. Schulz; Dorothea Wagner . Springer, 2014. p. 842-856 (Lecture Notes in Computer Science, Vol. 8737).

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  10. Published

    Adaptive and Approximate Orthogonal Range Counting. / Chan, Timothy M.; Wilkinson, Bryan Thomas.

    Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 . ed. / Sanjeev Khanna. Society for Industrial and Applied Mathematics, 2013. p. 241-251.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  11. Published

    Concurrent range reporting in two-dimensional space. / Afshani, Peyman; Sheng, Cheng; Tao, Yufei; Wilkinson, Bryan T.

    Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014. ed. / Chandra Chekuri . Association for Computing Machinery, 2014. p. 983-994.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  12. Ph.D. thesis
  13. Published

    Exploring the Problem Space of Orthogonal Range Searching. / Wilkinson, Bryan T.

    Department of Computer Science, Aarhus University, 2015. 87 p.

    Research output: Book/anthology/dissertation/reportPh.D. thesisResearch

Previous 1 2 Next