Sequences II

Inhaltsverzeichnis

• Communication.
• On the Enumeration of Dyadic Distributions.
• Detection of Skew in a Sequence of Subsets.
• Asymmetric Error Correcting Codes.
• Binary Perfect Weighted Coverings (PWC).
• Read/Write Isolated Memory.
• Polynomial-Time Construction of Linear Codes with Almost Equal Weights.
• Welch’s Bound and Sequence Sets for Code-Division Multiple-Access Systems.
• Average-Case Interactive Communication.
• Adaptive Lossless Data Compression Over a Noisy Channel.
• Computer Science.
• Parallel String Matching Algorithms.
• Some Applications of Rabin’s Fingerprinting Method.
• Periodic Prefixes in Texts.
• Reconstructing Sequences from Shotgun Data.
• A Systematic Design and Explanation of the Atrubin Multiplier.
• On the Shannon Capacity of Graph Formulae.
• An Efficient Algorithm for the All Pairs Suffix-Prefix Problem.
• Efficient Algorithms for Sequence Analysis.
• Coding Trees as Strings for Approximate Tree Matching.
• Deciding Code Related Properties by Means of Finite Transducers.
• On the Derivation of Spline Bases.
• Optimal Parallel Pattern Matching Through Randomization.
• Approximate String-Matching and the q-gram Distance.
• Universal Discrimination of Individual Sequences via Finite-State Classifiers.
• Security.
• Improving the Efficiency and Reliability of Digital Time-Stamping.
• A Note on Secret Sharing Schemes.
• Privacy of Dense Symmetric Functions.
• Efficient Reduction among Oblivious Transfer Protocols Based on New Self-Intersecting Codes.
• Perfect Zero-Knowledge Sharing Schemes over any Finite Abelian Group.
• Some Comments on the Computation of n-th Roots in Zn.
• The Varieties of Secure Distributed Computation.
• Fair Games Against an All-Powerful Adversary.
• An Asymptotic Coding Theorem for Authentification and Secrecy.
• Automata and Combinatorics on Words.
• Gray Codesand Strongly Square-Free Strings.
• A New Unavoidable Regularity in Free Monoids.
• The Star Height One Problem for Irreducible Automata.
• Synchronizing Automata.
• Author Index.