ANALCO 2019 : Analytic Algorithmics and Combinatorics
Call For Papers
Program Committee Co-chairs
Marni Mishna, Simon Fraser University, Canada
J. Ian Munro, University of Waterloo, Canada
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
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 agency information will be posted here when available.
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
HOTEL RESERVATION DEADLINE
December 3, 2018