Fundamentals of Computation Theory 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings /

This book constitutes the refereed proceedings of the 20th International Symposium on Fundamentals of Computation Theory, FCT 2015, held in Gdańsk, Poland, in August 2015. The 27 revised full papers presented were carefully reviewed and selected from 60 submissions. The papers cover topics in three...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Kosowski, Adrian (Επιμελητής έκδοσης), Walukiewicz, Igor (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2015.
Έκδοση:1st ed. 2015.
Σειρά:Lecture Notes in Computer Science, 9210
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02703nam a22005535i 4500
001 978-3-319-22177-9
003 DE-He213
005 20151103131857.0
007 cr nn 008mamaa
008 150803s2015 gw | s |||| 0|eng d
020 |a 9783319221779  |9 978-3-319-22177-9 
024 7 |a 10.1007/978-3-319-22177-9  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
082 0 4 |a 005.1  |2 23 
245 1 0 |a Fundamentals of Computation Theory  |h [electronic resource] :  |b 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings /  |c edited by Adrian Kosowski, Igor Walukiewicz. 
250 |a 1st ed. 2015. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2015. 
300 |a XIX, 395 p. 61 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 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 9210 
520 |a This book constitutes the refereed proceedings of the 20th International Symposium on Fundamentals of Computation Theory, FCT 2015, held in Gdańsk, Poland, in August 2015. The 27 revised full papers presented were carefully reviewed and selected from 60 submissions. The papers cover topics in three main areas: algorithms, formal methods, and emerging fields and are organized in topical sections on geometry, combinatorics, text algorithms; complexity and Boolean functions; languages; set algorithms, covering, and traversal; graph algorithms and networking applications; anonymity and indistinguishability; graphs, automata, and dynamics; and logic and games. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Software engineering. 
650 0 |a Algorithms. 
650 0 |a Computer logic. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Software Engineering. 
700 1 |a Kosowski, Adrian.  |e editor. 
700 1 |a Walukiewicz, Igor.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319221762 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 9210 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-22177-9  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)