Evangelos Kranakis

Konstantinos Georgiou

This book constitutes the refereed proceedings of the 19th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2023, held in Amsterdam, The Netherlands, during September 7–8, 2023. The 10 full papers included in this book were carefully reviewed and selected from 22 submissions. They were organized in topical sections as follows: design and analysis of algorithms, models of computation and experimental analysis.

19th International Symposium, ALGOWIN 2023, Amsterdam, The Netherlands, September 7–8, 2023, Revised Selected Papers

Algorithmics of Wireless Networks

Joaquin Garcia-Alfaro

Guillaume Bonfante

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.

8th International Symposium, FPS 2015, Clermont-Ferrand, France, October 26-28, 2015, Revised Selected Papers

Foundations and Practice of Security

Edgar Chávez

Gonzalo Navarro

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.

12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings

LATIN 2016: Theoretical Informatics

Peter Clote

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.

Boolean Functions and Computation Models

Danny Krizanc

Euripides Marcou

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

The Mobile Agent Rendezvous Problem in the Ring

Jaroslav Opatrny

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.

6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings

Ad-Hoc, Mobile, and Wireless Networks

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.

Advances in Network Analysis and its Applications

DANNY KRIZANC

Flaminia Luccio

This book constitutes the refereed proceedings of the 6th International Conference, FUN 2012, held in June 2012 in Venice, Italy. The 34 revised full papers were carefully reviewed and selected from 56 submissions. They feature a large variety of topics in the field of the use, design, and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area.

Evangelos Kranakis

About

Books

Join the club