Brodal, G.S., K. Kaligosi, I. Katriel and M. Kutz: Faster Algorithms for Computing Longest Common Increasing Subsequences. In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006 Lecture Notes in Computer Science. Springer, Berlin, Germany (2006) 330-341.
localid: C1256428004B93B8-2A4A9F04F32099E6C125729600518139-Kaligosi2006b
Dementiev, R., L. Kettner and P. Sanders: STXXL: Standard Template Library for XXL Data Sets. In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005) Lecture Notes in Computer Science. Springer, Berlin, Germany (2005) 640-651.
localid: C1256428004B93B8-D9D8E8218C92A49CC12570F400763062-Kettner2005Stxxl
Brodal, G.S., R. Fagerberg, U. Meyer and N. Zeh: Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings Lecture Notes in Computer Science. Springer, Berlin, Germany (2004) 480-492.
localid: C1256428004B93B8-0A82DCE8EF8974DFC1256F870037AFA0-BFMZ04
Brodal, G.S., R. Fagerberg, U. Meyer and N. Zeh: Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings Lecture Notes in Computer Science. Springer, Berlin, Germany (2004) 480-492.
localid: C1256428004B93B8-0A82DCE8EF8974DFC1256F870037AFA0-BFMZ04
Agarwal, P., L. Arge, G.S. Brodal and J.S. Vitter: I/O-Efficient Dynamic Point Location in Monotone Subdivisions. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99) ACM, New York, USA (1999) 11-20.
localid: C1256428004B93B8-AD0B65C4A88AB57EC1256702006673FF-Agarwal99
Brodal, G.S., J.L. Träff and C. Zaroliagis: A Parallel Priority Queue with Constant Time Operations. In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures 49, 1, 4-21 (1998).
localid: C1256428004B93B8-B361FCC97C8B40D1C125670200693C69-Brodal1998d
Brodal, G.S. and M.C. Pinotti: Comparator Networks for Binary Heap Construction. In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), (Eds.) Arnborg, Stefan; Ivansson, Lars. Lecture Notes in Computer Science. Springer, Berlin, Germany (1998) 158-168.
localid: C1256428004B93B8-E99AF9AE98C4B67CC125670200685D3A-Brodal1998c
Brodal, G.S.: Finger Search Trees with Constant Update Time. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98) ACM Press / SIAM, New York, USA (1998) 540-549.
localid: C1256428004B93B8-F7F4FED03445DDFFC12565B70057C405-Brodal98a
Brodal, G.S. and J. Katajainen: Worst-Case Efficient External-Memory Priority Queues. In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), (Eds.) Arnborg, Stefan; Ivansson, Lars. Lecture Notes in Computer Science. Springer, Berlin, Germany (1998) 107-118.
localid: C1256428004B93B8-AE17AD70BAC468B9C12567020067F566-Brodal1998b
Brodal, G.S., J.L. Träff and C. Zaroliagis: A parallel priority data structure with applications. In: 11th Internatinal Parallel Processing Symposium (IPPS-97), (Eds.) Feitelson, Dror G.; Rudolph, Larry. IEEE, Los Alamitos, USA (1997) 689-693.
localid: C1256428004B93B8-2723CC2AC3956601C125648400557687-Brodal-Traeff-Zaro97
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.