LEADER 03939nam  22007575  450 
001 9910484339703321
005 20230330011950.0
010   $a3-319-34171-5
024 7 $a10.1007/978-3-319-34171-2
035   $a(CKB)3710000000717812
035   $a(DE-He213)978-3-319-34171-2
035   $a(MiAaPQ)EBC6281765
035   $a(MiAaPQ)EBC5610874
035   $a(Au-PeEL)EBL5610874
035   $a(OCoLC)1078997918
035   $a(PPN)194378292
035   $a(EXLCZ)993710000000717812
100   $a20160530d2016      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aComputer Science ? Theory and Applications $e11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings /$fedited by Alexander S. Kulikov, Gerhard J. Woeginger
205   $a1st ed. 2016.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2016.
215   $a1 online resource (XXI, 425 p. 49 illus.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9691
311   $a3-319-34170-7 
327   $aAlgorithms and data structures -- Combinatorial optimization -- Constraint solving -- Computational complexity -- Cryptography -- Combinatorics in computer science -- Formal languages and automata -- Computational models and concepts -- Algorithms for concurrent and distributed systems, networks -- Proof theory and applications of logic to computer science -- Model checking -- Automated reasoning -- Deductive methods.
330   $aThis book constitutes the proceedings of the 11th International Computer Science Symposium in Russia, CSR 2016, held in St. Petersburg, Russia, in June 2016. The 28 full papers presented in this volume were carefully reviewed and selected from 71 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas such as: include, but are not limited to: algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; computational models and concepts; algorithms for concurrent and distributed systems, networks; proof theory and applications of logic to computer science; model checking; automated reasoning; and deductive methods.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9691
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aComputer science
606   $aNumerical analysis
606   $aMachine theory
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aTheory of Computation
606   $aNumerical Analysis
606   $aComputer Science Logic and Foundations of Programming
606   $aFormal Languages and Automata Theory
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aComputer science.
615  0$aNumerical analysis.
615  0$aMachine theory.
615 14$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aTheory of Computation.
615 24$aNumerical Analysis.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aFormal Languages and Automata Theory.
676   $a004
702   $aKulikov$b Alexander S$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aWoeginger$b Gerhard J$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910484339703321
996   $aComputer Science - Theory and Applications$92889860
997   $aUNINA