Conference Information

AofA 2026: International Conference / Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Embed deadline badge
AofA
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.
Submission Date:
2026-03-08
Notification Date:
2026-04-20
Conference Date:
2026-06-22
Location:
Munich, Germany
Years:
37
ICORE: C   Viewed: 791   Tracked: 0   Attend: 0

Conference Partner Index (CP-I)

55.7 / 100
Ranked #813 of 5,693 conferences · Top 15%

#50 of 142 in Theory & Algorithms

Academic recognition (35%)
58
Submission selectivity (20%) No data - scored at the neutral baseline of 50 —
Editions held (20%)
98
Community attention (10%)
5
Public record completeness (15%)
35

Inputs used: Listed as ICORE C · Editions on record: 37 · Researchers who opened this page in the past 24 months: 1

Missing from the public record: Historical acceptance rates (+4.5) · Past editions (+3.0) · Best-paper records (+2.3)
Organizers can add these from this page after claiming the conference; scores are recomputed nightly. How to raise this score

Confidence 80% - the share of the score backed by observed data rather than the neutral baseline. How this score is calculated · Browse the ranking · Algorithm version 1.1 · Computed 2026-10-02

Call For Papers

AofA 2026 (International Conference / Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms) is a ICORE C conference held in Munich, Germany on 2026-06-22. The paper submission deadline is 2026-03-08. Acceptance notifications are sent on 2026-04-20.

Scope Analysis of Algorithms (AofA) is a field at the boundary of computer science and mathematics. The goal is to obtain a precise understanding of the asymptotic, average-case characteristics of algorithms and data structures. A unifying theme is the use of probabilistic, combinatorial, and analytic methods. The objects to be studied include random branching processes, graphs, permutations, trees, and strings. See also here for more information on the community and prior events. We invite papers in analytic algorithmics and combinatorics, probabilistic analysis of algorithms and randomized algorithms. We also welcome papers addressing problems such as: combinatorial algorithms, string searching and pattern matching, sublinear algorithms on massive data sets, network algorithms, graph algorithms, caching and memory hierarchies, indexing, data mining, data compression, coding and information theory, and computational finance. Papers are also welcome that address bridges to research in related fields such as statistical physics, computational biology, computational geometry, and simulation.
Last updated by Admin Agent on

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
Journal of Combinatorial Optimization1.1Springer1382-6905
AIEEE Transactions on Multimedia9.7IEEE1520-9210
CKnowledge-Based Systems7.2Elsevier0950-7051
BSoftware & Systems Modeling3.2Springer1619-1366
AIEEE Transactions on Computers3.8IEEE0018-9340
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655
BPattern Recognition7.6Elsevier0031-3203
IEEE Access3.6IEEE2169-3536

Comments 0

No comments yet.

Please Login to post a comment