학회 정보

ICALP 2027: International Colloquium on Automata, Languages and Programming

학회 웹사이트를 보려면 로그인해 주세요
무료 가입으로 공식 사이트 조회, 마감 추적, 이메일 리마인더를 이용할 수 있습니다.
회원가입 로그인
투고 마감일:
2026-09-15 마감됨
통보일:
2026-12-08
개최일:
2027-07-05
개최지:
Krakow, Poland
개최 횟수:
캘린더에 추가: Outlook / Apple (.ics)
CCF: B   ICORE: A*   QUALIS: A1   조회: 203632   팔로우: 44   참가: 5
이 페이지에 잘못된 정보가 있나요? 알려 주세요
마감 카운트다운 배지 삽입
ICALP
이 데이터를 API로 가져오기
검색과 순위 목록은 자격 증명이 전혀 필요 없습니다. 이 페이지의 상세 데이터에는 무료 API 키가 필요합니다. 자세한 내용은 개발자 안내 페이지를 참고하세요.

회반 지수 (CP-I)

91.7 / 100
전체 5,696개 중 54위 · 상위 1%

이론·알고리즘 분야 142개 중 2위

학술적 인정 (35%)
100
투고 선별성 (20%)
79
개최 횟수 (20%)
100
커뮤니티 관심도 (10%)
58
공개 자료 충실도 (15%)
100

사용한 입력: 수록 등급: CCF B, QUALIS A1 · 게재율: 29%(기록이 있는 5개 회차의 평균) · 확인되는 개최 횟수: 54 · 회반에서 팔로우 중인 연구자: 44명 · 지난 24개월 동안 이 페이지를 연 연구자: 16명

신뢰도 100% — 점수 중 중립 기준값이 아니라 실제 관측된 데이터에 근거한 비율. 이 점수는 어떻게 계산되나 · 전체 순위 보기 · 알고리즘 버전 1.1 · 산출일 2026-10-14

논문 모집

ICALP 2027 (International Colloquium on Automata, Languages and Programming) is a CCF B / ICORE A* / QUALIS A1 conference held in Krakow, Poland on 2027-07-05. The paper submission deadline is 2026-09-15. Acceptance notifications are sent on 2026-12-08.

Topics Papers presenting original research on all aspects of theoretical computer science are sought. Typical, but not exclusive, topics of interest for Track B (Automata, Logic, Semantics, and Theory of Programming) include: 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
최종 수정: Admin Agent ()

게재율

평균 게재율: 28.2% 14년간 (2007–2020).

연도투고 수게재 수게재율(%)
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%

베스트 페이퍼

연도베스트 페이퍼
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

이 항목을 본 사람들이 함께 본 항목

관련 학회

CCFICORECP-I약칭정식 명칭투고 마감개최일
41.6ProgrammingInternational Conference on the Art, Science, and Engineering of Programming2027-03-15
BA*89.7ICRAInternational Conference on Robotics and Automation2026-09-152027-05-24
BA*97.4IJCAIInternational Joint Conference on Artificial Intelligence2027-01-042027-08-07
B91.2ICASSPInternational Conference on Acoustics, Speech and Signal Processing2026-09-162027-05-16
BA*79.8PODSACM SIGMOD Conference on Principles of DB Systems2026-12-032027-06-13
BA76.6ICMEInternational Conference on Multimedia and Expo2025-12-312026-07-05
B84.4BIBMInternational Conference on Bioinformatics & Biomedicine2026-07-052026-12-01
BA*94.1ICDMInternational Conference on Data Mining2026-06-062026-11-12
BA*89.1ECCVEuropean Conference on Computer Vision2026-03-062026-09-08
BA92.9DATEDesign, Automation and Test in Europe2026-09-072027-03-22

관련 저널

CCF정식 명칭영향력 지수출판사ISSN
Programming and Computer Software0.5Springer0361-7688
Journal of Visual Languages and ComputingElsevier1045-926X
BSoftware & Systems Modeling3.2Springer1619-1366
BPattern Recognition7.6Elsevier0031-3203
BIEEE Transactions on Neural Networks and Learning Systems8.9IEEE1045-9227
BInformation Sciences6.0Elsevier0020-0255
BComputer Networks4.7Elsevier1389-1286
BComputers & Security5.4Elsevier0167-4048
BIEEE Transactions on Intelligent Transportation Systems8.4IEEE1524-9050
BJournal of Systems and Software3.8Elsevier0164-1212

댓글 0

아직 댓글이 없습니다.

댓글을 작성하려면 로그인해 주세요