Wojciech Rytter – författare
Visar alla böcker från författaren Wojciech Rytter. Handla med fri frakt och snabb leverans.
13 produkter
Fast Parallel Algorithms for Graph Matching Problems
Combinatorial, Algebraic, and Probabilistic Approach
Av Marek Karpinski, Wojciech Rytter
Inbunden, 1998
2902 kr
Lägg i varukorg
The matching problem is one of the central problems in graph theory as well as in the theory of algorithms and their applications. This book will provide the reader with a comprehensive and straightforward introduction to the basic methods of designing efficient parallel algorithms for graph …
Efficient Parallel Algorithms
Av Alan Gibbons, Wojciech Rytter
Häftad, 1989
655 kr
Lägg i varukorg
This is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelisation. It is self-contained and presumes no special knowledge of parallel computers or particular mathematics. The book emphasises designing algorithms within the timeless and …
200 Problems on Languages, Automata, and Computation
Av Filip Murlak, Damian Niwiński m. fl.
Häftad, 2023
569 kr
Lägg i varukorg
Formal languages and automata have long been fundamental to theoretical computer science, but students often struggle to understand these concepts in the abstract. This book provides a rich source of compelling exercises designed to help students grasp the subject intuitively through practice. The …
200 Problems on Languages, Automata, and Computation
Av Wojciech Rytter, Damian Niwinski m. fl.
E-bok, 2023
537 kr
Lägg i varukorg
125 Problems in Text Algorithms
with Solutions
Av Maxime Crochemore, Thierry Lecroq m. fl.
Häftad, 2021
687 kr
Lägg i varukorg
String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises …
125 Problems in Text Algorithms
with Solutions
Av Maxime Crochemore, Thierry Lecroq m. fl.
Inbunden, 2021
1416 kr
Lägg i varukorg
String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises …
125 Problems in Text Algorithms
with Solutions
Av Wojciech Rytter, Thierry Lecroq m. fl.
E-bok, 2021
657 kr
Lägg i varukorg
String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises …
125 Problems in Text Algorithms
with Solutions
Av Wojciech Rytter, Thierry Lecroq m. fl.
E-bok, 2021
657 kr
Lägg i varukorg
String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises …
200 Problems on Languages, Automata, and Computation
Av Filip Murlak, Damian Niwiński m. fl.
Inbunden, 2023
1280 kr
Lägg i varukorg
Formal languages and automata have long been fundamental to theoretical computer science, but students often struggle to understand these concepts in the abstract. This book provides a rich source of compelling exercises designed to help students grasp the subject intuitively through practice. The …
Mathematical Foundations of Computer Science 2002
27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002. Proceedings
Av Krzystof Diks, Wojciech Rytter
Häftad, 2002
1131 kr
Lägg i varukorg
This book constitutes the refereed proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002, held in Warsaw, Poland in August 2002.The 48 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 108 …
Mathematical Foundations of Computer Science 2002
27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002. Proceedings
Av Wojciech Rytter, Krzystof Diks
E-bok, 2007
1427 kr
Lägg i varukorg
This book constitutes the refereed proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002, held in Warsaw, Poland in August 2002. The 48 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 108 …
JEWELS OF STRINGOLOGY: TEXT ALGORITHMS
Av Maxime Crochemore, Wojciech Rytter
Inbunden, 2002
1737 kr
Lägg i varukorg
The term “stringology” is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as “algorithmic jewels” and deserve reader-friendly presentation. One of the main aims of the book is to present several …
JEWELS OF STRINGOLOGY: TEXT ALGORITHMS
Av Maxime Crochemore, Wojciech Rytter
Häftad, 2002
895 kr
Lägg i varukorg
The term “stringology” is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as “algorithmic jewels” and deserve reader-friendly presentation. One of the main aims of the book is to present several …
