↓ Skip to main content

Sequences II

Overview of attention for book
Cover of 'Sequences II'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On the enumeration of dyadic distributions
  3. Altmetric Badge
    Chapter 2 Detection of Skew in a Sequence of Subsets
  4. Altmetric Badge
    Chapter 3 Asymmetric Error Correcting Codes
  5. Altmetric Badge
    Chapter 4 Binary Perfect Weighted Coverings (PWC)
  6. Altmetric Badge
    Chapter 5 Read/Write Isolated Memory
  7. Altmetric Badge
    Chapter 6 Polynomial-time construction of linear codes with almost equal weights
  8. Altmetric Badge
    Chapter 7 Welch’s Bound and Sequence Sets for Code-Division Multiple-Access Systems
  9. Altmetric Badge
    Chapter 8 Average-case interactive communication
  10. Altmetric Badge
    Chapter 9 Adaptive Lossless Data Compression over a Noisy Channel
  11. Altmetric Badge
    Chapter 10 Parallel string matching algorithms
  12. Altmetric Badge
    Chapter 11 Some applications of Rabin’s fingerprinting method
  13. Altmetric Badge
    Chapter 12 Periodic Prefixes in Texts
  14. Altmetric Badge
    Chapter 13 Reconstructing sequences from shotgun data
  15. Altmetric Badge
    Chapter 14 A Systematic Design and Explanation of the Atrubin Multiplier
  16. Altmetric Badge
    Chapter 15 On the Shannon Capacity of Graph Formulae
  17. Altmetric Badge
    Chapter 16 An Efficient Algorithm for the All Pairs Suffix-Prefix Problem
  18. Altmetric Badge
    Chapter 17 Efficient Algorithms for Sequence Analysis
  19. Altmetric Badge
    Chapter 18 Coding Trees as Strings for Approximate Tree Matching
  20. Altmetric Badge
    Chapter 19 Deciding Code Related Properties by Means of Finite Transducers
  21. Altmetric Badge
    Chapter 20 On the Derivation of Spline Bases
  22. Altmetric Badge
    Chapter 21 Optimal Parallel Pattern Matching Through Randomization
  23. Altmetric Badge
    Chapter 22 Approximate string-matching and the q-gram distance
  24. Altmetric Badge
    Chapter 23 Universal Discrimination of Individual Sequences via Finite-State Classifiers
  25. Altmetric Badge
    Chapter 24 Improving the Efficiency and Reliability of Digital Time-Stamping
  26. Altmetric Badge
    Chapter 25 A Note on Secret Sharing Schemes
  27. Altmetric Badge
    Chapter 26 Privacy of Dense Symmetric Functions
  28. Altmetric Badge
    Chapter 27 Efficient Reduction among Oblivious Transfer Protocols based on New Self-Intersecting Codes
  29. Altmetric Badge
    Chapter 28 Perfect Zero-Knowledge Sharing Schemes over any Finite Abelian Group
  30. Altmetric Badge
    Chapter 29 Some Comments on the Computation of n-th Roots in Z N
  31. Altmetric Badge
    Chapter 30 The Varieties of Secure Distributed Computation
  32. Altmetric Badge
    Chapter 31 Fair Games Against an All-Powerful Adversary
  33. Altmetric Badge
    Chapter 32 An Asymptotic Coding Theorem for Authentication and Secrecy
  34. Altmetric Badge
    Chapter 33 Gray Codes and Strongly Square-Free Strings
  35. Altmetric Badge
    Chapter 34 A New Unavoidable Regularity in Free Monoids
  36. Altmetric Badge
    Chapter 35 The Star Height One Problem for Irreducible Automata
  37. Altmetric Badge
    Chapter 36 Synchronizing Automata
Attention for Chapter 24: Improving the Efficiency and Reliability of Digital Time-Stamping
Altmetric Badge

Mentioned by

twitter
4 X users
wikipedia
9 Wikipedia pages

Citations

dimensions_citation
12 Dimensions

Readers on

mendeley
322 Mendeley