이전페이지 이동
   Wilkinson, Bryan T. (Bryan T. Wilkinson)
    Center for Massive Data Algorithmics (MADALGO) , Aarhus University
Total: 3
  • Morphing planar graph drawings with a polynomial number of steps (Alamdari, Soroush; Angelini, Patrizio; Chan, Timothy M.; Di Battista, Giuseppe; Frati, Fabrizio; Lubiw, Anna; Patrignani, Maurizio; Roselli, Vincenzo; Singla, Sahil)  Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (2012), Pages 1656–1667 

  • Adaptive and approximate orthogonal range counting.  (Chan, Timothy M.) Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (2012), Pages 241–251 

  • Linear-space data structures for range mode query in arrays. 29th International Symposium on Theoretical Aspects of Computer Science, 290–301 (Chan, Timothy M.; Durocher, Stephane; Larsen, Kasper Green; Morrison, Jason) LIPIcs. Leibniz Int. Proc. Inform. (2012), Vol 14

 
Information Center for Mathematical Sciences KAIST
34141 대전광역시 유성구 대학로 291 (구성동373-1)
한국과학기술원(KAIST) 수리과학정보센터
전화 042-350-8196
e-mail : mathnet@mathnet.or.kr
Copyright (C) 2018. ICMS All Rights Reserved.