LEADER 04640nam 22008055 450 001 996465695203316 005 20240621195227.0 010 $a3-642-40273-9 024 7 $a10.1007/978-3-642-40273-9 035 $a(CKB)3710000000015907 035 $a(SSID)ssj0000988280 035 $a(PQKBManifestationID)11546508 035 $a(PQKBTitleCode)TC0000988280 035 $a(PQKBWorkID)10950580 035 $a(PQKB)10006829 035 $a(DE-He213)978-3-642-40273-9 035 $a(MiAaPQ)EBC3093455 035 $a(PPN)172429242 035 $a(EXLCZ)993710000000015907 100 $a20130810d2013 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aSpace-Efficient Data Structures, Streams, and Algorithms $ePapers in Honor of J. Ian Munro, on the Occasion of His 66th Birthday /$fedited by Andrej Brodnik, Alejandro Lopez-Ortiz, Venkatesh Raman, Alfredo Viola 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XXVIII, 363 p. 58 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8066 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-40272-0 327 $aThe Query Complexity of Finding a Hidden Permutation -- Bounds for Scheduling Jobs on Grid Processors -- Quake Heaps: A Simple Alternative to Fibonacci Heaps -- Variations on Instant Insanity -- A Simple Linear-Space Data Structure for Constant-Time Range -- Closing a Long-Standing Complexity Gap for Selection: V3(42) = 50 -- Frugal Streaming for Estimating Quantiles -- From Time to Space: Fast Algorithms That Yield Small and Fast Data -- Computing (and life) Is all About Tradeoffs: A Small Sample of Some Computational Tradeoffs -- A History of Distribution-Sensitive Data Structures -- A Survey on Priority Queues -- On Generalized Comparison-Based Sorting Problems -- A Survey of the Game ?Lights Out!? -- Random Access to High-Order Entropy Compressed Text -- Succinct and Implicit Data Structures for Computational Geometry -- In Pursuit of the Dynamic Optimality Conjecture -- A Survey of Algorithms and Models for List Update -- Orthogonal Range Searching for Text Indexing -- A Survey of Data Structures in the Bitprobe Model -- Succinct Representations of Ordinal Trees -- Array Range Queries -- Indexes for Document Retrieval with Relevance. 330 $aThis Festschrift volume, published in honour of J. Ian Munro, contains contributions written by some of his colleagues, former students, and friends. In celebration of his 66th birthday the colloquium "Conference on Space Efficient Data Structures, Streams and Algorithms" was held in Waterloo, ON, Canada, during August 15-16, 2013. The articles presented herein cover some of the main topics of Ian's research interests. Together they give a good overall perspective of the last 40 years of research in algorithms and data structures. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8066 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aNumerical analysis 606 $aComputer networks 606 $aAlgorithms 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 606 $aNumerical Analysis 606 $aComputer Communication Networks 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 0$aNumerical analysis. 615 0$aComputer networks. 615 14$aAlgorithms. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 615 24$aNumerical Analysis. 615 24$aComputer Communication Networks. 676 $a005.1 702 $aBrodnik$b Andrej$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLopez-Ortiz$b Alejandro$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRaman$b V$g(Venkatesh),$f1962-$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aViola$b Alfredo$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465695203316 996 $aSpace-Efficient Data Structures, Streams, and Algorithms$92831327 997 $aUNISA