posted by user: timwylie || 2292 views || tracked by 4 users: [display]

ANALCO 2019 : Analytic Algorithmics and Combinatorics


When Jan 6, 2019 - Jan 7, 2019
Where San Diego, CA, USA
Abstract Registration Due Jul 26, 2018
Submission Deadline Aug 2, 2018
Notification Due Oct 15, 2018
Final Version Due Nov 15, 2018
Categories    theory   algorithms   combinatorics   complexity

Call For Papers

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

DLT 2021   25th International Conference on Developments in Language Theory
CSEIT 2021   8th International Conference on Computer Science, Engineering and Information Technology
WADS 2021   Algorithms and Data Structures Symposium
IWOCA 2021   32nd International Workshop on Combinatorial Algorithms
MVA 2021   17th International Conference on Machine Vision Applications
COMPLEXIS 2021   6th International Conference on Complexity, Future Information Systems and Risk
CLOUD 2021   10th International Conference on Cloud Computing: Services and Architecture
AlCoB 2020 & 2021   7th-8th International Conference on Algorithms for Computational Biology
SCOPUS-3CE 2021   2021 Asia Conference on Communications and Computer Engineering (3CE 2021)
Blockchain Consensus 2021   Blockchain Consensus Protocols