000			03930nam a22006135i 4500
001			978-3-642-40273-9
003			DE-He213
005			20200421112044.0
007			cr nn 008mamaa
008			130810s2013 gw | s |||| 0|eng d
020			_a9783642402739 _9978-3-642-40273-9
024	7		_a10.1007/978-3-642-40273-9 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
245	1	0	_aSpace-Efficient Data Structures, Streams, and Algorithms _h[electronic resource] : _bPapers in Honor of J. Ian Munro on the Occasion of His 66th Birthday / _cedited by Andrej Brodnik, Alejandro L�opez-Ortiz, Venkatesh Raman, Alfredo Viola.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013.
300			_aXXVIII, 363 p. 58 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v8066
505	0		_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.
520			_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.
650		0	_aComputer science.
650		0	_aComputer communication systems.
650		0	_aData structures (Computer science).
650		0	_aAlgorithms.
650		0	_aNumerical analysis.
650		0	_aComputer science _xMathematics.
650		0	_aComputer graphics.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aData Structures.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aComputer Graphics.
650	2	4	_aNumeric Computing.
650	2	4	_aComputer Communication Networks.
700	1		_aBrodnik, Andrej. _eeditor.
700	1		_aL�opez-Ortiz, Alejandro. _eeditor.
700	1		_aRaman, Venkatesh. _eeditor.
700	1		_aViola, Alfredo. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642402722
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v8066
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-40273-9
912			_aZDB-2-SCS
912			_aZDB-2-LNC
942			_cEBK
999			_c56792 _d56792