%{search_type} search results

• 1. Models for mobile agent computing
• Introduction
• What is a mobile agent
• Why mobile agents
• An algorithmic model for mobile agents
• Mobile agents
• Distributed networks
• Resource measures
• Mobile agent rendezvous
• Outline of the book
• Comments and bibliographic remarks.

• 2. Deterministic rendezvous in a ring
• Introduction
• A single stationary token
• The feasibility of rendezvous
• The time complexity of rendezvous
• Memory tradeoff for rendezvous with detection
• Limits to the memory trade-off
• Movable tokens
• Comments and bibliographic remarks.

• 3. Multiple agent rendezvous in a ring
• Introduction
• Impossibility of rendezvous
• Rendezvous with detection
• Conditional solutions
• Comments and bibliographic remarks.

• 4. Randomized rendezvous in a ring
• Introduction
• Random walk algorithm
• Randomization and tokens
• Time/memory trade-offs
• Coin half tour algorithm
• Approximate counting algorithm
• Comments and bibliographic remarks.

• 5. Other models
• Introduction
• Leader election and rendezvous
• Rendezvous with failing tokens
• Rendezvous when tokens fail upon release
• Rendezvous when tokens can fail at any time
• The cost of token failure
• Flickering tokens
• Asynchronous rendezvous
• Look-compute-move
• Model and terminology
• Impossibility results
• Gathering configurations with a single multiplicity
• Gathering rigid configurations
• Gathering an odd number of robots
• Dangerous networks
• Black-hole search in an asynchronous ring
• Rendezvous in asynchronous rings in spite of a black-hole
• Comments and bibliographic remarks.

• 6. Other topologies
• Introduction
• Synchronous torus
• Memory lower bounds for rendezvous
• Rendezvous algorithms
• Trees
• Arbitrary graphs
• Comments and bibliographic remarks.

• Bibliography
• Glossary
• Authors' biographies
• Index.

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.

• 1. Models for mobile agent computing
• Introduction
• What is a mobile agent
• Why mobile agents
• An algorithmic model for mobile agents
• Mobile agents
• Distributed networks
• Resource measures
• Mobile agent rendezvous
• Outline of the book
• Comments and bibliographic remarks --

• 2. Deterministic rendezvous in a ring
• Introduction
• A single stationary token
• The feasibility of rendezvous
• The time complexity of rendezvous
• Memory tradeoff for rendezvous with detection
• Limits to the memory trade-off
• Movable tokens
• Comments and bibliographic remarks --

• 3. Multiple agent rendezvous in a ring
• Introduction
• Impossibility of rendezvous
• Rendezvous with detection
• Conditional solutions
• Comments and bibliographic remarks --

• 4. Randomized rendezvous in a ring
• Introduction
• Random walk algorithm
• Randomization and tokens
• Time/memory trade-offs
• Coin half tour algorithm
• Approximate counting algorithm
• Comments and bibliographic remarks --

• 5. Other models
• Introduction
• Leader election and rendezvous
• Rendezvous with failing tokens
• Rendezvous when tokens fail upon release
• Rendezvous when tokens can fail at any time
• The cost of token failure
• Flickering tokens
• Asynchronous rendezvous
• Look-compute-move
• Model and terminology
• Impossibility results
• Gathering configurations with a single multiplicity
• Gathering rigid configurations
• Gathering an odd number of robots
• Dangerous networks
• Black-hole search in an asynchronous ring
• Rendezvous in asynchronous rings in spite of a black-hole
• Comments and bibliographic remarks --

• 6. Other topologies
• Introduction
• Synchronous torus
• Memory lower bounds for rendezvous
• Rendezvous algorithms
• Trees
• Arbitrary graphs
• Comments and bibliographic remarks --

• Bibliography
• Glossary
• Authors' biographies
• Index.

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.

• Introduction
• E. Kranakis, P. van Oorschot. On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
• D.R. Stinson. MD2 is not Secure Without the Checksum Byte
• N. Rogier, P. Chauvaud. On the Weaknesses of Non-Surjective Round Functions
• V. Rijmen, et al. Resistance of a CAST-Like Encryption Algorithm to Linear and Differential Cryptanalysis
• J. Lee, et al. Constructing Symmetric Ciphers Using the CAST Design Procedure
• C.M. Adams.
• (source: Nielsen Book Data)

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.
(source: Nielsen Book Data)

• 1. Boolean Functions
• 2. Circuit Lower Bounds
• Circuit Upper Bounds
• 4. Randomness and Satisfiability
• 5. Propositional Proof Systems
• 6. Machine Models and Function Algebras
• 7. Higher Types
• References.
• (source: Nielsen Book Data)

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.
(source: Nielsen Book Data)

