|
|
|
|
| LEADER |
01559nam a2200361 a 4500 |
| 001 |
00012898 |
| 003 |
AR-OvUNE |
| 005 |
20230727161532.0 |
| 006 |
a||||| 00| 0 |
| 007 |
ta |
| 008 |
220811s2018 us||||f 00| 0 engdd |
| 020 |
|
|
|a 9780999282922
|
| 040 |
|
|
|a AR-OvUNE
|c AR-OvUNE
|
| 080 |
0 |
|
|a 004.422.63
|b R814v.2
|
| 100 |
1 |
|
|a Roughgarden, Tim
|9 31277
|
| 245 |
1 |
0 |
|a Algorithms illuminated :
|b part 2: graph algorithms and data structures /
|c Tim Roughgarden
|
| 250 |
|
|
|a 1st ed.
|
| 260 |
2 |
|
|a New York :
|b Soundlikeyourself Publishing,
|c c2018
|
| 300 |
|
|
|a v.2: xi, 209 p. :
|b fig. byn. ;
|c 23 cm.
|
| 500 |
|
|
|a Cover image© Nick Terry
|
| 505 |
|
|
|a 7. Graphs: the basics -- 8.Graph search and its applications -- 9.Dijkstra’sShortest-PathAlgorithm -- 10. The heap data structure -- 11. Search trees -- 12. Hash tables and Bloom filters
|
| 650 |
|
4 |
|a ALGORITMOS
|
| 650 |
|
4 |
|a ALGORITMOS COMPUTACIONALES
|9 8184
|
| 650 |
|
4 |
|a COMPUTACION
|
| 650 |
|
7 |
|a Estructura de datos (Informática)
|9 11224
|
| 650 |
|
7 |
|a Estructura de datos (Informática)
|9 11224
|
| 650 |
|
7 |
|a Grafos, Teoría de
|9 11961
|
| 650 |
|
7 |
|a Programación de ordenadores
|9 14835
|
| 653 |
|
|
|a FILTRO DE BLOOM
|
| 856 |
|
|
|u https://www.algorithmsilluminated.org/won2sample.pdf
|z Tabla de contenidos extendida y algunos capítulos a texto completo (último acceso: 11/8/2022)
|
| 856 |
|
|
|u https://www.algorithmsilluminated.org/
|z Recursos multimedia anexos al material impreso (último acceso: 5/9/2022)
|
| 942 |
|
|
|c LIB
|2 udc
|h 004.422.63
|6 00442263
|
| 999 |
|
|
|c 12898
|d 12898
|