Conference Information

ANALCO 2019: Meeting on Analytic Algorithmics and Combinatorics

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Register Login
Embed deadline badge
ANALCO
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:
2018-07-26
Notification Date:
Conference Date:
2019-01-06
Location:
San Diego, California, USA
Viewed: 14647   Tracked: 0   Attend: 0

Conference Partner Index (CP-I)

42.1 / 100
Ranked #4,073 of 5,647 conferences · Top 73%

#117 of 138 in Theory & Algorithms

Limited evidence: this conference is not listed in CCF / ICORE / QUALIS and has no acceptance-rate data on file, so most of the score falls back to the neutral baseline.
Academic recognition (35%) No data - scored at the neutral baseline of 50 —
Submission selectivity (20%) No data - scored at the neutral baseline of 50 —
Editions held (20%) No data - scored at the neutral baseline of 50 —
Community attention (10%)
8
Public record completeness (15%)
25

Inputs used: Researchers who opened this page in the past 24 months: 2

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 25% - 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-09-03

Call For Papers

ANALCO 2019 (Meeting on Analytic Algorithmics and Combinatorics) is an academic conference held in San Diego, California, USA on 2019-01-06. The paper submission deadline is 2018-07-26.

ANALCO is a forum for original research in algorithm analysis, specifically techniques and methods to analyze the resource requirements of algorithms. This includes, but is not limited to, average-case analysis of algorithms, probabilistic analysis of randomized algorithms, analytic information theory, space-efficient data structures, and amortized analyses. We also consider combinatorial topics to be within the scope of this event, such as the analytic and enumerative combinatorics of structures that arise in practical computational applications (eg. permutations, trees, strings, tries, words, mappings, hash tables and graphs). Submissions that present significant new information about classic algorithms are welcome, as are analyses of new algorithms that present unique analytic challenges. The scientific program will include invited talks, contributed research papers, and ample time for discussion and debate of topics in this area. ANALCO is co-located with the ACM-SIAM Symposium on Discrete Algorithms (SODA19), Algorithm Engineering and Experiments (ALENEX) and Symposium on Simplicity in Algorithms. Since researchers in all fields are approaching the problem of learning detailed information about the performance of particular algorithms, we expect that interesting synergies will develop. ANALCO is supported by SIAM (Society for Industrial and Applied Mathematics).
Last updated by Dou Sun on

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
Graphs and Combinatorics0.7Springer0911-0119
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