@InProceedings{fagerberg_et_al:LIPIcs.ISAAC.2019.35,
  author =	{Fagerberg, Rolf and Hammer, David and Meyer, Ulrich},
  title =	{{On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?}},
  booktitle =	{30th International Symposium on Algorithms and Computation (ISAAC 2019)},
  pages =	{35:1--35:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-130-6},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{149},
  editor =	{Lu, Pinyan and Zhang, Guochuan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.35},
  URN =		{urn:nbn:de:0030-drops-115313},
  doi =		{10.4230/LIPIcs.ISAAC.2019.35},
  annote =	{Keywords: B-trees, Data structures, Lower bounds, Complexity}
}