Brodal, G. S., Kaporis, A. C., Sioutas, S.
, Tsakalidis, K. & Tsichlas, K. (2009).
Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time.
Lecture Notes in Computer Science,
5878, 193-202.
https://doi.org/10.1007/978-3-642-10631-6_21
Brodal, G. S., Demaine, E. D., Fineman, J. T., Iacono, J., Langerman, S. & Munro, J. I. (2010).
Cache-Oblivious Dynamic Dictionaries with Optimal Update/Query Tradeoff.
Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 1448-1456.
http://www.siam.org/proceedings/soda/2010/SODA10_117_brodalg.pdf
Brodal, G. S., Lyngsø, R. B., Pedersen, C. N. S. & Stoye, J. (1999).
Finding Maximal Pairs with Bounded Gap. In M. Crochemore & M. Paterson (Eds.),
Combinatorial Pattern Matching: 10th Annual Symposium, CPM 99 Warwick University, UK, July 22–24, 1999 Proceedings (pp. 134-149). Springer.
https://doi.org/10.1007/3-540-48452-3_11
Brodal, G. S., Fagerberg, R.
, Mailund, T., Pedersen, C. N. S. & Sand, A. (2013).
Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree.
The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings,
24, 1814-1832.
http://knowledgecenter.siam.org/0236-000098/0236-000098/1
Brodal, G. S., Davoodi, P., Lewenstein, M., Raman, R. & Rao, S. S. (2012).
Two Dimensional Range Minimum Queries and Fibonacci Lattices.
Lecture Notes in Computer Science,
7501, 217-228 .
https://doi.org/10.1007/978-3-642-33090-2_20
Brodal, G. S., Sioutas, S., Tsichlas, K. & Zaroliagis, C. (2010).
D2-tree: A new overlay with deterministic bounds. In O. Cheong , K-Y. Chwa & K. Park (Eds.),
Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju, Korea, December 15-17, 2010, Proceedings, Part II (pp. 1-12). Springer VS.
https://doi.org/10.1007/978-3-642-17514-5_1