1 option
Topics in Theoretical Computer Science : Third IFIP WG 1.8 International Conference, TTCS 2020, Tehran, Iran, July 1-2, 2020, Proceedings / edited by Luís S. Barbosa, Mohammad Ali Abam.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12281
- Theoretical Computer Science and General Issues, 2512-2029 ; 12281
- Language:
- English
- Subjects (All):
- Computer science.
- Algorithms.
- Numerical analysis.
- Computer science-Mathematics.
- Discrete mathematics.
- Machine theory.
- Theory of Computation.
- Numerical Analysis.
- Discrete Mathematics in Computer Science.
- Formal Languages and Automata Theory.
- Local Subjects:
- Theory of Computation.
- Algorithms.
- Numerical Analysis.
- Discrete Mathematics in Computer Science.
- Formal Languages and Automata Theory.
- Physical Description:
- 1 online resource (IX, 117 pages) : 33 illustrations, 9 illustrations in color.
- Edition:
- 1st ed. 2020.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2020.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the Third IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, TTCS 2020, held in Tehran, Iran, in July 2020. The conference was held virtually due to the COVID-19 pandemic. The 8 papers presented in this volume were carefully reviewed and selected from 24 submissions. They focus on novel and high-quality research in all areas of theoretical computer science, such as algorithms and complexity; logic, semantics, and programming theory; and more.
- Contents:
- Dirac-based Reduction Techniques for Quantitative Analysis of Discrete-time Markov Models
- Combining Machine and Automata Learning for Network Traffic Classification
- On the complexity of the upper r-tolerant edge cover problem
- Margin-based Semi-supervised Learning Using Apollonius circle
- Computing Boundary Cycle of a Pseudo-Triangle Polygon from its Visibility Graph
- Improved Algorithms for Distributed Balanced Clustering
- Finite Interval-Time Transition System for Real-Time Actors
- Path Planning with Objectives Minimum Length and Maximum Clearance.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-57852-7
- 9783030578527
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.