1  10
Next
 Kranakis, Evangelos.
 Cham, Switzerland : Springer, ©2010.
 Description
 Book — 1 online resource (xvi, 106 pages) : illustrations (some color)
 Summary

 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 tradeoff
 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 tradeoffs
 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
 Lookcomputemove
 Model and terminology
 Impossibility results
 Gathering configurations with a single multiplicity
 Gathering rigid configurations
 Gathering an odd number of robots
 Dangerous networks
 Blackhole search in an asynchronous ring
 Rendezvous in asynchronous rings in spite of a blackhole
 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.
 Kranakis, Evangelos.
 San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool, c2010.
 Description
 Book — 1 electronic text (xvi, 106 p.) : ill.
 Summary

 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 tradeoff
 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 tradeoffs
 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
 Lookcomputemove
 Model and terminology
 Impossibility results
 Gathering configurations with a single multiplicity
 Gathering rigid configurations
 Gathering an odd number of robots
 Dangerous networks
 Blackhole search in an asynchronous ring
 Rendezvous in asynchronous rings in spite of a blackhole
 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.
3. Selected Areas in Cryptography [1997]
 Kranakis, Evangelos.
 Boston, MA : Springer US : Imprint : Springer, 1997.
 Description
 Book — 1 online resource (108 pages) Digital: text file.PDF.
 Summary

 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 NonSurjective Round Functions
 V. Rijmen, et al. Resistance of a CASTLike 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)
(source: Nielsen Book Data)
4. Primality and cryptography [1986]
 Kranakis, Evangelos.
 Chichester [Sussex] ; New York : Wiley, c1986.
 Description
 Book — xv, 235 p. ; 24 cm.
 Summary

 Number Theory. Primality Tests. Probability Theory. Pseudorandom Generators. Public Key Cryptosystems. Towards a General Theory. References. Frequently Used Notation. Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
TK5102.5 .K66 1986  Available 
 Heidelberg ; New York : Springer, ©2013.
 Description
 Book — 1 online resource (xvi, 409 pages) : illustrations Digital: text file.PDF.
 Summary

 FINANCIAL NETWORKS:
 1. Mathematical modeling of systemic risk: H. Amini, A. Minca.
 2. Systemic risk in banking networks without Monte Carlo simulation: J. P. Gleeson, T. R. Hurd, S. Melnik, A. Hackett.
 3. Systemic Valuation of Banks  Interbank Equilibrium and Contagion: G. Halaj.
 4. An Open Problem: J. B. Walsh. II SECURITY NETWORKS:
 5. Dynamic Trust Management: Network Profiling for High Assurance Resilience: M. Burmester , W. O. Redwood.
 6. Security Issues in Link State Routing Protocols for MANETs: G.Cervera, M.Barbeau, J. GarciaAlfaro, E.Kranakis.
 7. TCHo: a Codebased Cryptosystem: A. Duc , S. Vaudenay.
 8. Formal Method for (k)Neighborhood Discovery Protocols: R.Jamet, P.Lafourcade.
 9. A Tutorial on Whitebox AES: J. A. Muir.
 10. Efficient 1Round AlmostPerfect Secure Message Transmission Protocols with Flexible Connectivity: R. SafaviNaini, M. Ashraful Alam Tuhin. III SOCIAL NETWORKS:
 11. Mathematical modelling to evaluate measures and control the spread of illicit drug use: A. Bakhtiari, A. Rutherford.
 12. Complex Networks and Social Networks: A. Bonato, A. Tian.
 13. NAVEL Gazing: Studying a Networked Scholarly Organization: D. Dimitrova, A. Gruzd, Z.Hayat, G. Ying Mo, D.Mok, Th. Robbins, B.Wellman, X. Zhuo.
 14. How Al Qaeda can use order theory to evade or defeat U.S. Forces: J.D.Farley.
 15. The ABCs of Designing Social Networks for Health Behaviour Change: The VivoSpace Social Network: N. Kamal, S. Fels, M. Blackstock, K. Ho.
 16. Evolution of an Open Source Community Network: N. Saraf, A. Seary, D. Chandrasekaran, P.Monge.
 17. SociQL: A Query Language for the SocialWeb: D. Serrano, E. Stroulia, D. Barbosa, V. Guana.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
