ccf a类会议_2021 年初 计算机理论 顶级会议 截稿时间

​

以下为未来三个月内截稿的CCF推荐，计算机理论领域会议，按照时间排序

个别会议因为没有公布截稿信息而不在列表中

录取率信息为网络上可获得的最近年份数据，不一定是上一年的，文中尽量选择同时带有投稿量的数据年份供大家参考。

Core Ranking会排除Not primarily CS或者是national的会议，个别未上榜会议不代表会议水平差。

具体列表如下：

SOTC

会议全称：ACM Symposium on the Theory of Computing会议网址：http://acm-stoc.org/stoc2021/会议地点：Rome, ItalyCCF分类：A 类Core分类：A*类H5指数：63录取率：24.4% (103/422)

截稿日期：2020年11月06日评审结果：2021年02月07日会议时间：2021年06月21日

SPECIFIC AREAS OF INTEREST:Topics of interest include, but are not limited to: algorithms and data structures, computational complexity, randomness in computing, algorithmic graph theory and combinatorics, approximation algorithms, cryptography, computational learning theory, continuous and discrete optimization, economics and computation, parallel and distributed algorithms, quantum computing, algorithmic coding theory, computational geometry, computational applications of logic, algebraic computation, and computational and foundational aspects of areas such as machine learning, fairness, privacy, networks, data management, databases and computational biology. Papers that extend the reach of the theory of computing, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged. The program committee will make every effort to consider a broad range of areas.

IPCO

会议全称：ACM SIGPLAN Conference on Programming Language Design & Implementation会议网址： https://sites.gatech.edu/ipco-2021/会议地点：Atlanta, Georgia, USA CCF分类：C 类Core分类：A 类H5指数：16录取率：28.9% (33/114)

截稿日期：2020年11月11日评审结果：2021年01月31日会议时间：2021年05月19日

SPECIFIC AREAS OF INTEREST:The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas.

SoCG

会议全称：ACM Symposium on Computational Geometry会议网址：https://cse.buffalo.edu/socg21/index.html会议地点：New YorkCCF分类：B 类Core分类：A 类H5指数：22录取率：31.4% (64/205)

截稿日期：2020年11月25日评审结果：2021年02月10日会议时间：2021年06月07日

SPECIFIC AREAS OF INTEREST:The 37th International Symposium on Computational Geometry (SoCG 2021) will be held in Buffalo, New York, June 7-11, 2021, as part of the Computational Geometry (CG) Week. We invite submissions of high quality that describe original research on computational problems in a geometric setting. Topics of interest include, but are not limited to:• Design, analysis, and implementation of geometric algorithms and data structures;• Lower bounds on the computational complexity of geometric problems;• Mathematical, numerical, and algebraic issues arising in the formulation, analysis, implementation, and experimental evaluation of geometric algorithms and heuristics;• Discrete and combinatorial geometry;• Computational topology, topological data analysis, and topological combinatorics;• Applications of computational geometry in any field.

LICS

会议全称：IEEE Symposium on Logic in Computer Science会议网址：http://easyconferences.eu/lics2021/会议地点：Rome, ItalyCCF分类：A 类Core分类：A*类H5指数：24录取率：40% (89/224)

截稿日期：2021年01月25日评审结果：2021年03月31日会议时间：2021年06月29日

SPECIFIC AREAS OF INTEREST:The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include:automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, games and logic, higher-order logic, knowledge representation and reasoning, lambda and combinatory calculi, linear logic, logic programming, logical aspects of AI, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification.

CAV

会议全称：Computer Aided Verification会议网址：http://i-cav.org/2021/会议地点：Los Angeles, USACCF分类：A 类Core分类：A*类H5指数：38录取率：25.2% (65/258)

截稿日期：2021年01月28日评审结果：2021年04月19日会议时间：2021年07月18日

SPECIFIC AREAS OF INTEREST:Topics of interest include but are not limited to:Algorithms and tools for verifying models and implementationsAlgorithms and tools for system synthesisAlgorithms and tools that combine verification and learningMathematical and logical foundations of verification and synthesisSpecifications and correctness criteria for programs and systemsDeductive verification using proof assistantsHardware verification techniquesProgram analysis and software verificationSoftware synthesisHybrid systems and embedded systems verificationFormal methods for cyber-physical systemsCompositional and abstraction-based techniques for verificationProbabilistic and statistical approaches to verificationVerification methods for parallel and concurrent systemsTesting and run-time analysis based on verification technologyDecision procedures and solvers for verification and synthesisApplications and case studies in verification and synthesisVerification in industrial practiceNew application areas for algorithmic verification and synthesisFormal models and methods for securityFormal models and methods for biological systems

