Information Technology Security -- How can we justify trust in software based systems? -- The capacity of ciphers fulfilling the accessibility of cryptograms -- Parallelization of the Data Encryption Standard (DES) algorithm -- Linked authenticated dictionaries for certificate status verification -- Integrated Payment System for Public Key Infrastructure Services -- Some methods of the analysis…
This comprehensive encyclopedia provides easy access to information on all aspects of cryptography and security. With an A–Z format of over 460 entries, 100+ international experts provide an accessible reference for those seeking entry into any aspect of the broad fields of cryptography and information security. Most entries in this preeminent work include useful literature references, provid…
Network Protocols -- The Timed Abstract Protocol Notation -- Execution Models of Network Protocols -- Equivalence of Execution Models -- Preserving Fairness -- The Austin Protocol Compiler -- Two Examples -- A DNS Server -- Concluding Remarks.-The Austin Protocol Compiler presents a protocol specification language called the Timed Abstract Protocol (TAP) notation. This book will finally close t…
Matching Points with Circles and Squares -- The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation -- Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs -- Sliding Disks in the Plane -- Weighted Ham-Sandwich Cuts -- Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane -- Farthest-Point Queries with Geometric and Combinatorial Constraints -- Grid Ver…
Invited Talks -- Algorithmic Problems in Ad Hoc Networks -- Five Challenges in Wide-Area Sensor Systems -- Challenges in Programming Sensor Networks -- Regular Papers -- Distributed Proximity Maintenance in Ad Hoc Mobile Networks -- Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks -- An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Senso…
Invited Talks -- Online Packet Switching -- Approximation Algorithms for Mixed Fractional Packing and Covering Problems -- Regular Papers -- Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees -- Online Bin Packing with Resource Augmentation -- A PTAS for Delay Minimization in Establishing Wireless Conference Calls -- This Side Up! -- Approximation Algorithm for Directed…
Agent-Based Approaches to Transport Logistics -- Provisional Agreement Protocol for Global Transportation Scheduling -- An Adaptive Approach to Dynamic Transport Optimization -- Designing Multiagent Decision Support Systems for Traffic Management -- SCATEAgent: Context-Aware Software Agents for Multi-Modal Travel -- Reducing the Effects of the Braess Paradox with Information Manipulation -- Ana…
Expression -- Spectral Clustering Gene Ontology Terms to Group Genes by Function -- Dynamic De-Novo Prediction of microRNAs Associated with Cell Conditions: A Search Pruned by Expression -- Clustering Gene Expression Series with Prior Knowledge -- A Linear Time Biclustering Algorithm for Time Series Gene Expression Data -- Time-Window Analysis of Developmental Gene Expression Data with Multiple…
Session 1 -- Towards a Theory of Algorithms -- Session 2A -- k-Restricted Rotation with an Application to Search Tree Rebalancing -- Heap Building Bounds -- Session 2B -- The Multi-radius Cover Problem -- Parameterized Complexity of Generalized Vertex Cover Problems -- The Complexity of Implicit and Space Efficient Priority Queues -- Analysis of a Class of Tries with Adaptive Multi-digit Branc…
Designing Reliable Algorithms in Unreliable Memories -- From Balanced Graph Partitioning to Balanced Metric Labeling -- Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism -- Exploring an Unknown Graph Efficiently -- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio -- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minim…