6. Principles of ad hoc networking [2007]
 Barbeau, Michel (Computer scientist)
 Chichester, England ; Hoboken, NJ : John Wiley & Sons Ltd., c2007.
 Description
 Book — xx, 254 p. : ill. ; 25 cm.
 Summary

 Preface.Glossary
 .1. Wireless Data Communications.1.1 Signal Representation.1.2 Analog to Digital Conversion.1.3 Digital to Analog Conversion.1.4 Architecture of an SDR Application.1.5 Quadrature Modulation and Demodulation.1.6 Spread Spectrum.1.7 Antenna.1.8 Propagation.1.9 Ultrawideband.1.10 Energy Management.1.11 Exercise
 .2. Medium Access Control.2.1 Fundamentals of Probability and Statistics.2.2 Modeling Traffic.2.3 Multiple Access.2.4 Demand Assigned Multiple Access.2.5 Carrier Sense Multiple Access in IEEE 802.11.2.6 Medium Access Control in ad hov Networks.2.7 Bibliographic Comments.2.8 Exercises
 .3. Ad Hov Wireless Access.3.1 Management of Bluetooth Networks.3.2 Model for Node Discovery in Bluetooth.3.3 Bluetooth Formation Algorithms.3.4 Mesh Mode of WiMAX/802.16.3.5 Bibliographic Comments.Exercises
 .4. Wireless Network Programming.4.1 Structure of Information.4.2 Socket.4.3 Parameters and Control.4.4 Receiving Frames.4.5 Sending Frames.4.6 Exercises
 .5. Ad Hov Networks Protocols.5.1 Normal IP Routing.5.2 The Reactive Approach.5.3 The Proactive Approach.5.4 The Hybrid Approach.5.5 Clustering.5.6 Quality of Service.5.7 Sensor Network Protocols.5.8 Exercises
 .6. Location Awareness.6.1 Geographic Proximity.6.2 Constructing Spanners of ad hov Networks.6.3 Information Dissemination.6.4 Geographic Location Determination.6.5 Random Unit Disc Graphs.6.6 Coverage and Connectivity with Directional Sensors.6.7 Bibliographic Comments.6.8 Exercises
 .7. Ad Hov Networks Security.7.1 Authentication Techniques.7.2 Physical Layer Attacks.7.3 Security of Application Protocols.7.4 Biometricsbased Key Establishment.7.5 Routing Security.7.6 Broadcast Security.7.7 Secure Location Verification.7.8 Security in Directional Antenna Systems.7.9 Bibliographic Comments.7.10 Exercises.Bibliography.Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
