|
|
|
|
| LEADER |
00000cam a2200000 i 4500 |
| 001 |
on1235761293 |
| 003 |
OCoLC |
| 005 |
20241006213017.0 |
| 006 |
m o d |
| 007 |
cr |n||||||||| |
| 008 |
210201s2021 cau o 001 0 eng d |
| 040 |
|
|
|a YDX
|b eng
|e rda
|e pn
|c YDX
|d EBLCP
|d UAB
|d OCLCO
|d LDP
|d ERF
|d OCLCF
|d GW5XE
|d OCLCO
|d UKAHL
|d OCLCQ
|d OCLCO
|d COM
|d OCLCQ
|d OCLCO
|d OCLCL
|d HOPLA
|
| 019 |
|
|
|a 1236266070
|a 1238201088
|a 1238204301
|
| 020 |
|
|
|a 9781484264287
|q (electronic bk.)
|
| 020 |
|
|
|a 1484264282
|q (electronic bk.)
|
| 020 |
|
|
|z 1484264274
|
| 020 |
|
|
|z 9781484264270
|
| 024 |
7 |
|
|a 10.1007/978-1-4842-6428-7
|2 doi
|
| 035 |
|
|
|a (OCoLC)1235761293
|z (OCoLC)1236266070
|z (OCoLC)1238201088
|z (OCoLC)1238204301
|
| 050 |
|
4 |
|a QA76.73.L23
|
| 072 |
|
7 |
|a UMX.
|2 bicssc
|
| 072 |
|
7 |
|a COM051010.
|2 bisacsh
|
| 072 |
|
7 |
|a UMX.
|2 thema
|
| 072 |
|
7 |
|a UMC.
|2 thema
|
| 049 |
|
|
|a HCDD
|
| 100 |
1 |
|
|a Domkin, Vsevolod,
|e author.
|
| 245 |
1 |
0 |
|a Programming algorithms in Lisp :
|b writing efficient programs with examples in ANSI Common Lisp /
|c Vsevolod Domkin.
|
| 264 |
|
1 |
|a [Berkeley, California] :
|b Apress,
|c [2021]
|
| 300 |
|
|
|a 1 online resource
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 520 |
|
|
|a Master algorithms programming using Lisp, including the most important data structures and algorithms. This book also covers the essential tools that help in the development of algorithmic code to give you all you need to enhance your code. Programming Algorithms in Lisp shows real-world engineering considerations and constraints that influence the programs that use these algorithms. It includes practical use cases of the applications of the algorithms to a variety of real-world problems. You will: Program algorithms using the Lisp programming language Work with data structures, arrays, key-values, hash-tables, trees, graphs, and more Use dynamic programming Program using strings Work with approximations and compression.
|
| 505 |
0 |
|
|a 1: Introduction -- 2: Algorithmic Complexity -- 3: A Crash Course in Lisp -- 4: Data Structures -- 5: Arrays -- 6: Linked Lists -- 7: Key-Values -- 8: Hash-Tables -- 9: Trees -- 10: Graphs -- 11: Strings -- 12: Dynamic Programming -- 13: Approximation -- 14: Compression -- 15: Synchronization -- Afterword.
|
| 500 |
|
|
|a Includes index.
|
| 588 |
0 |
|
|a Online resource; title from PDF title page (SpringerLink, viewed March 17, 2021).
|
| 650 |
|
0 |
|a COMMON LISP (Computer program language)
|
| 650 |
|
0 |
|a Computer algorithms.
|
| 650 |
|
7 |
|a algorithms.
|2 aat
|
| 650 |
|
7 |
|a COMMON LISP (Computer program language)
|2 fast
|
| 650 |
|
7 |
|a Computer algorithms
|2 fast
|
| 758 |
|
|
|i has work:
|a Programming Algorithms in Lisp (Text)
|1 https://id.oclc.org/worldcat/entity/E39PD3q39ptHDYmPj3dXv7Gx9P
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|a Domkin, Vsevolod.
|t Programming algorithms in Lisp.
|d [Berkeley, California] : Apress, [2021]
|z 1484264274
|z 9781484264270
|w (OCoLC)1191244099
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://link.springer.com/10.1007/978-1-4842-6428-7
|y Click for online access
|
| 903 |
|
|
|a SPRING-COMPUTING2021
|
| 994 |
|
|
|a 92
|b HCD
|