Aims and scope

Theory of Computing Systems (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

Special Issue on Advances in String Processing and Information Retrieval
Submission Date: 2025-02-01

We are seeking submissions for a topical collection on Advances on String Processing and Information Retrieval. Areas that fall in the scope of this collection include typical topics from the SPIRE-conference series (International Symposium on String Processing and Information Retrieval) and range from string algorithms, text indexing, combinatorial pattern matching, data compression, to computational biology and algorithmic aspects of information retrieval. Specific topics of interest include, but are not limited to:

• String Processing: string pattern matching, text indexing, data structures for string processing, text compression, compressed data structures, compressed string processing, text mining, 2D pattern matching, automata based string processing, combinatorics on words.

• Information Retrieval: Web search. Retrieval models and ranking. Theoretical models and foundations of information retrieval and access. Efficiency and scalability, e.g., efficient data structures for IR, indexing, etc. Queries and query analysis. Content analysis for search. Knowledge acquisition. Machine Learning and Natural Language Processing for search, e.g., Core ML, Question answering, Conversational systems, Explicit semantics. Knowledge representation and reasoning. User-centric aspects of IR including user interfaces, behavior modeling, privacy, and interactive systems. Evaluation. Fairness, accountability, transparency. Domain-specific applications, e.g., local and mobile search, social search, multimedia search, health, digital libraries, etc.

• Computational Biology: algorithms for DNA sequencing, assembly, alignments, read error correction, metagenomics, transcriptomics, gene and regulatory element recognition, motif finding, pangenomics, variants discovery, phylogenetics, genome rearrangements.

Special Issue on Approximation and Online Algorithms (WAOA 2024)
Submission Date: 2025-03-31

This special issue will be devoted to selected extended abstracts presented at the 22nd Workshop on Approximation and Online Algorithms (WAOA 2024), to be held in London, UK, on September 5-6, 2024.

Approximation and online algorithms are fundamental tools to deal with computationally hard problems and problems in which the input is gradually disclosed over time. Both kinds of problems arise from a large number of applications in a variety of fields.

Papers are solicited in all research areas related to approximation and online algorithms, including, but not limited to:

● Algorithmic game theory, ● Algorithmic trading, ● Coloring and partitioning, ● Competitive analysis, ● Computational advertising, ● Computational finance, ● Cuts and connectivity, ● FPT-approximation algorithms, ● Geometric problems, ● Graph algorithms, ● Inapproximability results, ● Mechanism design, ● Network design, ● Packing and covering, ● Paradigms for the design and analysis of approximation and online algorithms, ● Resource augmentation, ● Scheduling problems.