國立虎尾科技大學 |

Programming Algorithms in Lisp = Writing Efficient Programs with Examples in ANSI Common Lisp /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Programming Algorithms in Lisp/ by Vsevolod Domkin.
Reminder of title:	Writing Efficient Programs with Examples in ANSI Common Lisp /
Author:	Domkin, Vsevolod.
Description:	XIII, 377 p. 26 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Programming languages (Electronic computers). -
Online resource:	https://doi.org/10.1007/978-1-4842-6428-7
ISBN:	9781484264287

Programming Algorithms in Lisp = Writing Efficient Programs with Examples in ANSI Common Lisp /
Domkin, Vsevolod.

Programming Algorithms in LispWriting Efficient Programs with Examples in ANSI Common Lisp /[electronic resource] :by Vsevolod Domkin. - 1st ed. 2021. - XIII, 377 p. 26 illus.online resource.

1: Introduction -- 2: Algorithmic Complexity -- 3: A Crash Course in Lisp -- 4: Essential Data Structures -- 5: Arrays -- 6: Linked Lists -- 7: Key-Values -- 8: Derivative Data Structures -- 9: Trees -- 10: Graphs -- 11: Strings -- 12: Selected Algorithms -- 13: Approximation -- 14: Compression -- 15: Synchronization -- Afterword.

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 .

ISBN: 9781484264287

Standard No.: 10.1007/978-1-4842-6428-7doiSubjects--Topical Terms:

1127615
Programming languages (Electronic computers).

LC Class. No.: QA76.7-76.73

Dewey Class. No.: 005.13

Programming Algorithms in Lisp = Writing Efficient Programs with Examples in ANSI Common Lisp /
LDR:02500nam a22004215i 4500 001 1053440
003 DE-He213
005 20210929192033.0
007 cr nn 008mamaa
008 220103s2021 xxu| s |||| 0|eng d
020 $a 9781484264287 $9 978-1-4842-6428-7
024 7 $a 10.1007/978-1-4842-6428-7 $2 doi
035 $a 978-1-4842-6428-7
050 4 $a QA76.7-76.73
050 4 $a QA76.76.C65
072 7 $a UMX $2 bicssc
072 7 $a COM051010 $2 bisacsh
072 7 $a UMX $2 thema
072 7 $a UMC $2 thema
082 0 4 $a 005.13 $2 23
100 1 $a Domkin, Vsevolod. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1358313
245 1 0 $a Programming Algorithms in Lisp $h [electronic resource] : $b Writing Efficient Programs with Examples in ANSI Common Lisp / $c by Vsevolod Domkin.
250 $a 1st ed. 2021.
264 1 $a Berkeley, CA : $b Apress : $b Imprint: Apress, $c 2021.
300 $a XIII, 377 p. 26 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a 1: Introduction -- 2: Algorithmic Complexity -- 3: A Crash Course in Lisp -- 4: Essential Data Structures -- 5: Arrays -- 6: Linked Lists -- 7: Key-Values -- 8: Derivative Data Structures -- 9: Trees -- 10: Graphs -- 11: Strings -- 12: Selected Algorithms -- 13: Approximation -- 14: Compression -- 15: Synchronization -- Afterword.
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 .
650 0 $a Programming languages (Electronic computers). $3 1127615
650 0 $a Computer software. $3 528062
650 0 $a Algorithms. $3 527865
650 0 $a Computer science. $3 573171
650 0 $a Open source software. $3 561177
650 0 $a Computer programming. $3 527822
650 1 4 $a Programming Languages, Compilers, Interpreters. $3 669782
650 2 4 $a Professional Computing. $3 1115983
650 2 4 $a Computer Science, general. $3 669807
650 2 4 $a Open Source. $3 1113081
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9781484264270
776 0 8 $i Printed edition: $z 9781484264294
776 0 8 $i Printed edition: $z 9781484278918
856 4 0 $u https://doi.org/10.1007/978-1-4842-6428-7
912 $a ZDB-2-CWD
912 $a ZDB-2-SXPC
950 $a Professional and Applied Computing (SpringerNature-12059)
950 $a Professional and Applied Computing (R0) (SpringerNature-43716)