• RFID, sensors and secure computation
• Security policies and biometrics
• Evaluation of protocols and obfuscation security
• Spam emails, botnets and malware.

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.

• Distributed Algorithms by Forgetful Mobile Robots / Paola Flocchini
• Stability and Metastability of the Logit Dynamics of Strategic Games / Giuseppe Persiano
• Art Galleries, k-modems, and k-convexity / Jorge Urrutia
• The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs / Terry Anderson and Therese Biedl
• Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box / Esther M. Arkin, Alon Efrat, George Hart, Irina Kostitsyna and Alexander Kröller, et al.
• The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye / Michael A. Bender, Ritwik Bose, Rezaul Chowdhury and Samuel McCauley
• Mad at Edge Crossings? Break the Edges! / Till Bruckdorfer and Michael Kaufmann
• Train Marshalling Is Fixed Parameter Tractable / Leo Brueggeman, Michael Fellows, Rudolf Fleischer, Martin Lackner and Christian Komusiewicz, et al.
• Conflict-Free Graph Orientations with Parity Constraints / Sarah Cannon, Mashhood Ishaque and Csaba D. Tóth
• The Multi-interval Ulam-Rényi Game / Ferdinando Cicalese
• Picture-Hanging Puzzles / Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S.B. Mitchell and Ronald L. Rivest, et al.

• Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors / Stefan Dobrev, Lata Narayanan and Jaroslav Opatrny
• The Byzantine Brides Problem / Swan Dubois, Sébastien Tixeuil and Nini Zhu
• Lean Programs, Branch Mispredictions, and Sorting / Amr Elmasry and Jyrki Katajainen
• On Computer Integrated Rationalized Crossword Puzzle Manufacturing / Jakob Engel, Markus Holzer, Oliver Ruepp and Frank Sehnke
• Solving Single-Digit Sudoku Subproblems / David Eppstein
• Finding Good Coffee in Paris / Paola Flocchini, Matthew Kellett, Peter C. Mason and Nicola Santoro
• To Satisfy Impatient Web Surfers Is Hard / Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric and Nicolas Nisse
• Making Life Easier for Firefighters / Fedor V. Fomin, Pinar Heggernes and Erik Jan van Leeuwen
• Counting Perfect Matchings in Graphs of Degree 3 / Martin Fürer
• M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns / Ellen Gethner, David G. Kirkpatrick and Nicholas J. Pippenger
• On the Complexity of Rolling Block and Alice Mazes / Markus Holzer and Sebastian Jakobi
• Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes / Markus Holzer and Sebastian Jakobi.

• Algorithms and Complexity of Generalized River Crossing Problems / Hiro Ito, Stefan Langerman and Yuichi Yoshida
• Solving Tantrix via Integer Programming / Fumika Kino and Yushi Uno
• Scrabble Is PSPACE-Complete / Michael Lampis, Valia Mitsou and Karolina Sołtys
• Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set / Kevin J. Lang
• Spanning Trees and the Complexity of Flood-Filling Games / Kitty Meeks and Alexander Scott
• Tron, a Combinatorial Game on Abstract Graphs / Tillmann Miltzow
• Divorcing Made Easy / Kirk Pruhs and Gerhard J. Woeginger
• A New Analysis of Best Fit Bin Packing / Jiří Sgall
• The Coolest Order of Binary Strings / Brett Stevens and Aaron Williams
• Hitori Number / Akira Suzuki, Kei Uchizawa and Takeaki Uno
• Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric / Wojciech Rytter and Bartosz Szreder
• Gaming Is a Hard Job, But Someone Has to Do It! / Giovanni Viglietta
• Hardness of Mastermind / Giovanni Viglietta
• Scienceography: The Study of How Science Is Written / Graham Cormode, S. Muthukrishnan and Jinyun Yan.

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.

• Invited Lecture by Roberto Tamassia Robust proximity queries in implicit Voronoi diagrams / R. Tamassia, G. Liotta and F.P. Preparata
• O-Convexity: Computing hulls, approximations, and orientation sets / V. Martynchik, N. Metelski and D. Wood
• Efficient algorithms for counting and reporting pairwise intersections between convex polygons / P. Gupta, R. Janardan and M.I. Smid
• Convex hulls of bounded curvature / J.-D. Boissonnat and S. Lazard
• Enclosing k points in the smallest axis parallel rectangle / M. Segal and K. Kedem
• Finding the set of all minimal nested convex polygons / J. Bhadury and R. Chandrasekaran
• Optimizing a corridor between two polygons with an application to polyhedral interpolation / G. Barequet and B. Wolfers.

The 8th Canadian conference on computational geometry had an international flavour. Sixty-one papers were submitted by authors from over 20 countries representing four continents. The conference was held at Carleton University in August 1996.
(source: Nielsen Book Data)