Theory of Computing Systems [electronic resource] / edited by Mitsunori Ogihara.

Інтелектуальна відповідальність: Вид матеріалу: Серіальне виданняПублікація: New York : Springer US : Imprint: Springer.Опис: online resourceISSN:
  • 1433-0490
Тематика(и): Додаткові фізичні формати: Printed version: : Немає назвиЕлектронне місцезнаходження та доступ: Зведення: Statement of Scope TOCS is devoted to publishing original research from all areas of theoretical computer science, ranging from foundational areas such as computational complexity, to fundamental areas such as algorithms and data structures, to focused areas such as parallel and distributed algorithms and architectures. Topics include theoretical aspects of the following items:   ·         Algebraic methods ·         Algorithmic game theory ·         Algorithmic information theory ·         Algorithms and data structures ·         Analysis of algorithms ·         Applied graph theory ·         Approximate algorithms for hard problems ·         Approximation algorithms ·         Automata ·         Formal languages ·         Combinatorial pattern matching ·         Communication networks ·         Complexity and computability theory ·         Computational and algorithmic learning theory ·         Computational biology ·         Computational complexity ·         Computational geometry ·         Computational molecular biology ·         Computational science  ·         Cryptography and security ·         Data compression algorithms ·         Data mining ·         Data structures ·         Database theory ·         Distributed algorithms ·         Distributed computing ·         Dynamic data structures ·         Effective mathematics ·         Exact algorithms ·         External memory algorithms ·         Graph algorithms ·         Kolmogorov complexity ·         Logic in computer science ·         Machine learning ·         Machine-based complexity theory ·         Mobile computing ·         Models of computation ·         Molecular computation ·         Networks ·         Parallel and distributed computing ·         Physics and computation ·         Program checking ·         Property testing ·         Quantum computing ·         Randomized algorithms ·         Routing, broadcasting, searching ·         String algorithms ·         Text indexing ·         Theoretical aspects of parallel algorithms and architectures of networks ·         Theory of communication networks ·         Theory of concurrent systems.
Тип одиниці: ЕЖурнал Списки з цим бібзаписом: Springer EJournals (till 2020.02 Network Access) | Springer EJournals till 2020.02 (Open Access + Network Access)
Мітки з цієї бібліотеки: Немає міток з цієї бібліотеки для цієї назви. Ввійдіть, щоб додавати мітки.
Оцінки зірочками
    Середня оцінка: 0.0 (0 голос.)
Немає реальних примірників для цього запису

Statement of Scope TOCS is devoted to publishing original research from all areas of theoretical computer science, ranging from foundational areas such as computational complexity, to fundamental areas such as algorithms and data structures, to focused areas such as parallel and distributed algorithms and architectures. Topics include theoretical aspects of the following items:   ·         Algebraic methods ·         Algorithmic game theory ·         Algorithmic information theory ·         Algorithms and data structures ·         Analysis of algorithms ·         Applied graph theory ·         Approximate algorithms for hard problems ·         Approximation algorithms ·         Automata ·         Formal languages ·         Combinatorial pattern matching ·         Communication networks ·         Complexity and computability theory ·         Computational and algorithmic learning theory ·         Computational biology ·         Computational complexity ·         Computational geometry ·         Computational molecular biology ·         Computational science  ·         Cryptography and security ·         Data compression algorithms ·         Data mining ·         Data structures ·         Database theory ·         Distributed algorithms ·         Distributed computing ·         Dynamic data structures ·         Effective mathematics ·         Exact algorithms ·         External memory algorithms ·         Graph algorithms ·         Kolmogorov complexity ·         Logic in computer science ·         Machine learning ·         Machine-based complexity theory ·         Mobile computing ·         Models of computation ·         Molecular computation ·         Networks ·         Parallel and distributed computing ·         Physics and computation ·         Program checking ·         Property testing ·         Quantum computing ·         Randomized algorithms ·         Routing, broadcasting, searching ·         String algorithms ·         Text indexing ·         Theoretical aspects of parallel algorithms and architectures of networks ·         Theory of communication networks ·         Theory of concurrent systems.

Немає коментарів для цієї одиниці.

для можливості публікувати коментарі.