000			03516nam a22004095i 4500
001			307761
003			MX-SnUAN
005			20160429160146.0
007			cr nn 008mamaa
008			150903s2013 gw | o |||| 0|eng d
020			_a9783642402739 _99783642402739
024	7		_a10.1007/9783642402739 _2doi
035			_avtls000361977
039		9	_a201509030626 _bVLOAD _c201405070322 _dVLOAD _y201402211039 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA76.9.A43
100	1		_aBrodnik, Andrej. _eeditor. _9347499
245	1	0	_aSpace-Efficient Data Structures, Streams, and Algorithms : _bPapers in Honor of J. Ian Munro on the Occasion of His 66th Birthday / _cedited by Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman, Alfredo Viola.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013.
300			_axxviii, 363 páginas 58 ilustraciones _brecurso en línea.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v8066
500			_aSpringer eBooks
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.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aLópez-Ortiz, Alejandro. _eeditor. _9329332
700	1		_aRaman, Venkatesh. _eeditor. _9341424
700	1		_aViola, Alfredo. _eeditor. _9347500
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783642402722
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-40273-9 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c307761 _d307761