FSTTCS 2018 hosted by School of Engineering and Sciences

FSTTCS 2018 hosted by School of Engineering and Sciences
Dec 10, 2018 - Dec 14, 2018 Ahmedabad University Workshops

The FSTTCS conference is organised annually by the Indian Association for Research in Computing Science (IARCS). The conference is a forum where original results in foundational aspects of Computer Science and Software Technology are presented. This year’s conference hosted at Ahmedabad University for 4 days, had 4 invited talks and 44 papers presented on the state-of-the-art research in the areas of:

Algorithms, Data Structures, Graph Theory and Combinatorics, Approximation Algorithms, Automata, Games and Formal Languages, Optimization, Communication Complexity, Computational Learning Theory, Logic in Computer Science, Models of Concurrent and Distributed Systems, Parallel, Distributed and Online Algorithms, Parameterized Complexity, Randomness in Computing, Theorem Proving, Decision Procedures, Model Checking and Reactive Synthesis.

The conference hosted 109 scholars including 40+ foreign scholars, 40+ Indian faculty members and industry experts and students from India. The conference Programme committee was chaired by Sumit Ganguly (IIT Kanpur) and Paritosh Pandya (TIFR) and the Organising committee at Ahmedabad University consisted of Ratnik Gandhi (co-chair) and Mehul Raval(co-chair), Mazad Zaveri, Dhaval Patel, Barbara Morawska, Pratik Trivedi, Anurag Lakhlani, and Sanjay Chaudhary.

The proceedings of FSTTCS 2018 has been published as a volume in the LIPIcs series under a Creative Commons license, with free online access to all

The 4 invited speakers of FSTTCS were:

  • Ola Svensson (EPFL, Lausanne, Switzerland)
  • Santosh Vempala (Georgia Institute of Technology, USA)
  • Rupak Majumdar (Max Planck Institute for Software Systems, Kaiserslautern, Germany)
  • Aravinda Prasad Sistla (The University of Illinois, Chicago)

Day 1: (Pre-conference Workshop)

On 10th December 2018, the conference had a pre-conference workshop on Trends in Transformations, organised by Paul Gastin (ENS de Cachan, France) and S.N. Krishna (IIT Bombay, India). The workshop with over 40 participants began with a tutorial talk by Emmanuel Filiot (Université Libre de Bruxelles).  Laure Daviaud (University of Warwick), Vincent Penelle(LaBRI) and Nathan Lhote (University of Warsaw) delivered technical talks on recent trends in transducers.

Day 2: (Conference Inauguration)

On 11th December 2018, the conference was formally inaugurated and Professor Pankaj Chandra, Vice Chancellor, Ahmedabad University addressed the delegates in the inaugural session.

The first invited talk was delivered by Santosh Vempala who motivated the need of Continuous Algorithms. Arvind Prasad Sistla delivered an invited talk on model checking for security protocols.

The conference had two parallel tracks (Track A and Track B) on its first day. Those in Track A discussed technical papers related to circuit complexity, presented papers on Property testing and arithmetic circuit complexity along with papers on approximation algorithms. While in Track B, papers on Formal verification and reachability, and Automata and Model checking, along with transducers and first order logic were presented.

Day 3: (2nd day of Conference)

On 12th December 2018, the 2nd day of the conference, there was an invited talk by Rupak Mazumdar on random testing of distributed and concurrent systems for finding bugs in them.

The day had again had two parallel tracks of 4 sessions of contributed talks and 18 paper presentations. In Track A, Space complexity, Market Equilibria, Streaming Algorithms and Parameterised complexity were covered. In Track B, the topics were Regular languages, Context free Grammars, Propositional Logic and Partial order logic.

After the technical talks, IARCS presented the 2018 activity report and announced FSTTCS 2019. Delegates were then hosted over a banquet dinner at Vishalla.

Day 4: (Final day of Conference)

13th December 2018, the final day of the conference, began with an invited talk by Ola Svensson who presented a talk on asymmetric version of Traveling salesperson’s problem. The talk presented old and new methods for solving the problem and concluded discussing a new constant factor approximation algorithm designed by the speaker.

In the technical sessions, following the invited talk, researchers presented their results on Graph algorithms, Game Theory, Matrix factorization algorithms, as a part of Track A and  Games and Automata, Algorithmic Probabilistic computation, and Process algebra, as a part of Track B.


Your browser is out-of-date!

For a richer surfing experience on our website, please update your browser.Update my browser now!