東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

LATIN 2018 = theoretical informatics...

Latin American Symposium on Theoretical Informatics (2018 :)

Linked to FindBook

Google Book

Amazon

博客來

LATIN 2018 = theoretical informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	LATIN 2018/ edited by Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro.
Reminder of title:	theoretical informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018 : proceedings /
remainder title:	LATIN 2018
other author:	Bender, Michael A.
corporate name:	Latin American Symposium on Theoretical Informatics
Published:	Cham :Springer International Publishing : : 2018.,
Description:	xvii, 889 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Computer science - Congresses. -
Online resource:	http://dx.doi.org/10.1007/978-3-319-77404-6
ISBN:	9783319774046

LATIN 2018 = theoretical informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018 : proceedings /
LATIN 2018theoretical informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018 : proceedings /[electronic resource] :LATIN 2018edited by Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro. - Cham :Springer International Publishing :2018. - xvii, 889 p. :ill., digital ;24 cm. - Lecture notes in computer science,108070302-9743 ;. - Lecture notes in computer science ;10807..

This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018. The 63 papers presented in this volume were carefully reviewed and selected from 161 submissions. The Symposium is devoted to different areas in theoretical computer science, including, but not limited to: algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures.

ISBN: 9783319774046

Standard No.: 10.1007/978-3-319-77404-6doiSubjects--Topical Terms:

606819
Computer science
--Congresses.

LC Class. No.: QA75.5

Dewey Class. No.: 004

LATIN 2018 = theoretical informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018 : proceedings /
LDR:02126nmm a2200325 a 4500 001 2136560
003 DE-He213
005 20180312204724.0
006 m d
007 cr nn 008maaau
008 181117s2018 gw s 0 eng d
020 $a 9783319774046 $q (electronic bk.)
020 $a 9783319774039 $q (paper)
024 7 $a 10.1007/978-3-319-77404-6 $2 doi
035 $a 978-3-319-77404-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA75.5
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 004 $2 23
090 $a QA75.5 $b .L357 2018
111 2 $a Latin American Symposium on Theoretical Informatics $n (13th : $d 2018 : $c Buenos Aires, Argentina) $3 3308032
245 1 0 $a LATIN 2018 $h [electronic resource] : $b theoretical informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018 : proceedings / $c edited by Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro.
246 3 $a LATIN 2018
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xvii, 889 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10807
520 $a This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018. The 63 papers presented in this volume were carefully reviewed and selected from 161 submissions. The Symposium is devoted to different areas in theoretical computer science, including, but not limited to: algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures.
650 0 $a Computer science $v Congresses. $3 606819
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Computer Systems Organization and Communication Networks. $3 891212
650 2 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Data Structures. $3 891009
650 2 4 $a Computer Graphics. $3 892532
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 890894
700 1 $a Bender, Michael A. $3 3308033
700 1 $a Farach-Colton, Martin. $3 726415
700 1 $a Mosteiro, Miguel A. $3 3308034
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 10807. $3 3308035
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-77404-6
950 $a Computer Science (Springer-11645)