Sold Out
Book Categories |
Preface | ||
Contributors | ||
Communication | ||
On the Enumeration of Dyadic Distributions | 3 | |
Detection of Skew in a Sequence of Subsets | 12 | |
Asymmetric Error Correcting Codes | 24 | |
Binary Perfect Weighted Coverings (PWC) | 36 | |
Read/Write Isolated Memory | 52 | |
Polynomial-Time Construction of Linear Codes with Almost Equal Weights | 59 | |
Welch's Bound and Sequence Sets for Code-Division Multiple-Access Systems | 63 | |
Average-Case Interactive Communication | 79 | |
Adaptive Lossless Data Compression Over a Noisy Channel | 104 | |
Computer Science | ||
Parallel String Matching Algorithms | 121 | |
Some Applications of Rabin's Fingerprinting Method | 143 | |
Periodic Prefixes in Texts | 153 | |
Reconstructing Sequences from Shotgun Data | 166 | |
A Systematic Design and Explanation of the Atrubin Multiplier | 189 | |
On the Shannon Capacity of Graph Formulae | 203 | |
An Efficient Algorithm for the All Pairs Suffix-Prefix Problem | 218 | |
Efficient Algorithms for Sequence Analysis | 225 | |
Coding Trees as Strings for Approximate Tree Matching | 245 | |
Deciding Code Related Properties by Means of Finite Transducers | 260 | |
On the Derivation of Spline Bases | 273 | |
Optimal Parallel Pattern Matching Through Randomization | 292 | |
Approximate String-Matching and the q-gram Distance | 300 | |
Universal Discrimination of Individual Sequences via Finite-State Classifiers | 313 | |
Security | ||
Improving the Efficiency and Reliability of Digital Time-Stamping | 329 | |
A Note on Secret Sharing Schemes | 335 | |
Privacy of Dense Symmetric Functions | 345 | |
Efficient Reduction among Oblivious Transfer Protocols Based on New Self-Intersecting Codes | 360 | |
Perfect Zero-Knowledge Sharing Schemes over any Finite Abelian Group | 369 | |
Some Comments on the Computation of n-th Roots in Z[subscript n] | 379 | |
The Varieties of Secure Distributed Computation | 392 | |
Fair Games Against an All-Powerful Adversary | 418 | |
An Asymptotic Coding Theorem for Authentification and Secrecy | 430 | |
Automata and Combinatorics on Words | ||
Gray Codes and Strongly Square-Free Strings | 439 | |
A New Unavoidable Regularity in Free Monoids | 447 | |
The Star Height One Problem for Irreducible Automata | 457 | |
Synchronizing Automata | 470 | |
Author Index | 477 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionSequences II: Methods in Communication, Security, and Computer Science
X
This Item is in Your InventorySequences II: Methods in Communication, Security, and Computer Science
X
You must be logged in to review the productsX
X
X
Add Sequences II: Methods in Communication, Security, and Computer Science, This volume provides an up-to-date view of several topics in theoretical computer science and suggests directions for future research. It constitutes a valuable working tool for mathematicians, electrical engineers and computer scientists and will be of i, Sequences II: Methods in Communication, Security, and Computer Science to the inventory that you are selling on WonderClubX
X
Add Sequences II: Methods in Communication, Security, and Computer Science, This volume provides an up-to-date view of several topics in theoretical computer science and suggests directions for future research. It constitutes a valuable working tool for mathematicians, electrical engineers and computer scientists and will be of i, Sequences II: Methods in Communication, Security, and Computer Science to your collection on WonderClub |