Evangelos Kranakis Livres

The foundations of computational complexity theory trace back to Alan Turing in the 1930s, who explored automatic procedures for determining the validity of mathematical statements. A key problem in this field is the undecidability of the Halting Problem, which questions whether a given computer program will eventually halt. Today, computational complexity examines the quantitative aspects of solutions: Is a problem tractable? To measure intractability, various ideas emerged. A. Cobham questioned the appropriate model for defining a "computation step," M. Rabin proposed axioms for complexity measures, and C. Shannon introduced the boolean circuit for computing boolean functions. A crucial inquiry persists: What is the essence of computation? In 1957, John von Neumann noted in his Silliman Lectures that logics and statistics should be viewed as fundamental tools of information theory. He emphasized that the experience surrounding the planning, evaluating, and coding of complex logical and mathematical automata would significantly inform information theory, particularly regarding large electronic computing machines, which are the most typical, though not the only, examples of such automata.

InhaltsverzeichnisRouting.Local Routing on Tori.Topology Control and Geographic Routing in Realistic Wireless Networks.Routing in Wireless Networks with Position Trees.Statistical Monitoring to Control a Proactive Routing Protocol.Topology Control.A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs.Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs.Information Brokerage Via Location-Free Double Rulings.Level Set Estimation Using Uncoordinated Mobile Sensors.The Impact of Delay in Dominating Set and Neighbor Elimination Based Broadcasting in Ad Hoc Networks.Security and Privacy.Building a Trusted Community for Mobile Ad Hoc Networks Using Friend Recommendation.Dependable and Secure Distributed Storage System for Ad Hoc Networks.An Energy and Communication Efficient Group Key in Sensor Networks Using Elliptic Curve Polynomial.Protocols.A Cooperative CDMA-Based Multi-channel MAC Protocol for Ad Hoc Networks.FDAR: A Load-Balanced Routing Scheme for Mobile Ad-Hoc Networks.TOLB: A Traffic-Oblivious Load-Balancing Protocol for Next-Generation Sensornets.A Comparative Analysis of Multicast Protocols for Small MANET Groups.ODCP: An On-Demand Clustering Protocol for Directed Diffusion.Quality of Service and Performance.Quality of Service Support for ODMRP Multicast Routing in Ad Hoc Networks.The Analysis of Fault Tolerance in Triangular Topology Sensor Networks.Performance Modeling of Mobile Sensor Networks.Electronic-Oriented IP Address Auto-Configuration Protocol for MANET.

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.

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.