This book of 'directions' focuses on cyber security research, education and training in India, and work in this domain within the Indian Institute of Technology Kanpur. IIT Kanpur's Computer Science and Engineering Department established an 'Interdisciplinary Center for Cyber Security and Cyber Defense of Critical Infrastructures (C3I Center)' in 2016 with funding from the Science and Engineering Research Board (SERB), and other funding agencies. The work at the center focuses on smart grid security, manufacturing and other industrial control system security; network, web and data security; cryptography, and penetration techniques. The founders are involved with various Indian government agencies including the Reserve Bank of India, National Critical Information Infrastructure Protection Center, UIDAI, CCTNS under home ministry, Ministry of IT and Electronics, and Department of Science & Technology. The center also testifies to the parliamentary standing committee on cyber security, and has been working with the National Cyber Security Coordinator's office in India. Providing glimpses of the work done at IIT Kanpur, and including perspectives from other Indian institutes where work on cyber security is starting to take shape, the book is a valuable resource for researchers and professionals, as well as educationists and policymakers.

This book brings together contributions by leading researchers in computational complexity theory written in honor of Somenath Biswas on the occasion of his sixtieth birthday. They discuss current trends and exciting developments in this flourishing area of research and offer fresh perspectives on various aspects of complexity theory. The topics covered include arithmetic circuit complexity, lower bounds and polynomial identity testing, the isomorphism conjecture, space-bounded computation, graph isomorphism, resolution and proof complexity, entropy and randomness. Several chapters have a tutorial flavor. The aim is to make recent research in these topics accessible to graduate students and senior undergraduates in computer science and mathematics. It can also be useful as a resource for teaching advanced level courses in computational complexity.

This book constitutes the refereed proceedings of the 9th International Conference on Theory and Applications of Models of Computation, TAMC 2012, held in Beijing, China, in May 2012. The conference was combined with the Turing Lectures 2012, dedicated to celebrating Alan Turing s unique impact on mathematics, computing, computer science, informatics, morphogenesis, philosophy, and the wider scientific world. Eight Turing Lectures were given at the TAMC 2012. The 40 revised full papers presented together with invited talks were carefully reviewed and selected from 86 submissions. The papers address 4 special sessions at TAMC 2012 which were algorithms and information in networks, complexity and cryptography, models of computing and networking, programming and verification."

Theory and Applications of Models of Computation (TAMC) is an inter- tional conference series with an interdisciplinary character, bringing together researchers working in computer science, mathematics (especially logic), and the physicalsciences. This crossdisciplinarycharacter, together with its focus on algorithms, complexity, and computability theory, gives the conference a special ?avor and distinction. TAMC2008wasthe?fth conferenceintheseries.Thepreviousfourmeetings wereheldduringMay17-19,2004inBeijing, May17-20,2005inKunming, May 15-20,2006 in Beijing, and May 22-25, 2007 in Shanghai. TAMC 2008 was held in Xi'an, during April 25-29, 2008. At TAMC 2008 we had two plenary speakers, Bernard Chazelle and Cynthia Dwork, giving one-hour talkseach. Bernardspokeon "WhyAlgorithms Matter" and Cynthia on "Di?erential Privacy: A Survey of Results." Their respective papers accompanying the talks are included in the proceedings. In addition, there were two special sessions organized by Barry Cooper and Ying Jiang on "Models of Computation" and by Jianer Chen on "Algorithms and Complexity." The invited speakersin the ?rst session wereJoseFelix Costa, Vincent Danos, Luke Ong, Mingsheng Ying, Miklos Santha, and Gilles Dowek. Invited speakers in the second session were Daniel Brown, Dieter Kratsch, - aotie Deng, and Jianer Chen. The TAMC conference series arose naturally in response to important sci- ti?c developments a?ecting how we compute in the twenty-?rst century. At the same time, TAMC is already playing an important regional and international role, and promises to become a key contributor to the scienti?c resurgence seen throughout China and other parts of Asia.

This book constitutes the refereed proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2002, held in Kanpur, India in December 2002.The 26 revised full papers presented together with 5 invited contributions were carefully reviewed and selected from 108 submissions. A broad variety of topics from the theory of computing are addressed, from algorithmics and discrete mathematics as well as from logics and programming theory.

This book brings together contributions by leading researchers in computational complexity theory written in honor of Somenath Biswas on the occasion of his sixtieth birthday. They discuss current trends and exciting developments in this flourishing area of research and offer fresh perspectives on various aspects of complexity theory. The topics covered include arithmetic circuit complexity, lower bounds and polynomial identity testing, the isomorphism conjecture, space-bounded computation, graph isomorphism, resolution and proof complexity, entropy and randomness. Several chapters have a tutorial flavor. The aim is to make recent research in these topics accessible to graduate students and senior undergraduates in computer science and mathematics. It can also be useful as a resource for teaching advanced level courses in computational complexity.

This book constitutes the refereed proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014, held in Chennai, India, in April 2014. The 27 revised full papers presented were carefully reviewed and selected from 112 submissions. The papers explore the algorithmic foundations, computational methods and computing devices to meet today's and tomorrow's challenges of complexity, scalability and sustainability, with wide-ranging impacts on everything from the design of biological systems to the understanding of economic markets and social networks.