Result 1 to 20 of 63 total
On plane constrained bounded-degree spanners. (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, 85-96 (2012).
1
The cost of cache-oblivious searching. (English)
Algorithmica 61, No. 2, 463-505 (2011).
2
Optimal sparse matrix dense vector multiplication in the I/O-model. (English)
Theory Comput. Syst. 47, No. 4, 934-962 (2010).
3
An $O(\log \log n)$-competitive binary search tree with optimal worst-case access times. (English)
Comput. Res. Repos. 2010, Article No. 1003.0139 (2010).
4
An $O(\log \log n)$-competitive binary search tree with optimal worst-case access times. (English)
Kaplan, Haim (ed.), Algorithm theory ‒ SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 38-49 (2010).
5
An $O(\log log n)$-competitive binary search tree with optimal worst-case access times (English)
SWAT, 38-49 (2010).
6
Online sorted range reporting. (English)
Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16‒18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 173-182 (2009).
7
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts (English)
ACM Transactions on Algorithms 6, No. 1 (2009).
8
Online sorted range reporting (English)
ISAAC, 173-182 (2009).
9
Computing the all-pairs quartet distance on a set of evolutionary trees. (English)
J. Bioinform. Comput. Biol. 6, No. 1, 37-50 (2008).
10
On the adaptiveness of quicksort (English)
ACM Journal of Experimental Algorithmics 12 (2008).
11
String sorting (English)
Encyclopedia of Algorithms (2008).
12
Cache-oblivious model (English)
Encyclopedia of Algorithms (2008).
13
Cache-oblivious B-tree (English)
Encyclopedia of Algorithms (2008).
14
Optimal resilient dynamic dictionaries. (English)
Arge, Lars (ed.) et al., Algorithms ‒ ESA 2007. 15th annual European symposium, Eilat, Israel, October 8‒10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 347-358 (2007).
15
Engineering a cache-oblivious sorting algorithm. (English)
ACM J. Exp. Algorithm. 12, Spec. Iss., Article 2.2, 23 p., electronic only (2008).
16
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. (English)
Ma, Bin (ed.) et al., Combinatorial pattern matching. 18th annual symposium, CPM 2007, London, Canada, July 9‒11, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73436-9/pbk). Lecture Notes in Computer Science 4580, 52-62 (2007).
17
Engineering a cache-oblivious sorting algorithm (English)
ACM Journal of Experimental Algorithmics 12 (2007).
18
Optimal resilient dynamic dictionaries (English)
ESA, 347-358 (2007).
19
Computing the all-pairs quartet distance on a set of evolutionary trees (English)
APBC, 91-100 (2007).
20
Result 1 to 20 of 63 total
Start
Contact
Print
General Help
