Result 1 to 11 of 11 total
On space efficient two dimensional range minimum data structures. (English)
Algorithmica 63, No. 4, 815-830 (2012).
1
Two dimensional range minimum queries and Fibonacci lattices. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 217-228 (2012).
2
Succinct representations of binary trees for range minimum queries. (English)
Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20‒22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 396-407 (2012).
3
Two-dimensional range diameter queries. (English)
Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 219-230 (2012).
4
Path minima queries in dynamic weighted trees. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 290-301 (2011).
5
Succinct dynamic cardinal trees with constant time operations for small alphabet. (English)
Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 195-205 (2011).
6
Succinct dynamic cardinal trees with constant time operations for small alphabet (English)
TAMC, 195-205 (2011).
7
Path minima queries in dynamic weighted trees (English)
WADS, 290-301 (2011).
8
On space efficient two dimensional range minimum data structures. (English)
de Berg, Mark (ed.) et al., Algorithms ‒ ESA 2010. 18th annual European symposium, Liverpool, UK, September 6‒8, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-15780-6/pbk). Lecture Notes in Computer Science 6347, 171-182 (2010).
9
On space efficient two dimensional range minimum data structures (English)
ESA (2), 171-182 (2010).
10
Finding motifs based on suffix trie. (English)
Adv. Model. Optim. 11, No. 2, 177-194 (2009).
11
Result 1 to 11 of 11 total
Start
Contact
Print
General Help
