This book constitutes the refereed proceedings of the 12th Latin American Symposium on Theoretical Informatics, LATIN 2016, held in Ensenada, Mexico, in April 2016. The 52 papers presented together with 5 abstracts were carefully reviewed and selected from 131 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures.

As well as highlighting potentially useful applications for network analysis, this volume identifies new targets for mathematical research that promise to provide insights into network systems theory as well as facilitating the cross-fertilization of ideas between sectors. Focusing on financial, security and social aspects of networking, the volume adds to the growing body of evidence showing that network analysis has applications to transportation, communication, health, finance, and social policy more broadly. It provides powerful models for understanding the behavior of complex systems that, in turn, will impact numerous cutting-edge sectors in science and engineering, such as wireless communication, network security, distributed computing and social networking, financial analysis, and cyber warfare. The volume offers an insider's view of cutting-edge research in network systems, including methodologies with immense potential for interdisciplinary application. The contributors have all presented material at a series of workshops organized on behalf of Canada's MITACS initiative, which funds projects and study grants in 'mathematics for information technology and complex systems'. These proceedings include papers from workshops on financial networks, network security and cryptography, and social networks. MITACS has shown that the partly ghettoized nature of network systems research has led to duplicated work in discrete fields, and thus this initiative has the potential to save time and accelerate the pace of research in a number of areas of network systems research.

Selected Areas in Cryptography brings together in one place important contributions and up-to-date research results in this fast moving area. Selected Areas in Cryptography serves as an excellent reference, providing insight into some of the most challenging research issues in the field.

As well as highlighting potentially useful applications for network analysis, this volume identifies new targets for mathematical research that promise to provide insights into network systems theory as well as facilitating the cross-fertilization of ideas between sectors. Focusing on financial, security and social aspects of networking, the volume adds to the growing body of evidence showing that network analysis has applications to transportation, communication, health, finance, and social policy more broadly. It provides powerful models for understanding the behavior of complex systems that, in turn, will impact numerous cutting-edge sectors in science and engineering, such as wireless communication, network security, distributed computing and social networking, financial analysis, and cyber warfare.

The volume offers an insider s view of cutting-edge research in network systems, including methodologies with immense potential for interdisciplinary application. The contributors have all presented material at a series of workshops organized on behalf of Canada s MITACS initiative, which funds projects and study grants in mathematics for information technology and complex systems . These proceedings include papers from workshops on financial networks, network security and cryptography, and social networks. MITACS has shown that the partly ghettoized nature of network systems research has led to duplicated work in discrete fields, and thus this initiative has the potential to save time and accelerate the pace of research in a number of areas of network systems research.

"

The two internationally renowned authors elucidate the structure of "fast" parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Non-uniform computation models are studied in the form of Boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. Providing a survey of research in the field, the book will benefit advanced undergraduates and graduate students as well as researchers.

Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This monograph focuses on studying mobile agents as modelled in distributed systems research and in particular within the framework of research performed in the distributed algorithms community. It studies the fundamental question of how to achieve rendezvous, the gathering of two or more agents at the same node of a network. Like leader election, such an operation is a useful subroutine in more general computations that may require the agents to synchronize, share information, divide up chores, etc. The work provides an introduction to the algorithmic issues raised by the rendezvous problem in the distributed computing setting. For the most part our investigation concentrates on the simplest case of two agents attempting to rendezvous on a ring network. Other situations including multiple agents, faulty nodes and other topologies are also examined. An extensive bibliography provides many pointers to related work not covered in the text. The presentation has a distinctly algorithmic, rigorous, distributed computing flavor and most results should be easily accessible to advanced undergraduate and graduate students in computer science and mathematics departments. Table of Contents: Models for Mobile Agent Computing / Deterministic Rendezvous in a Ring / Multiple Agent Rendezvous in a Ring / Randomized Rendezvous in a Ring / Other Models / Other Topologies

This book constitutes the refereed proceedings of the 6th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2007, held in Morelia, Mexico, in September 2007.

The 21 revised full papers were carefully reviewed and selected from 50 submissions. The papers are organized in topical sections on routing, topology control, security and privacy, protocols, as well as quality of service and performance.