ICALP

会议全称：International Colloquium on Automata, Languages and Programming会议网址：http://easyconferences.eu/icalp2021/ 会议地点：Glasgow, ScotlandCCF分类：B 类Core分类：A 类H5指数：32录取率：29.8% (146/490)

截稿日期：2021年02月12日评审结果：2021年04月28日会议时间：2021年07月12日

SPECIFIC AREAS OF INTEREST:Track A: Algorithms, Complexity and GamesAlgorithmic and Complexity Aspects of Network EconomicsAlgorithmic Aspects of Networks and NetworkingAlgorithmic Aspects of Security and PrivacyAlgorithms for Computational BiologyAlgorithmic Game Theory and Mechanism DesignApproximation and Online AlgorithmsCombinatorial OptimizationCombinatorics in Computer ScienceComputational ComplexityComputational GeometryComputational Learning TheoryCryptographyData StructuresDesign and Analysis of AlgorithmsDistributed and Mobile ComputingFoundations of Machine LearningGraph Mining and Network AnalysisParallel and External Memory ComputingQuantum ComputingRandomness in ComputationTheoretical Foundations of Algorithmic FairnessTrack B: Automata, Logic, Semantics, and Theory of ProgrammingAlgebraic and Categorical Models of ComputationAutomata, Logic, and GamesDatabase Theory, Constraint Satisfaction Problems, and Finite Model TheoryFormal and Logical Aspects of LearningFormal and Logical Aspects of Security and PrivacyLogic in Computer Science and Theorem ProvingModels of Computation: Complexity and ComputabilityModels of Concurrent, Distributed, and Mobile SystemsModels of Reactive, Hybrid, and Stochastic SystemsPrinciples and Semantics of Programming LanguagesProgram Analysis, Verification, and SynthesisType Systems and Typed Calculi

CCC

会议全称：IEEE Conference on Computational Complexity会议网址：https://computationalcomplexity.org会议地点：Toronto, Ontario, CanadaCCF分类：B 类Core分类：A 类H5指数：21录取率：37.6% (38/101)

截稿日期：2021年02月15日评审结果：2021年04月30日会议时间：2021年07月28日

SPECIFIC AREAS OF INTEREST:Complexity classesReducibility and completenessCircuit complexityCommunication complexityAlgebraic complexityProof complexityComplexity in other concrete computational modelsInteractive and probabilistic proof systemsLogic and descriptive complexityPseudorandomness and derandomizationAverage case complexityQuantum computationParametrized complexityFine-grained complexityComplexity-theoretic aspects of:coding theorycryptographyoptimization (including inapproximability, continuous optimization)property testingstreaming and sublinear computationdistributed computationgame theorymachine learning

CADE

会议全称：International Conference on Automated Deduction会议网址：https://www.cs.cmu.edu/~mheule/CADE28/会议地点：CMUCCF分类：B 类Core分类：A 类H5指数：17录取率：44.9% (31/69)

截稿日期：2021年02月22日评审结果：2021年04月16日会议时间：2021年07月11日

SPECIFIC AREAS OF INTEREST:Topics of interest include but are not limited to:Algorithms and tools for verifying models and implementationsAlgorithms and tools for system synthesisAlgorithms and tools that combine verification and learningMathematical and logical foundations of verification and synthesisSpecifications and correctness criteria for programs and systemsDeductive verification using proof assistantsHardware verification techniquesProgram analysis and software verificationSoftware synthesisHybrid systems and embedded systems verificationFormal methods for cyber-physical systemsCompositional and abstraction-based techniques for verificationProbabilistic and statistical approaches to verificationVerification methods for parallel and concurrent systemsTesting and run-time analysis based on verification technologyDecision procedures and solvers for verification and synthesisApplications and case studies in verification and synthesisVerification in industrial practiceNew application areas for algorithmic verification and synthesisFormal models and methods for securityFormal models and methods for biological systemsSubmissions on a wide range of topics are sought, particularly ones that identify new research directions. CAV 2021 is not limited to topics discussed in previous instances of the conference. Authors concerned about the appropriateness of a topic may communicate with the conference chairs prior to submission.