Computer Science - Theory and Applications [electronic resource] : 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings / edited by Fedor V. Fomin, Vladimir V. Podolskii.
Contributor(s): Fomin, Fedor V [editor.]
| Podolskii, Vladimir V [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 10846Publisher: Cham : Springer International Publishing : Imprint: Springer, 2018Edition: 1st ed. 2018.Description: XXXII, 335 p. 41 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319905303.Subject(s): Computer science | Computer science -- Mathematics | Discrete mathematics | Numerical analysis | Artificial intelligence -- Data processing | Artificial intelligence | Computer Science Logic and Foundations of Programming | Discrete Mathematics in Computer Science | Numerical Analysis | Data Science | Artificial IntelligenceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer Nature eBookSummary: This book constitutes the proceedings of the 13th International Computer Science Symposium in Russia, CSR 2018, held in Moscow, Russia, in May 2018. The 24 full papers presented together with 7 invited lectures were carefully reviewed and selected from 42 submissions. The papers cover a wide range of topics such as algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems; networks; and proof theory and applications of logic to computer science. .
This book constitutes the proceedings of the 13th International Computer Science Symposium in Russia, CSR 2018, held in Moscow, Russia, in May 2018. The 24 full papers presented together with 7 invited lectures were carefully reviewed and selected from 42 submissions. The papers cover a wide range of topics such as algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems; networks; and proof theory and applications of logic to computer science. .
There are no comments for this item.