The third international workshop on AD-HOC NetwOrks and Wireless was held in the downtown Vancouver facilities of Simon Fraser University. The ?rst ADHOC-NOW was held in 2002 at the Fields Institute in Toronto and the s- ond in 2003 in Montreal. Its purpose is to create a collaborative forum between Mathematicians, ComputerScientistsandEngineersforresearchintheemerging ?eld of ad-hoc networks. The number of submissions exceeded all expectations this year. Over 150 papers were submitted of which 22 regular and 8 short papers were accepted for presentation and inclusion in the conference proceedings. The program comm- teeconsistedofMichelBarbeau, StefanoBasagni, AzzedineBoukerche, Soumaya Cherkaoui, Leszek Gasieniec, Janelle Harms, Jeannette Janssen, Christos K- lamanis, Evangelos Kranakis, Danny Krizanc, Thomas Kunz, Ramiro Liscano, Lata Narayanan, Ioanis Nikolaidis, Stephan Olariu, Jaroslav Opatrny, Pino P- siano, Samuel Pierre, S.S. Ravi, Mazda Salmanian, Sunil Shende, Ladislav S- cho, Martha Steenstrup, Ivan Stojmenovic, Violet Syrotiuk, Ljiljana Trajkovic, Jorge Urrutia, Peter Widmayer, and Kui Wu. We would like to thank the invited speaker Martha Steenstrup for her - search presentation and the program committee for refereeing the submissions. Many thanks to Paul Boone, Jen Hall, Jo-Ann Rockwood, Zheyin Li, and Tao Wan for helping with the workshop logistics. Special thanks go to MITACS (MathematicsofInformationTechnologyandComplexSystems)andPIMS(- ci?c Institute for the Mathematical Sciences) for supporting the workshop ?n- cially, CarletonUniversityandtheUniversityofAlbertaforprovidingcomputing facilities, and Simon Fraser University for its hospita

AdHoc Networks are wireless, self-organizing systems formed by co-operating nodes, within communication range of each other which form temporary n- works. Their topology is dynamic, decentralized, and ever-changing, and the nodes may move around arbitrarily. The last few years have witnessed a wealth ofresearchideasonAdHocnetworkswhicharemovingrapidlyintoimplemented standards. Mobile computing, particularly wireless-enabled mobile computing, covers a large area of applications in mobile computing environments, networking, c- municationdevicesandsystems.Thisconferenceexposesexperimentalaswellas theoretical research in adhoc, mobile and wireless networks. The range of topics covered includes management of power consumption, architectures and pro- cols, quality of service, and security. The aim of the conference was to provide a unique opportunity for researchers and students in industry and academia to participate at an annual forum and share their research results and experiences. This conference followed the ?rst successful conference (held at the Fields - stituteinTorontoduringSeptember20-21oflastyear),andwasheldattheH- iday Inn, Midtown in Montreal during October 8-10, 2003. It was co-sponsored by the Mobile Computing and Networking Research Laboratory (LARIM) of the ' Ecole Polytechnique de Montr' eal, theSchool of Computer Science (SCS) of C- leton University, MITACS (Mathematics of Information Technology and C- plex Systems), and the Association for Computing Machinery (ACM).

This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Nonuniform computation models are studied in the form of boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. The book will benefit advanced undergraduates and graduate students as well as researchers in the field of complexity theory.

Selected Areas in Cryptography brings together in one place important contributions and up-to-date research results in this fast moving area. Selected Areas in Cryptography serves as an excellent reference, providing insight into some of the most challenging research issues in the field.

This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Symposium on Foundations and Practice of Security, FPS 2015, held in Clermont-Ferrand, France, in October 2015. The 12 revised full papers presented together with 8 short papers and 2 keynote talks were carefully reviewed and selected from 58 submissions. The papers are organized in topical sections on RFID, sensors and secure computation; security policies and biometrics; evaluation of protocols and obfuscation security; spam emails, botnets and malware.

This book constitutes the proceedings of the 9th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2013, held in Sophia Antipolis, France, in September 2013. The 19 papers presented in this volume were carefully reviewed and selected from 30 submissions. They deal with sensor network algorithms, wireless networks and distributed robotics algorithms; and experimental algorithms.

A comprehensive account of recent algorithms developed in computational number theory and primality testing. Provides a general framework for the theoretical study of public key cryptography and pseudorandom generators. Unique in its approach, the book will be a valuable addition to computer literature.