Auspicious Tatami mat arrangements
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Theoretical Computer Science
Bitwise operations for GPU implementation of genetic algorithms
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
πDD: a new decision diagram for efficient problem solving in permutation space
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Enforcing confidentiality and data visibility constraints: an OBDD approach
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
SIAM Journal on Scientific Computing
Generation of polyiamonds for p6 tiling by the reverse search
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
A declarative specification of tree-based symbolic arithmetic computations
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
Towards certain fixes with editing rules and master data
The VLDB Journal — The International Journal on Very Large Data Bases
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Journal of Discrete Algorithms
Counterexamples to the long-standing conjecture on the complexity of BDD binary operations
Information Processing Letters
Incremental set recommendation based on class differences
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Efficient enumeration of the directed binary perfect phylogenies from incomplete data
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Symbolic modeling of a universal reconfigurable logic gate and its applications to circuit synthesis
Proceedings of the 2012 ACM Research in Applied Computation Symposium
Knowledge capture from multiple online sources with the extensible web retrieval toolkit (eWRT)
Proceedings of the seventh international conference on Knowledge capture
Approximating the permanent with fractional belief propagation
The Journal of Machine Learning Research
An OBDD approach to enforce confidentiality and visibility constraints in data publishing
Journal of Computer Security - DBSec 2011
| Hi-index | 0.00 |
This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuths writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his cookbook solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.Volume 4, Fascicle 1 This fascicle, enlivened by a wealth of Knuths typically enjoyable examples, describes basic broadword operations and an important class of data structures that can make computer programs run dozenseven thousandsof times faster. The author brings together and explains a substantial amount of previously scattered but eminently practical information known only to a few specialists. The book also includes nearly five-hundred exercises for self-study, with detailed answers given in nearly every case; dozens of these exercises present original material that has never before been published. Simply put, this fascicle is a must-have for anybody who is faced with tough problems of a combinatorial flavor. It demonstrates how ordinary programmers can make use of powerful techniques that heretofore seemed to be available only to people who used specialized languages and software. It shows how ideas once thought to be far out are now ready to become a part of the programming mainstream.