Fundamentals of Computation Theory 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings /

This book constitutes the refereed proceedings of the 18th International Symposium Fundamentals of Computation Theory, FCT 2011, held in Oslo, Norway, in August 2011. The 28 revised full papers presented were carefully reviewed and selected from 78 submissions. FCT 2011 focused on algorithms, formal...

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

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Owe, Olaf (Επιμελητής έκδοσης), Steffen, Martin (Επιμελητής έκδοσης), Telle, Jan Arne (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
Σειρά:Lecture Notes in Computer Science, 6914
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02592nam a22005655i 4500
001 978-3-642-22953-4
003 DE-He213
005 20170112050517.0
007 cr nn 008mamaa
008 110817s2011 gw | s |||| 0|eng d
020 |a 9783642229534  |9 978-3-642-22953-4 
024 7 |a 10.1007/978-3-642-22953-4  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
072 7 |a UYZG  |2 bicssc 
072 7 |a COM037000  |2 bisacsh 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Fundamentals of Computation Theory  |h [electronic resource] :  |b 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings /  |c edited by Olaf Owe, Martin Steffen, Jan Arne Telle. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2011. 
300 |a XIII, 373 p.  |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 6914 
520 |a This book constitutes the refereed proceedings of the 18th International Symposium Fundamentals of Computation Theory, FCT 2011, held in Oslo, Norway, in August 2011. The 28 revised full papers presented were carefully reviewed and selected from 78 submissions. FCT 2011 focused on algorithms, formal methods, and emerging fields, such as ad hoc, dynamic and evolving systems; algorithmic game theory; computational biology; foundations of cloud computing and ubiquitous systems; and quantum computation. 
650 0 |a Computer science. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Computation by Abstract Devices. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Mathematics of Computing. 
650 2 4 |a Discrete Mathematics in Computer Science. 
700 1 |a Owe, Olaf.  |e editor. 
700 1 |a Steffen, Martin.  |e editor. 
700 1 |a Telle, Jan Arne.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642229527 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6914 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-22953-4  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)