Gerth Stølting Brodal

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
28External Memory Planar Point Location with Logarithmic Updates. Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao. Algorithmica (63): 457-475 (2012). Web SearchBibTeXDownload
27Fully persistent B-trees. Gerth Stølting Brodal, Konstantinos Tsakalidis, Spyros Sioutas, Kostas Tsichlas. SODA 2012, 602-614. Web SearchBibTeXDownload
2011
26The Cost of Cache-Oblivious Searching. Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz. Algorithmica (61): 463-505 (2011). Web SearchBibTeXDownload
25Dynamic Planar Range Maxima Queries. Gerth Stølting Brodal, Konstantinos Tsakalidis. ICALP (1) 2011, 256-267. Web SearchBibTeXDownload
24Ordered and Unordered Top-K Range Reporting in Large Data Sets. Peyman Afshani, Gerth Stølting Brodal, Norbert Zeh. SODA 2011, 390-400. Web SearchBibTeXDownload
23Integer Representations towards Efficient Counting in the Bit Probe Model. Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti. TAMC 2011, 206-217. Web SearchBibTeXDownload
22Towards optimal range medians. Gerth Stølting Brodal, Beat Gfeller, Allan Grønlund Jørgensen, Peter Sanders. Theor. Comput. Sci. (412): 2588-2601 (2011). Web SearchBibTeXDownload
2010
21D2-Tree: A New Overlay with Deterministic Bounds. Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis. CoRR (abs/1009.3134) (2010). Web SearchBibTeXDownload
20Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro. SODA 2010, 1448-1456. Web SearchBibTeXDownload
19Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari. Theory Comput. Syst. (47): 934-962 (2010). Web SearchBibTeXDownload
2009
18Online Sorted Range Reporting. Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz. ISAAC 2009, 173-182. Web SearchBibTeXDownload
17Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time. Gerth Stølting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas. ISAAC 2009, 193-202. Web SearchBibTeXDownload
2008
16External memory planar point location with logarithmic updates. Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao. Symposium on Computational Geometry 2008, 139-147. Web SearchBibTeXDownload
2007
15The ComBack Method - Extending Hash Compaction with Backtracking. Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge. ICATPN 2007, 445-464. Cited by 5Web SearchBibTeXDownload
14Optimal sparse matrix dense vector multiplication in the I/O-model. Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari. SPAA 2007, 61-70. Web SearchBibTeXDownload
2006
13Recrafting the neighbor-joining method. Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips. BMC Bioinformatics (7): 29 (2006). Web SearchBibTeXDownload
12Purely Functional Worst Case Constant Time Catenable Sorted Lists. Gerth Stølting Brodal, Christos Makris, Kostas Tsichlas. ESA 2006, 172-183. Web SearchBibTeXDownload
11Improved Dynamic Planar Point Location. Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis. FOCS 2006, 305-314. Cited by 4Web SearchBibTeXDownload
2005
10Fast allocation and deallocation with an improved buddy system. Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro. Acta Inf. (41): 273-291 (2005). Web SearchBibTeXDownload
9Cache-oblivious planar orthogonal range searching and counting. Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen. Symposium on Computational Geometry 2005, 160-169. Cited by 16Web SearchBibTeXDownload
2004
8On external-memory MST, SSSP and multi-way planar graph separation. Lars Arge, Gerth Stølting Brodal, Laura Toma. J. Algorithms (53): 186-206 (2004). Cited by 63Web SearchBibTeXDownload
7Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh. SWAT 2004, 480-492. Web SearchBibTeXDownload
2003
6The Cost of Cache-Oblivious Searching. Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz. FOCS 2003, 271-282. Web SearchBibTeXDownload
5Optimal finger search trees in the pointer machine. Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas. J. Comput. Syst. Sci. (67): 381-418 (2003). Web SearchBibTeXDownload
2002
4Optimal Solutions for the Temporal Precedence Problem. Gerth Stølting Brodal, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas. Algorithmica (33): 494-510 (2002). Web SearchBibTeXDownload
3Optimal finger search trees in the pointer machine. Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas. STOC 2002, 583-591. Web SearchBibTeXDownload
2000
2On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. Lars Arge, Gerth Stølting Brodal, Laura Toma. SWAT 2000, 433-447. Web SearchBibTeXDownload
1999
1I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter. SODA 1999, 11-20. Cited by 31Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research