Advanced data structures / Peter Brass.

Call Number	005.1
Author	Brass, Peter, author.
Title	Advanced data structures / Peter Brass.
Physical Description	1 online resource (xvi, 456 pages) : digital, PDF file(s).
Notes	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Contents	Elementary structures -- Search trees -- Balanced search trees -- Tree structures for sets of intervals -- Heaps -- Union-find and related structures -- Data structure transformations -- Data structures for strings -- Hash tables.
Summary	This text closely examines ideas, analysis, and implementation details of data structures as a specialised topic in applied algorithms. It looks at efficient ways to realise query and update operations on sets of numbers, intervals, or strings by various data structures, including: search trees; structures for sets of intervals or piece-wise constant functions; orthogonal range search structures; heaps; union-find structures; dynamization and persistence of structures; structures for strings; and hash tables. Instead of relegating data structures to trivial material used to illustrate object-oriented programming methodology, this is the first volume to show data structures as a crucial algorithmic topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text.
Subject	COMPUTER ALGORITHMS.
Multimedia	https://doi.org/10.1017/CBO9780511800191

Total Ratings: 0

Copies
MARC Record
Reviews
Details


No records found to display.

02178nam a22003498i 4500

001

vtls001585304

003

VRT

005

20200921122600.0

006

m|||||o||d||||||||

007

cr||||||||||||

008

200921s2008||||enk o ||1 0|eng|d

020

$a 9780511800191 (ebook)

020

$z 9780521880374 (hardback)

035

$a (UkCbUP)CR9780511800191

039

$y 202009211226 $z santha

040

$a UkCbUP $b eng $e rda $c UkCbUP

050

$a QA76.9.A43 $b B73 2008

082

$a 005.1 $2 22

100

$a Brass, Peter, $e author.

245

$a Advanced data structures / $c Peter Brass.

264

$a Cambridge : $b Cambridge University Press, $c 2008.

300

$a 1 online resource (xvi, 456 pages) : $b digital, PDF file(s).

336

$a text $b txt $2 rdacontent

337

$a computer $b c $2 rdamedia

338

$a online resource $b cr $2 rdacarrier

500

$a Title from publisher's bibliographic system (viewed on 05 Oct 2015).

505

$a Elementary structures -- Search trees -- Balanced search trees -- Tree structures for sets of intervals -- Heaps -- Union-find and related structures -- Data structure transformations -- Data structures for strings -- Hash tables.

520

$a This text closely examines ideas, analysis, and implementation details of data structures as a specialised topic in applied algorithms. It looks at efficient ways to realise query and update operations on sets of numbers, intervals, or strings by various data structures, including: search trees; structures for sets of intervals or piece-wise constant functions; orthogonal range search structures; heaps; union-find structures; dynamization and persistence of structures; structures for strings; and hash tables. Instead of relegating data structures to trivial material used to illustrate object-oriented programming methodology, this is the first volume to show data structures as a crucial algorithmic topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text.

650

$a COMPUTER ALGORITHMS.

776

$i Print version: $z 9780521880374

856

$u https://doi.org/10.1017/CBO9780511800191

999

$a VIRTUA

No Reviews to Display

Summary	This text closely examines ideas, analysis, and implementation details of data structures as a specialised topic in applied algorithms. It looks at efficient ways to realise query and update operations on sets of numbers, intervals, or strings by various data structures, including: search trees; structures for sets of intervals or piece-wise constant functions; orthogonal range search structures; heaps; union-find structures; dynamization and persistence of structures; structures for strings; and hash tables. Instead of relegating data structures to trivial material used to illustrate object-oriented programming methodology, this is the first volume to show data structures as a crucial algorithmic topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text.
Notes	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Contents	Elementary structures -- Search trees -- Balanced search trees -- Tree structures for sets of intervals -- Heaps -- Union-find and related structures -- Data structure transformations -- Data structures for strings -- Hash tables.
Subject	COMPUTER ALGORITHMS.
Multimedia	https://doi.org/10.1017/CBO9780511800191