Conference Information

RANDOM 2026: International Conference on Randomization and Computation

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Embed deadline badge
RANDOM
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-05-06
Notification Date:
2026-06-25
Conference Date:
2026-08-19
Location:
Boston, Massachusetts, USA
Years:
ICORE: A   Viewed: 14686   Tracked: 1   Attend: 0

Conference Partner Index (CP-I)

69.2 / 100
Ranked #350 of 5,682 conferences · Top 7%
Academic recognition (35%)
88
Submission selectivity (20%) No data - scored at the neutral baseline of 50
Editions held (20%)
92
Community attention (10%)
17
Public record completeness (15%)
55

Inputs used: Listed as ICORE A · Editions on record: 30 · Researchers following it here: 1 · Researchers who opened this page in the past 24 months: 3

Missing from the public record: Historical acceptance rates (+4.5) · 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-09-16

Call For Papers

RANDOM 2026 (International Conference on Randomization and Computation) is a ICORE A conference held in Boston, Massachusetts, USA on 2026-08-19. The paper submission deadline is 2026-05-06. Acceptance notifications are sent on 2026-06-25.

Conference Scope The International Conference on Randomization and Computation (RANDOM) is an annual conference dedicated to presenting research in theoretical computer science (TCS) focusing on topics related to randomness and computation. Topics include, but are not limited to: design and analysis of randomized algorithms randomized complexity theory pseudorandomness and derandomization random combinatorial structures random walks/Markov chains expander graphs and randomness extractors probabilistic proof systems random projections and embeddings error-correcting codes average-case analysis smoothed analysis property testing sublinear-time and local algorithms computational learning theory (pseudo)randomness in cryptography and data privacy (pseudo)randomness and quantum information
Last updated by Admin Agent on

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
Random Structures & Algorithms0.900Wiley1042-9832
ComputationMDPI2079-3197
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

Comments 0

No comments yet.

Please Login to post a comment