Researcher Portfolio
Brodal, Gerth Stølting
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher Profile
Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons44187
External references
WorldCat
Search for Brodal, Gerth Stølting
Google Scholar
Search for Brodal, Gerth Stølting
Publications
: Brodal, G. S., Kaligosi, K., Katriel, I., & Kutz, M. (2006). Faster Algorithms for Computing Longest Common Increasing Subsequences. In Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006 (pp. 330-341). Berlin, Germany: Springer. [PubMan] : Dementiev, R., Kettner, L., & Sanders, P. (2005). STXXL: Standard Template Library for XXL Data Sets. In Algorithms - ESA 2005: 13th Annual European Symposium (ESA 2005) (pp. 640-651). Berlin, Germany: Springer. [PubMan] : Brodal, G. S., Fagerberg, R., Meyer, U., & Zeh, N. (2004). 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 (pp. 480-492). Berlin, Germany: Springer. [PubMan] : Agarwal, P., Arge, L., Brodal, G. S., & Vitter, J. S. (1999). I/O-Efficient Dynamic Point Location in Monotone Subdivisions. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99) (pp. 11-20). New York, USA: ACM. [PubMan] : Brodal, G. S., & Katajainen, J. (1998). Worst-Case Efficient External-Memory Priority Queues. In S. Arnborg, & L. Ivansson (Eds. ), Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98) (pp. 107-118). Berlin, Germany: Springer. [PubMan] : Brodal, G. S., & Pinotti, M. C. (1998). Comparator Networks for Binary Heap Construction. In S. Arnborg, & L. Ivansson (Eds. ), Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98) (pp. 158-168). Berlin, Germany: Springer. [PubMan] : Brodal, G. S., & Pinotti, M. C.(1998). Comparator networks for binary heap construction (MPI-I-1998-1-002). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Brodal, G. S. (1998). Finger Search Trees with Constant Insertion Time. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 540-549). New York, NY: ACM Press / SIAM. [PubMan] : Brodal, G. S., Träff, J. L., & Zaroliagis, C. (1998). A Parallel Priority Queue with Constant Time Operations. Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures, 49(1), 4-21. [PubMan] : Brodal, G. S., Träff, J. L., & Zaroliagis, C.(1997). A parallel priority queue with constant time operations (MPI-I-1997-1-011). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Brodal, G. S., Träff, J. L., & Zaroliagis, C. (1997). A parallel priority data structure with applications. In D. G. Feitelson, & L. Rudolph (Eds. ), 11th Internatinal Parallel Processing Symposium (IPPS-97) (pp. 689-693). Los Alamitos, USA: IEEE. [PubMan] : Brodal, G. S. (1997). Predecessor Queries in Dynamic Integer Sets. In R. Reischuk, & M. Morvan (Eds. ), Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97) (pp. 21-32). Berlin, Germany: Springer. [PubMan] : Brodal, G. S.(1997). Finger search trees with constant insertion time (MPI-I-1997-1-020). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Brodal, G. S., Chaudhuri, S., & Radhakrishnan, J.(1996). The randomized complexity of maintaining the minimum (MPI-I-1996-1-014). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Brodal, G. S. (1996). Priority queues on parallel machines. In 5th Scandinavian Workshop on Algorithm Theory (SWAT96) (pp. 416-427). Berlin, Germany: Springer. [PubMan] : Brodal, G. S., & Gasieniec, L. (1996). Approximate Dictionary Queries. In D. Hirschberg, & G. Myers (Eds. ), Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96) (pp. 65-74). Berlin, Germany: Springer. [PubMan] : Brodal, G. S., Chaudhuri, S., & Radhakrishnan, R. (1996). The Randomized Complexity of Maintaining the Minimum. Nordic Journal of Computing, 3(4), 337-351. doi:10.5555/763878.763882. [PubMan] : Brodal, G. S., Chaudhuri, S., & Radhakrishnan, J. (1996). The Randomized Complexity of Maintaining the Minimum. In R. Karlsson, & A. Lingas (Eds. ), Algorithm Theory - SWAT '96 (pp. 4-15). Berlin: Springer. [PubMan]