TK5103.2 .B367 2007  Available 
7. Boolean functions and computation models [2002]
 Clote, Peter.
 Berlin ; New York : Springer, c2002.
 Description
 Book — xiv, 601 p. : ill. ; 25 cm.
 Summary

 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)
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA267.7 .C58 2002  Available 
 ADHOCNOW (Conference) (6th : 2007 : Morelia, Michoacán de Ocampo, Mexico)
 Berlin ; New York : Springer, ©2007.
 Description
 Book — 1 online resource (x, 284 pages) : illustrations Digital: text file.PDF.
 Summary

 Routing. 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 GrowthBounded Graphs. Coordinating Concurrent Transmissions: A ConstantFactor Approximation of MaximumWeight Independent Set in Local Conflict Graphs. Information Brokerage Via LocationFree 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 CDMABased Multichannel MAC Protocol for Ad Hoc Networks. FDAR: A LoadBalanced Routing Scheme for Mobile AdHoc Networks. TOLB: A TrafficOblivious LoadBalancing Protocol for NextGeneration Sensornets. A Comparative Analysis of Multicast Protocols for Small MANET Groups. ODCP: An OnDemand 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. ElectronicOriented IP Address AutoConfiguration Protocol for MANET.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Latin American Symposium on Theoretical Informatics (12th : 2016 : Ensenada, Mexico)
 Berlin : Springer, 2016.
 Description
 Book — 1 online resource (xxvi, 714 pages) : illustrations Digital: text file.PDF.
 Summary

 Reversible Figures and Solids
 Simplicity is in Vogue (again)
 Subgame Perfect Equilibrium: Computation and Efficiency
 Buying Stuff Online
 Data Crowdsourcing: Is It for Real
 A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
 A Middle Curve Based on Discrete Fréchet Distance
 ComparisonBased FIFO Buffer Management in QoS Switches
 Scheduling on PowerHeterogeneous Processors
 Period Recovery over the Hamming and Edit Distances
 Chasing Convex Bodies and Functions
 Parameterized Lower Bounds and Dichotomy Results for the NPCompleteness of HFree Edge Modification Problems
 Parameterized Complexity of Red Blue Set Cover for lines
 Tight Bounds for BeaconBased Coverage in Simple Rectilinear Polygons
 On Mobile Agent Verifiable Problems
 Computing Maximal Layers Of Points In Ef(n)
 On the Total Number of Bends for Planar Octilinear Drawings
 Bidirectional BWTBased De Bruijn Graphs
 The Read/Write Protocol Complex is Collapsible
 The I/O Complexity of Computing Prime Tables.Increasing Diamonds
 Scheduling Transfers of Resources over Time: Towards CarSharing with Flexible DropOffs
 A 0.821Ratio Purely Combinatorial Algorithm for Maximum kVertex Cover in Bipartite Graphs
 Improved Spanning Ratio for Low Degree Spanners
 Constructing Consistent Digital Line Segments
 Faster Information Gathering in AdHoc Radio Tree Networks
 Stabbing circles for Sets of Segments in the Plane
 Faster Algorithms to Enumerate Hypergraph Transversals
 Listing Acyclic Orientations of Graphs with Single and Multiple Sources
 LinearTime Sequence Comparison Using Minimal Absent Words
 The Grandmama de Bruijn Sequence for Binary Strings
 Compressing Bounded Degree Graphs
 Random Partial Match Queries in QuadKd Trees
 From Discrepancy to Majority
 On the Planar Split Thickness of Graphs
 A BoundedRisk Mechanism for the Kidney Exchange Game
 Tight Approximations of Degeneracy in Large Graphs
 Improved Approximation Algorithms for Capacitated FaultTolerant kCenter
 Bundled Crossings in Embedded Graphs
 Probabilistic Analysis of the Dual NextFit Algorithm for Bin Covering
 Deterministic Sparse Suffix Sorting on Rewritable Texts
 Minimizing the Number of Opinions for FaultTolerant Distributed Decision Using WellQuasi Ordering
 Unshuffling Permutations
 Generating Random Spanning Trees via Fast Matrix Multiplication
 Routing in Unit Disk Graphs
 Graph Drawings with One Bend and Few Slopes
 EdgeEditing to a Dense and a Sparse Graph Class
 Containment and Evasion in Stochastic Point Data
 Tree Compression Using String Grammars
 Trees and Languages with Periodic Signature
 Rank Reduction of Directed Graphs by Vertex and Edge Deletions
 New Deterministic Algorithms for Solving Parity Games
 Computing a Geodesic TwoCenter of Points in a Simple Polygon
 Simple Approximation Algorithms for Balanced MAX 2SAT
 A Parameterized Algorithm for MixedCut
 (k; n
 k)MAXCUT: An O*(2p)Time Algorithm and a Polynomial Kernel
 Independent set of convex polygons: from nƐ to 1 + Ɛ via shrinking.
 ADHOCNOW (Conference) (6th : 2007 : Morelia, Michoacán de Ocampo, Mexico)
 Berlin ; New York : Springer, c2007.
 Description
 Book — x, 284 p. : ill.
 Summary

 Routing. 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 GrowthBounded Graphs. Coordinating Concurrent Transmissions: A ConstantFactor Approximation of MaximumWeight Independent Set in Local Conflict Graphs. Information Brokerage Via LocationFree 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 CDMABased Multichannel MAC Protocol for Ad Hoc Networks. FDAR: A LoadBalanced Routing Scheme for Mobile AdHoc Networks. TOLB: A TrafficOblivious LoadBalancing Protocol for NextGeneration Sensornets. A Comparative Analysis of Multicast Protocols for Small MANET Groups. ODCP: An OnDemand 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. ElectronicOriented IP Address AutoConfiguration Protocol for MANET.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.