Write a Blog >>
ICFP 2016
Sun 18 - Sat 24 September 2016 Nara, Japan
Mon 19 Sep 2016 17:25 - 17:50 at Noh Theater - Session 4 Chair(s): Tom Schrijvers

The queueing-glueing algorithm is the nickname we give to an algorithmic pattern
that provides amortised linear time solutions to a number of optimal list
partition problems that have a peculiar property: at various moments we know that
two of three candidate solutions could be optimal. The algorithm works by
keeping a queue of lists, glueing them from one end, while chopping from the
other end, hence the name. We give a formal derivation of the algorithm, and
demonstrate it with several non-trivial examples.

Mon 19 Sep
Times are displayed in time zone: (GMT+09:00) Osaka, Sapporo, Tokyo change

17:00 - 18:15: Research Papers - Session 4 at Noh Theater
Chair(s): Tom SchrijversKU Leuven
icfp-2016-papers17:00 - 17:25
Kotaro TakedaUniversity of Tokyo, Japan, Naoki KobayashiUniversity of Tokyo, Japan, Kazuya YaguchiTohoku University, Japan, Ayumi ShinoharaTohoku University, Japan
icfp-2016-papers17:25 - 17:50
Shin-Cheng MuAcademia Sinica, Taiwan, Yu-Hsi ChiangNational Taiwan University, Taiwan, Yu-Han LyuDartmouth College, USA
icfp-2016-papers17:50 - 18:15
Jan ChristiansenFlensburg University of Applied Sciences, Germany, Nikita DanilenkoUniversity of Kiel, Germany, Sandra DylusUniversity of Kiel, Germany