ACM­-SIAM Symposium on Discrete Algorithms (SODA 2017)

L'Hospitalet de Llobregat Barcelona

Jan 15 - 19, 2017

SODA focuses on research topics related to efficient algorithms and data structures for discrete problems. In addition to the design of such methods and structures, the scope also includes their use, performance analysis, and the mathematical problems related to their development or limitations. Performance analyses may be analytical or experimental and may address worst-case or expected-case performance. Studies can be theoretical or based on data sets that have arisen in practice and may address methodological issues involved in performance analysis.

SODA 2017 Website

The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged that address algorithms and data structures for advanced models of computing including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to exascale and cloud computing.

ALENEX 2017 Website

The aim of ANALCO is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures. We invite both papers that study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and papers that address the precise analysis of algorithms for processing such structures, including: average-case analysis; analysis of moments, extrema, and distributions; probabilistic analysis of randomized algorithms, and so on. Submissions that present significant new information about classic algorithms are welcome, as are new analyses of new algorithms that present unique analytic challenges. We also invite submissions that address tools and techniques for the analysis of algorithms and combinatorial structures, both mathematical and computational.

ANALCO 2017 Website

 

We are excited to use Whova as our event management solution.

Attendees please download the Award-winning Whova event app to access:

  • Interactive agenda
  • Logistics
  • Shared Documents
  • Event Announcements
  • Attendees Profiles
  • Attendee Interactions
Click here to check all Whova's benefits.

Powered by Whova Agenda Center
Update once, sync up everywhere

Loading...

Powered by Whova Speaker Hub
Update once, sync up everywhere

Cyrus Rashtchian

University of Washington

Bio: PhD student, University of Washington, Computer Science and Engineering. Interested in Similarity Search, Distributed Algorithms, Analysis of Boolean functions, circuit complexity, and connections with other areas of math. Currently working at MSR on DNA-based archival storage.

Adrian Kosowski

Researcher, Inria & IRIF

Alberto Ceselli

Associate Professor, Dipartimento di Informatica, Università degli Studi di Milano

Alexey Gronskiy

Teaching Assistant, ETH Zurich

Alfonso Cevallos

Postdoctoral Researcher, EPFL (École polytechnique fédérale de Lausanne)

Anastasios Sidiropoulos

Assistant Professor, The Ohio State University

Arman Yousefi

PhD Student, UCLA

Arnab Ganguly

Graduate Teaching Assistant, Louisiana State University

Ashish Chiplunkar

Postdoctoral Research Fellow, Tel Aviv University

Aviad Rubinstein

PhD candidate, UC Berkeley

Bart M.P. Jansen

Assistant Professor, Eindhoven University of Technology

Benjamin Hackl

Project assistant, Alpen-Adria-Universität Klagenfurt

Benjamin Moseley

Assistant Professor, Washington University in St. Louis

Brendan Lucier

Researcher, Microsoft

Bundit Laekhanukit

Postdoctoral Fellow, Weizmann Institute of Science

Costas Tsirogiannis

Postdoc, Aarhus University

Aaron Bernstein

Technical University Berlin

Aaron Schild

University of California, Berkeley

Akanksha Agrawal

University of Bergen

Ameya Velingker

École Polytechnique Fédérale de Lausanne (EPFL)

Andreas Poyias

Department of Informatics, University of Leicester

Ankit Singh Rawat

Massachusetts Institute of Technology

Arkadev Chattopadhyay

Tata Institute of Fundamental Research

Ashley Montanaro

University of Bristol

Assaf Naor

Princeton University

Bella Zhukova

University of Helsinki

Benjamin Karsin

Department of Information and Computer Sciences, University of Hawaii at Manoa, USA

Benjamin Recht

University of California, Berkeley, USA

Cameron Musco

MIT

Carla Michini

University of Wisconsin Madison

Attendees please download Whova event app, to access the information of all 219 speakers.

download whova event app on apple store download whova event app on Google Play

We are excited to use Whova as our event platform. Attendees please download Whova event app, to access the documents and handouts shared by the organizers.

Plaça d'Europa, 43-45, L'Hospitalet de Llobregat, Barcelona, 08908, ES