Andrej Brodnik Alejandro López-Ortiz Venkatesh Raman Alfredo Viola (Eds.) Festschrift Space-Efficient Data Structures, Streams, LNCS 8066 and Algorithms Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday 123 Lecture Notes in Computer Science 8066 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany Andrej Brodnik Alejandro López-Ortiz Venkatesh Raman Alfredo Viola (Eds.) Space-Efficient Data Structures, Streams, and Algorithms Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday 13 Volume Editors Andrej Brodnik University of Ljubljana, Faculty of Computer and Information Science Ljubljana, Slovenia and University of Primorska, Department of Information Science and Technology Koper, Slovenia E-mail: [email protected] Alejandro López-Ortiz University of Waterloo, Cheriton School of Computer Science Waterloo, ON, Canada E-mail: [email protected] Venkatesh Raman The Institute of Mathematical Sciences Chennai, India E-mail: [email protected] Alfredo Viola Universidad de la República, Facultad de Ingeniería Montevideo, Uruguay E-mail: viola@fing.edu.uy ISSN 0302-9743 e-ISSN 1611-3349 ISBN 978-3-642-40272-2 e-ISBN 978-3-642-40273-9 DOI 10.1007/978-3-642-40273-9 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2013944678 CR Subject Classification (1998): F.2, E.1, G.2, H.3, I.2.8, E.5, G.1 LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues © Springer-Verlag Berlin Heidelberg 2013 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in ist current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) J. Ian Munro Preface This volume contains research articles and surveys presented at Ianfest-66, a con- ference on space-efficient data structures, streams, and algorithms held during August 15–16, 2013, at the University of Waterloo, Canada. The conference was held to celebrate Ian Munro’s 66th birthday. Just like Ian’s interests, the articles in this volume encompass a spectrum of areas in- cluding sorting, searching, selection and several types of, and topics in, data structures including space-efficient ones. Ian Munro completed his PhD at the University of Toronto, around the time when computer science in general, and analysis of algorithms in particular, was maturing to be a field of research. His PhD thesis resulted in the classic book The Computational Complexity of Algebraic and Numeric Problems with his PhD supervisor Allan Borodin. He presented his first paper in STOC 1971, the same year and conference in which Stephen Cook (also from the same university) presented the paper on what we now call “NP-completeness.” Knuth’s first two volumes of The Art of Computer Programming were out, and the most influential third volume was to be released soon after. Hopcroft and Tarjan were developing important graph algorithms (for planarity, biconnected components etc). Against this backdrop, Ian started making fundamental contributions in sort- ing, selection and data structures (including optimal binary search trees, heaps and hashing). He steadfastly stayed focused on these subjects, always taking an expansive view, which included text search and data streams at a time when few others were exploring these topics. While the exact worst case comparison bound to find the median is still open, he closed this problem in 1984 along with his student Walter Cunto for the average case. His seminal work on implicit data structures with his student Hendra Suwanda marked his focus on space-efficient data structures. This was around the time of “megabyte” main memories, so space was becoming cheaper, though, as usual, the input sizes were becoming much larger. He saw early on that these trends will continue making the focus on space-efficiency more, rather than less, important. This trend has continued with the development of personal computing in its many forms and multilevel caches. His unique expertise helped contribute significantly to the Oxford English Dictionary (OED) project at Wa- terloo, and the founding of the OpenText as a company dealing with text-based algorithms. His invited contribution at the FSTTCS conference titled Tables brought the focus of work on succinct data structures in the years to come. His early work with Mike Paterson on selection is regarded as the first paper in a model that has later been called the “streaming model,” a model of intense study in the modern Internet age. In this model, his other paper “Frequency estimation of VIII Preface internet packet streams with limited space” with Erik Demaine and Alejandro L´opez-Ortiz has received over 300 citations. In addition to his research, Ian is an inspiring teacher. He has supervised (or co-supervised) over 20 PhD students and about double the number of Master’s students. For many years, Ian has been part of the faculty team that coached Canadian high school students for the International Olympiad in Informatics (IOI). He has led the Canadian team and served on the IOI’s international scientific committee. Ian also gets a steady stream of post-doctoral researchers and other visi- tors from throughout the world. He has served in many program committees of international conferences and in editorial boards of journals, and has given ple- nary talks at various international conferences. He has held visiting positions at several places including Princeton University, University of Washington, AT&T Bell Labaratories, University of Arizona, University of Warwick and Universit`e libre de Bruxelles. Through his students and their students and other collab- orators, he has helped establish strong research groups in various parts of the world including Chile, India, South Korea, Uruguay and in many parts of Eu- rope and North America. He also has former students in key positions in leading companies of the world. His research achievements have been recognized by his election as Fellow of the Royal Society of Canada (2003) and Fellow of the ACM (2008). He was made a University Professor in 2006. Ian has a great sense of generosity, wit and humor. Ian, his wife, Marilyn, and his children, Alison and Brian, are more than a host to his students and collaborators; they have helped establish a long-lasting friendship with them. At 66 Ian is going strong, makes extensive research tours, supervises many PhD students and continues to educate and inspire students and researchers. We wish him and his family many more years of fruitful and healthy life. We thank a number of people that made this volume possible. First and foremost, we thank all the authors who came forward to contribute their articles on a short notice, all anonymous referees, proofreaders, and the speakers at the conference. We thank Marko Grguroviˇc, Wendy Rush and Jan Vesel for collecting and verifying data about Ian’s students and work. We thank Alfred Hofmann, Anna Kramer and Ronan Nugent at Springer for their enthusiastic support and help in producing this Festschrift. We thank Alison Conway at Fields Institute at Toronto for maintaining the conference website and managing registration, and Fields Institute for their generous financial support, and University of Waterloo for their infrastructural and organizational support. This volume contains surveys on emerging, as well as established, fields in data structures and algorithms, written by leading experts, and we feel that it will become a book to cherish in the years to come.