License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FUN.2018.1
URN: urn:nbn:de:0030-drops-87924
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8792/
Go to the corresponding LIPIcs Volume Portal

Farach-Colton, Martín

Mind the Gap (Invited Paper)

pdf-format:
LIPIcs-FUN-2018-1.pdf (0.2 MB)

Abstract

As a New Yorker, I'm painfully aware of space. There is, after all, nothing more luxurious than empty space! So when it comes to algorithms, I'm all in favor of leaving holes in my data structures. In this talk, I'll explore the advantages of pampering algorithms with some much needed breathing room.

BibTeX - Entry

@InProceedings{farachcolton:LIPIcs:2018:8792,
  author =	{Mart{\'i}n Farach-Colton},
  title =	{{Mind the Gap (Invited Paper)}},
  booktitle =	{9th International Conference on Fun with Algorithms (FUN 2018)},
  pages =	{1:1--1:1},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-067-5},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{100},
  editor =	{Hiro Ito and Stefano Leonardi and Linda Pagli and Giuseppe Prencipe},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8792},
  URN =		{urn:nbn:de:0030-drops-87924},
  doi =		{10.4230/LIPIcs.FUN.2018.1},
  annote =	{Keywords: library sort, Italian island, packed memory arrays, weight balanced trees, Italians know how to throw a conference}
}

Keywords: library sort, Italian island, packed memory arrays, weight balanced trees, Italians know how to throw a conference
Collection: 9th International Conference on Fun with Algorithms (FUN 2018)
Issue Date: 2018
Date of publication: 04.06.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI