Language:
English
繁體中文
Help
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
LATIN 2018 = theoretical informatics...
~
Farach-Colton, Martin.
LATIN 2018 = theoretical informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018 : proceedings /
Record Type:
Language materials, printed : 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:
Workshop on the Preservation of Stability under Discretization
Published:
Cham :Springer International Publishing : : 2018.,
Description:
xvii, 889 p. :ill., digital ; : 24 cm.;
Contained By:
Springer eBooks
Subject:
Computer science -
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 2018
theoretical 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 ;6140..
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:
675907
Computer science
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
:02126nam a2200325 a 4500
001
924707
003
DE-He213
005
20180312204724.0
006
m d
007
cr nn 008maaau
008
190625s2018 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
Workshop on the Preservation of Stability under Discretization
$d
(2001 :
$c
Fort Collins, Colo.)
$3
527686
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 :
$c
2018.
$b
Springer International Publishing :
$b
Imprint: Springer,
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
$3
675907
650
1 4
$a
Computer Science.
$3
593922
650
2 4
$a
Algorithm Analysis and Problem Complexity.
$3
593923
650
2 4
$a
Computer Systems Organization and Communication Networks.
$3
669309
650
2 4
$a
Mathematics of Computing.
$3
669457
650
2 4
$a
Data Structures.
$3
669824
650
2 4
$a
Computer Graphics.
$3
669895
650
2 4
$a
Artificial Intelligence (incl. Robotics)
$3
593924
700
1
$a
Bender, Michael A.
$3
1201885
700
1
$a
Farach-Colton, Martin.
$3
894708
700
1
$a
Mosteiro, Miguel A.
$3
1201886
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer eBooks
830
0
$a
Lecture notes in computer science ;
$v
6140.
$3
744199
856
4 0
$u
http://dx.doi.org/10.1007/978-3-319-77404-6
950
$a
Computer Science (Springer-11645)
based on 0 review(s)
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login