交流群见文末
会议全称:International Colloquium on Automata, Languages and Programming
录用率:2020年29.39%
CCF分级:计算机科学理论B
截稿时间:2024/2/14
录用通知时间:2024/4/14
官网链接:
https://
compose.ioc.ee/icalp202
4/
征稿范围:
Track A
Algorithms, Complexity and Games
-
Algorithmic and Complexity Aspects of Network Economics
-
Algorithmic Aspects of Biological and Physical Systems
-
Algorithmic Aspects of Networks and Networking
-
Algorithmic Aspects of Security and Privacy
-
Algorithmic Game Theory and Mechanism Design
-
Approximation and Online Algorithms
-
Combinatorial Optimization
-
Combinatorics in Computer Science
-
Computational Complexity
-
Computational Geometry
-
Computational Learning Theory
-
Cryptography
-
Data Structures
-
Design and Analysis of Algorithms
-
Distributed and Mobile Computing
-
Foundations of Machine Learning
-
Graph Mining and Network Analysis
-
Parallel and External Memory Computing
-
Parameterized Complexity
-
Quantum Computing
-
Randomness in Computation
-
Sublinear Time and Streaming Algorithms
-
Theoretical Foundations of Algorithmic Fairness
Track B
Automata, Logic, Semantics, and Theory of Programming
-
Algebraic and Categorical Models of Computation
-
Automata, Logic, and Games
-
Database Theory, Constraint Satisfaction Problems, and Finite Model Theory
-
Formal and Logical Aspects of Learning