Sequences
Editat de Renato M. Capocellien Limba Engleză Paperback – 19 sep 2011
Preț: 626.86 lei
Preț vechi: 737.48 lei
-15%
Puncte Express: 940
Carte tipărită la comandă
Livrare economică 09-23 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9781461279778
ISBN-10: 1461279771
Pagini: 564
Ilustrații: XII, 549 p.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.84 kg
Ediția:Softcover reprint of the original 1st ed. 1990
Editura: Springer
Locul publicării:New York, NY, United States
ISBN-10: 1461279771
Pagini: 564
Ilustrații: XII, 549 p.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.84 kg
Ediția:Softcover reprint of the original 1st ed. 1990
Editura: Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Combinatorial Algorithms.- Fast Parallel and Serial Multidimensional Approximate Array Matching.- Context-Dependent String Matching.- Constant-Space String-Matching.- Matching Patterns in Strings Subject to Multi-Linear Transformations.- Efficient Algorithms with Applications to Molecular Biology.- A Survey of Approximation Algorithms for the Permanent.- On Optimal Parallel Computations for Sequences of Brackets.- Combinatorics.- Universal Sequences and Graph Cover Times: A Short Survey.- Fibonacci Facts and Formulas.- On the Influence of Single Participant in Coin Flipping Schemes.- Zero-Error Capacities and Very Different Sequences.- Sequences of Lyndon Words.- A Note on Addition Chains and Some Related Conjectures.- Some Applications of Probability Methods to Number Theory. Successes and Limitations.- On Pseudo-Random Arrays Constructed from Patterns with Distinct Differences.- Combinatorial Designs Derived from Costas Arrays.- Algorithms for Determining Relative Star-Height and Star-Height.- Eigenwords and Periodic Behaviors.- Infinite Words and a Problem in Semigroup Theory.- Some Combinatorial Properties of Factorial Languages.- A Conjecture on Rational Sequences.- Sequences Defined by Iterated Morphisms.- Encoding the Vertices of a Graph with Binary Edge Labels.- Compression.- Applications of DAWGs to Data Compression.- Coding and Complexity.- Compression of Pictures by Finite State Encoders.- Lossy On-Line Dynamic Data Compression.- A Comparison of Text Compression Algorithms.- Compression, Tests for Randomness and Estimating the Statistical Model of an Individual Sequence.- Security.- Removing Interaction from Zero-Knowledge Proofs.- Protecting Against Abuses of Cryptosystems in Particular in the Context of Verification of Peace Treaties.- The Information Dispersal Algorithm and Its Applications.- Three Types of Perfection in Shannon-Theoretic Cryptography.- Transmission.- Codes for Certain Sofic Systems.- Simple Combinatorial Decoding of the [23,12,7] Golay Code.- Flag Encodings Related to the Zeckendorf Representation of Integers.- Immutable Codes.- Unison in Distributed Networks.- Sequence Transmission: Coding in the Frequency Domain.- On the Maximality of the Group Theoretic Single Error Correcting and All Unidirectional Error Detecting (SEC-AUED) Codes.- Coding Sequences with Constraints.- Robust Error Control Sequences for Efficient Software Implementation.- Author Index.