 |
|
|
|
 |  |  The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern MatchingThe Burrows-Wheeler Transform is a text transformation scheme that has found applications in different aspects of the data explosion problem, from data compression to index structures and search. The BWT belongs to a new class of compression algorithms, distinguished by its ability to perform compression by sorted contexts. More recently, the BWT... |  |  |
|
 Classical and New Paradigms of Computation and their Complexity HierarchiesThe notion of complexity is an important contribution of logic to theoretical computer science and mathematics. This volume attempts to approach complexity in a holistic way, investigating mathematical properties of complexity hierarchies at the same time as discussing algorithms and computational properties. A main focus of the volume is on some... |  |  |  |  |
|
| Result Page: 402 401 400 399 398 397 396 395 394 393 392 391 390 389 388 387 386 385 384 |