Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday

389 Pages·2013·4.681 MB·English

by  Peyman Afshani, Manindra Agrawal (auth.), Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman, Alfredo Viola (eds.)

Andrej Brodnik
Alejandro López-Ortiz
t Venkatesh Raman
f
i
hr Alfredo Viola (Eds.)
c
s
t
s
e
F
Space-Efficient
6
6
Data Structures, Streams,
0
8

S
C and Algorithms
N
L
Papers in Honor of J. Ian Munro
on the Occasion of His 66th Birthday
123
Lecture Notes in Computer Science 8066
CommencedPublicationin1973
FoundingandFormerSeriesEditors:
GerhardGoos,JurisHartmanis,andJanvanLeeuwen
EditorialBoard
DavidHutchison
LancasterUniversity,UK
TakeoKanade
CarnegieMellonUniversity,Pittsburgh,PA,USA
JosefKittler
UniversityofSurrey,Guildford,UK
JonM.Kleinberg
CornellUniversity,Ithaca,NY,USA
AlfredKobsa
UniversityofCalifornia,Irvine,CA,USA
FriedemannMattern
ETHZurich,Switzerland
JohnC.Mitchell
StanfordUniversity,CA,USA
MoniNaor
WeizmannInstituteofScience,Rehovot,Israel
OscarNierstrasz
UniversityofBern,Switzerland
C.PanduRangan
IndianInstituteofTechnology,Madras,India
BernhardSteffen
TUDortmundUniversity,Germany
MadhuSudan
MicrosoftResearch,Cambridge,MA,USA
DemetriTerzopoulos
UniversityofCalifornia,LosAngeles,CA,USA
DougTygar
UniversityofCalifornia,Berkeley,CA,USA
GerhardWeikum
MaxPlanckInstituteforInformatics,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
1 3
VolumeEditors
AndrejBrodnik
UniversityofLjubljana,FacultyofComputerandInformationScience
Ljubljana,Sloveniaand
UniversityofPrimorska,DepartmentofInformationScienceandTechnology
Koper,Slovenia
E-mail:[email protected]
AlejandroLópez-Ortiz
UniversityofWaterloo,CheritonSchoolofComputerScience
Waterloo,ON,Canada
E-mail:[email protected]
VenkateshRaman
TheInstituteofMathematicalSciences
Chennai,India
E-mail:[email protected]
AlfredoViola
UniversidaddelaRepública,FacultaddeIngeniería
Montevideo,Uruguay
E-mail:viola@fing.edu.uy
ISSN0302-9743 e-ISSN1611-3349
ISBN978-3-642-40272-2 e-ISBN978-3-642-40273-9
DOI10.1007/978-3-642-40273-9
SpringerHeidelbergDordrechtLondonNewYork
LibraryofCongressControlNumber:2013944678
CRSubjectClassification(1998):F.2,E.1,G.2,H.3,I.2.8,E.5,G.1
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
©Springer-VerlagBerlinHeidelberg2013
Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartof
thematerialisconcerned,specificallytherightsoftranslation,reprinting,reuseofillustrations,recitation,
broadcasting,reproductiononmicrofilmsorinanyotherphysicalway,andtransmissionorinformation
storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodology
nowknownorhereafterdeveloped.Exemptedfromthislegalreservationarebriefexcerptsinconnection
withreviewsorscholarlyanalysisormaterialsuppliedspecificallyforthepurposeofbeingenteredand
executedonacomputersystem,forexclusiveusebythepurchaserofthework.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheCopyrightLawofthePublisher’slocation,
inistcurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Permissionsforuse
maybeobtainedthroughRightsLinkattheCopyrightClearanceCenter.Violationsareliabletoprosecution
undertherespectiveCopyrightLaw.
Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication
doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant
protectivelawsandregulationsandthereforefreeforgeneraluse.
Whiletheadviceandinformationinthisbookarebelievedtobetrueandaccurateatthedateofpublication,
neithertheauthorsnortheeditorsnorthepublishercanacceptanylegalresponsibilityforanyerrorsor
omissionsthatmaybemade.Thepublishermakesnowarranty,expressorimplied,withrespecttothe
materialcontainedherein.
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper
SpringerispartofSpringerScience+BusinessMedia(www.springer.com)
J. Ian Munro
Preface
ThisvolumecontainsresearcharticlesandsurveyspresentedatIanfest-66,acon-
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.
IanMunrocompletedhis PhDatthe UniversityofToronto,aroundthe 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
sameyearandconferenceinwhichStephenCook(alsofromthesameuniversity)
presented the paper on what we now call “NP-completeness.” Knuth’s first two
volumesofTheArtofComputerProgramming wereout,andthemostinfluential
thirdvolumewastobereleasedsoonafter.HopcroftandTarjanweredeveloping
important graph algorithms (for planarity, biconnected components etc).
Againstthisbackdrop,Ianstartedmakingfundamentalcontributionsinsort-
ing, selection and data structures (including optimal binary search trees, heaps
and hashing). He steadfastly stayedfocused on these subjects, always taking an
expansiveview,whichincludedtextsearchanddatastreamsatatimewhenfew
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
aroundthe timeof“megabyte”mainmemories,sospacewasbecomingcheaper,
though, as usual, the input sizes were becoming much larger. He saw early on
thatthesetrendswillcontinuemakingthefocusonspace-efficiencymore,rather
thanless,important.Thistrendhascontinuedwiththedevelopmentofpersonal
computing in its many forms andmultilevel caches.His unique expertise helped
contribute significantlyto the OxfordEnglishDictionary(OED)projectatWa-
terloo,and the founding ofthe OpenTextas a companydealing withtext-based
algorithms.
HisinvitedcontributionattheFSTTCSconferencetitledTables broughtthe
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 additionto his research,Ianis aninspiring 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 programcommittees of
international conferences and in editorial boards of journals, and has given ple-
nary talks at various internationalconferences. 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-
ropeandNorthAmerica.Healsohasformerstudentsinkeypositionsinleading
companies of the world.
His research achievements have been recognized by his election as Fellow of
theRoyalSocietyofCanada(2003)andFellowoftheACM(2008).Hewasmade
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
PhDstudentsandcontinuestoeducateandinspirestudentsandresearchers.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,wethankalltheauthorswhocameforwardtocontributetheirarticles
on a short notice, all anonymous referees, proofreaders,and the speakers at the
conference.WethankMarkoGrguroviˇc,WendyRushandJanVeselforcollecting
and verifying data about Ian’s students and work. We thank Alfred Hofmann,
Anna Kramerand Ronan Nugent at Springer for their enthusiastic support and
helpinproducingthisFestschrift.WethankAlisonConwayatFieldsInstituteat
Toronto for maintaining the conference website and managing registration, and
Fields Institute for their generousfinancial 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.
June 2013 Andrej Brodnik
Alejandro L´opez-Ortiz
Venkatesh Raman
Alfredo Viola
Curriculum Vitae J. Ian Munro
Current Position
University Professor and Canada Research Chair in Algorithm Design
Address
Cheriton School of Computer Science
University of Waterloo
Waterloo, Ontario
Canada, N2L 3G1
https://cs.uwaterloo.ca/~imunro/
Personal Information
Born: July 10, 1947
Married: to Marilyn Miller
Two children: Alison and Brian
Education
Ph.D., Computer Science, University of Toronto, 1971
M.Sc., Computer Science, University of British Columbia, 1969
B.A. (Hons), Mathematics, University of New Brunswick, 1968
Experience
1971-present: Professor, University of Waterloo, Ontario, Canada
Professional Interests
Data structures, particularly fast and space-efficient structures.
The design, analysis and implementation of algorithms.
Bioinformatics.
Database systems and data warehousing, particularly efficiency issues.
X Curriculum Vitae J. Ian Munro
Co-authors
1. Brian Allen 45. Lukasz Golab
2. Stephen Alstrup 46. Mordecai Golin
3. Helmut Alt 47. Alexander Golynski
4. Lars Arge 48. Gast´on H. Gonnet
5. Diego Arroyuelo 49. Roberto Grossi
6. J´er´emyBarbay 50. Gwena¨el Joret
7. Michael A. Bender 51. Torben Hagerup
8. David Benoit 52. Ang`ele M. Hamel
9. Therese Biedl 53. E. R. Hansen
10. Allan Borodin 54. Nicholas J. A. Harvey
11. Prosenjit Bose 55. Meng He
12. Gerth Stølting Brodal 56. Bryan Holland-Minkley
13. Andrej Brodnik 57. John Iacono
14. Jean Cardinal 58. Lars Jacobsen
15. Svante Carlsson 59. X Richard Ji
16. Luca Castelli Aleardi 60. Rapha¨el M. Jungers
17. Pedro Celis 61. Kanela Kaligosi
18. Timothy Chan 62. T. Kameda
19. David R. Clark 63. Johan Karlsson
20. Francisco Claude 64. Rolf G. Karlsson
21. Gordon Cormack 65. Marek Karpinski
22. Joseph C. Culberson 66. Paul E. Kearney
23. Walter Cunto 67. Graeme Kemkes
24. David DeHaan 68. James A. King
25. Erik D. Demaine 69. Alejandro L´opez-Ortiz
26. Martin L. Demaine 70. Stefan Langerman
27. David P. Dobkin 71. Per-˚Ake Larson
28. Reza Dorrigiv 72. Anna Lubiw
29. Stephane Durocher 73. Kurt Mehlhorn
30. Amr Elmasry 74. Peter Bro Miltersen
31. Martin Farach-Colton 75. Pat Morin
32. Arash Farzan 76. Moni Naor
33. Paolo Ferragina 77. Yakov Nekrich
34. Amos Fiat 78. Patrick K. Nicholson
35. Faith E. Fich 79. Andreas Nilsson
36. Jeremy T. Fineman 80. B. John Oommen
37. Samuel Fiorini 81. Mark H. Overmars
38. Rudolf Fleischer 82. Linda Pagli
39. Gianni Franceschini 83. Thomas Papadakis
40. Robert Fraser 84. Michael S. Paterson
41. Michael L. Fredman 85. Derek Phillips
42. Travis Gagie 86. Patricio V. Poblete
43. W. Morven Gentleman 87. M. Ziaur Rahman
44. Pedram Ghodsnia 88. Rau´l J. Ram´ırez
Curriculum Vitae J. Ian Munro XI
89. Rajeev Raman 103. Alan Siegel
90. Venkatesh Raman 104. Matthew Skala
91. Theis Rauhe 105. Philip M. Spira
92. Manuel Rey 106. Adam J. Storm
93. Edward L. Robertson 107. Hendra Suwanda
94. Doron Rotem 108. David J. Taylor
95. Alejandro Salinger 109. Mikkel Thorup
96. Jeffrey S. Salowe 110. Kamran Tirdad
97. Peter Sanders 111. Frank Wm. Tompa
98. Srinivasa Rao Satti 112. Troy Vasiga
99. Jeanette P. Schmidt 113. Alfredo Viola
100. Allen J. Schwenk 114. Derick Wood
101. Alejandro A. Sch¨affer 115. Gelin Zhou
102. Robert Sedgewick
Books and Book chapters
[1] Barbay, J., Munro, J.I.: Succinct encoding of permutations: Applications
to text indexing. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp.
915–919.Springer (2008)
[2] Borodin, A., Munro, J.I.: The computational complexity of algebraic and
numeric problems. American Elsevier, New York (1975)
[3] Munro, J.I., Satti, S.R.: Succinct representation of data structures. In:
Mehta, D.P., Sahni, S. (eds.) Handbook of Data Structures and Applica-
tions.Chapman&Hall/CrcComputerandInformationScienceSeries,ch.
37. Chapman & Hall/CRC (2004)
Edited Proceedings
[4] Blum, M., Galil, Z., Ibarra, O.H., Kozen, D., Miller, G.L., Munro, J.I.,
Ruzzo, W.L. (eds.): SFCS 1983: Proceedings of the 24th Annual Sympo-
siumonFoundationsofComputerScience, p. iii. IEEEComputerSociety,
Washington, DC (1983)
[5] Chwa, K.-Y., Munro, J.I. (eds.): COCOON 2004. LNCS, vol. 3106.
Springer, Heidelberg (2004)
[6] L´opez-Ortiz,A.,Munro,J.I.(eds.):ACMTransactionsonAlgorithms2(4),
491 (2006)
[7] Munro,J.I.(ed.):ProceedingsoftheFifteenthAnnualACM-SIAMSympo-
sium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA,
January 11-14. SIAM (2004)