Información de la conferencia

ICALP 2025: International Colloquium on Automata, Languages and Programming

Por favor Iniciar para ver el sitio web del congreso

Día de Entrega:
2025-02-07
Fecha de Notificación:
2025-04-14
Fecha de Conferencia:
2025-07-08
Ubicación:
Aarhus, Denmark
Años:
52
CCF: b   CORE: a   QUALIS: a1   Vistas: 197133   Seguidores: 44   Asistentes: 5

Solicitud de Artículos

ICALP 2025 (International Colloquium on Automata, Languages and Programming) is a CCF B / CORE A / QUALIS A1 conference held in Aarhus, Denmark on 2025-07-08. The paper submission deadline is 2025-02-07. Acceptance notifications are sent on 2025-04-14.

Topics Papers presenting original research on all aspects of theoretical computer science are sought. Typical, but not exclusive, topics of interest are: Track A: Algorithms, Complexity and Games Algorithmic and computational complexity aspects of biological and social networks Algorithmic Aspects of Security and Privacy Algorithmic Game Theory and Mechanism Design Approximation 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 Dynamic Algorithms Foundations of Machine Learning Graph Mining and Network Analysis Online Algorithms 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 Formal and Logical Aspects of Security and Privacy Logic in Computer Science and Theorem Proving Models of Computation: Complexity and Computability Models of Concurrent, Distributed, and Mobile Systems Models of Reactive, Hybrid, and Stochastic Systems Principles and Semantics of Programming Languages Program Analysis, Verification, and Synthesis Type Systems and Typed Calculi
Última Actualización Por Dou Sun en

Coeficiente de Aceptación

Average acceptance rate: 28.2% over 14 years (2007–2020).

AñoEnviadosAceptadosAceptados(%)
202034710229.4%
20193169429.7%
20183469828.3%
20172968829.7%
20163198927.9%
201550714328.2%
201448413628.1%
201342212429.4%
20122487128.6%
20112226027%
20102226027%
20092236227.8%
20082697026%
20071494127.5%

Los Mejores Artículos

AñoLos Mejores Artículos
2019Christof Loding and Anton Pirogov: "Determinization of Buchi Automata: Unifying the Approaches of Safra and Muller-Schupp
2019Distributed Reconfiguration of Maximal Independent Sets
2019A Simple Gap-producing Reduction for the Parameterized Set Cover Problem
2018A polynomial-time approximation algorithm for all-terminal network reliability
2018An optimal bound on the solution sets of one-variable word equations and its consequences
2018Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
2017Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
2017Characterizing Defin-ability in Decidable Fixpoint Logics
2017Universal Framework for Wireless Scheduling Problems
2016Amplifiers for the Moran Process
2016An almost Cubic Lower Bound for Depth Three Arithmetic Circuits
2016Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
2015Selling two goods optimally
2015An Algebraic Geometric Approach to Nivat's Conjecture
2015Fully Dynamic Matching in Bipartite Graphs
2014Shortest Two Disjoint Paths in Polynomial Time
2014Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
2014Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
2013Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities
2013Reachability in Two-Clock Timed Automata is PSPACE-complete
2013Fast Collaborative Graph Exploration
2012The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation)
2012Regular Languages are Church-Rosser Congruential
2012Online Mechanism Design (Randomized Rounding on the Fly)
2011Algebraic Independence and Blackbox Identity Testing
2011Regular Languages of Words Over Countable Linear Orderings
2011Local Matching Dynamics in Social Networks
2010Approximating the Partition Function of the Ferromagnetic Potts Model
2010Placing Regenerators in Optical Networks to Safity Multiple Sets of Requests
2010On optimal proof systems and logics for PTIME
2009A Better algorithm for random k-SAT
2009LTL Path Checking is Efficiently Parallelizable
2009Improved Algorithms for Latency Minimization in Wireless Network
2008The complexity of Boolean formula minimization
2008Duality and equational theory of regular languages
2008Making Classical honest verifier zero-knowledge protocols secure against quantum attacks
2007Holographic algorithms. The Power of Dimensionality Resolved
2007A Generalization of Cobham's Theorem to Automata over Real Numbers
2007Deterministic History Independent Strategies for Storing Information on Write Once Memories
2006Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
2006The Wadge Hierarchy of Deterministic Tree Languages
2006On counting homomorphisms to directed acyclic graphs
2005Tight Lower Bounds for Query Processing on Streaming and External Memory Data
2005Simple Extractors Via Constructions of Cryptographic Pseudo-random Generators
2004Quantum query complexity of some graph problems
2004Tree-Walking Automata Cannot Be Determinized
2003The cell probe complexity of succint data structures
2003A testing scenario for probabilistic automata
2002Inapproximability Results for Equations over Finite Groups
2001Division is in Uniform TC0
2001Effective Lossy Queue Languages
2000Deterministic algorithms for k-SAT based on covering codes and local search
2000Reasoning about idealized Algol using regular languages
2000An optimal minimum spanning tree algorithm

Conferencias Relacionadas

CCFCOREQUALISAbreviaciónNombre CompletoEntregaNotificaciónConferencia
aa2ESOPEuropean Symposium on Programming2026-10-152026-12-222027-04-10
baa1EMNLPConference on Empirical Methods in Natural Language Processing2026-05-272026-08-202026-10-24
bb2IJCNLPInternational Joint Conference on Natural Language Processing2026-05-252026-09-072026-11-06
ab1ICLPInternational Conference on Logic Programming2026-01-312026-03-122026-07-20
cab1CoNLLThe SIGNLL Conference on Computational Natural Language Learning2025-03-142025-05-232025-07-31
baa1ICALPInternational Colloquium on Automata, Languages and Programming2025-02-072025-04-142025-07-08
cbb1ILPInternational Conference on Inductive Logic Programming2021-06-252021-08-052021-10-25
b4ICALIPInternational Conference on Audio, Language and Image Processing2018-05-082018-05-252018-07-16
bb3PLoPInternational Conference on Pattern Languages of Programs2016-05-192016-08-052016-10-24
ab1FLOPSInternational Symposium on Functional and Logic Programming2011-12-162012-02-032012-05-23

Revistas Relacionadas

CCFNombre CompletoFactor de ImpactoEditorISSN
IEEE Robotics & Automation Magazine7.2IEEE1070-9932
Computer Assisted Language Learning6.6Taylor & Francis0958-8221
IEEE/ACM Transactions on Audio Speech and Language Processing5.1IEEE2329-9290
Mathematical Programming2.5Springer0025-5610
cNatural Language Engineering1.9Cambridge University Press1351-3249
Journal of Computer Languages1.8Elsevier2665-9182
bScience of Computer Programming1.4Elsevier0167-6423
Computational Management Science1.3Springer1619-697X
International Journal of Parallel Programming0.9Springer0885-7458
Journal of Logical and Algebraic Methods in Programming0.700Elsevier2352-2208

Publicidad