ANALCO: Analytic Algorithmics and Combinatorics



Past:   Proceedings on DBLP

Future:  Post a CFP for 2020 or later   |   Invite the Organizers Email


All CFPs on WikiCFP

Event When Where Deadline
ANALCO 2019 Analytic Algorithmics and Combinatorics
Jan 6, 2019 - Jan 7, 2019 San Diego, CA, USA Aug 2, 2018 (Jul 26, 2018)
ANALCO 2011 Workshop on Analytic Algorithmics and Combinatorics (Ranked as B, CORE 2008)
Jan 22, 2011 - Jan 22, 2011 San Francisco, California (USA) Oct 4, 2010

Present CFP : 2019

Program Committee Co-chairs

Marni Mishna, Simon Fraser University, Canada
J. Ian Munro, University of Waterloo, Canada
Program Committee

Martin Dietzfelbinger, Technische Universität Ilmenau, Germany
Cecilia Holmgren, Uppsala University, Sweden
Mihyun Kang, Technische Universität Graz, Austria
Yusuke Kobayashi, Kyoto University, Japan
Jérémie Lumbroso, Princeton University, USA
Hosam Mahmoud, George Washington University, USA
Daniel Panario, Carleton University, Canada
Dominique Poulalhon, Université Paris Diderot, France
Sebastian Wild, University of Waterloo, Canada
Steering Committee

Michael Drmota, Technische Universität Wien, Austria
James Allen Fill (Jim Fill), Johns Hopkins University, USA
H.K. Hwang, Institute of Statistical Science, Academia Sinica, Taiwan
Conrado Martínez, Universitat Politècnica de Catalunya, Spain
Markus Nebel, Universität Bielefeld, Germany
Robert Sedgewick, Princeton University, USA
Wojciech Szpankowski, Purdue University, USA
Mark Daniel Ward, Purdue University, USA


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).

Funding Agencies

Funding agency information will be posted here when available.

Important Deadlines

July 26, 2018, 4:59 PM EDT - Short Abstract Submission and Paper Registration Deadline
August 2, 2018, 4:59 PM EDT - Full Paper Submission
Acceptance/rejection notices will be sent to authors via email in early October 2018.

December 3, 2018: Disconnect time is 11:59 PM EST

December 3, 2018

Related Resources

CGDEIJ 2018   Computer Game Development and Education
COCOON 2018   Computing and Combinatorics Conference
IJAB 2018   International Journal of Advances in Biology
ALENEX 2019   SIAM Algorithm & Experiments
IJGTT 2018   International Journal of Game Theory and Technology
CPM 2018   Combinatorial Pattern Matching
COCOA 2018   The 12th Annual International Conference on Combinatorial Optimization and Applications
NALOG 2018   Naming Logics II
IJCI 2018   International Journal on Cybernetics & Informatics