|
|
Sold Out
Book Categories |
| Symbolic Systems Biology | 1 | |
| Confluence as a Cut Elimination Property | 2 | |
| Associative-Commutative Rewriting on Large Terms | 14 | |
| A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms | 30 | |
| Efficient Reductions with Director Strings | 46 | |
| Rewriting Logic and Probabilities | 61 | |
| The Maude 2.0 System | 76 | |
| Diagrams for Meaning Preservation | 88 | |
| Expression Reduction Systems with Patterns | 107 | |
| Residuals in Higher-Order Rewriting | 123 | |
| Rewriting UNITY | 138 | |
| New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols | 148 | |
| An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation | 165 | |
| Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties | 180 | |
| Rule-Based Analysis of Dimensional Safety | 197 | |
| Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems | 208 | |
| On the Complexity of Higher-Order Matching in the Linear [lambda]-Calculus | 234 | |
| XML Schema, Tree Logic and Sheaves Automata | 246 | |
| Size-Change Termination for Term Rewriting | 264 | |
| Monotonic AC-Compatible Semantic Path Orderings | 279 | |
| Relating Deviation Lengths with the Slow-Growing Hierarchy Directly | 296 | |
| Tsukuba Termination Tool | 311 | |
| Liveness in Rewriting | 321 | |
| Validation of the JavaCard Platform with Implicit Induction Techniques | 337 | |
| "Term Partition" for Mathematical Induction | 352 | |
| Equational Prover of Theorema | 367 | |
| Termination of Simply Typed Term Rewriting by Translation and Labelling | 380 | |
| Rewriting Modulo in Deduction Modulo | 395 | |
| Termination of String Rewriting Rules That Have One Pair of Overlaps | 410 | |
| Environments for Term Rewriting Engines for Free! | 424 | |
| A Logical Algorithm for ML Type Inference | 436 | |
| A Rewriting Alternative to Reidemeister-Schreier | 452 | |
| Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication) | 467 | |
| Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism | 483 | |
| Testing Extended Regular Language Membership Incrementally by Rewriting | 499 | |
| Author Index | 515 |
| Price | Condition | Delivery | Seller | Action |
| $107.90 | Digital |
| WonderClub |
David Gookin
reviewed Rewriting Techniques and Applications on January 28, 2014
Rewriting Techniques and Applications
In comparison to "Introduction to Algorithms" (the other algorithm book I had significant exposure to) this one is faster to read, easier to digest and more tailored towards applications.
I found the "Hitchhiker's Guide to Algorithms" in the back to be extremely useful if you really find yourself tackling an algorithmic problem in practice.
The main part (maybe skipping/skimming down a few chapters) is a very good preparation for algorithm-heavy job interviews (e.g. Google, Facebook etc ...).
Very much recommended.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Rewriting Techniques and Applications
X
This Item is in Your Inventory
Rewriting Techniques and Applications
X
You must be logged in to review the productsX
X
X
Add Rewriting Techniques and Applications, The refereed proceedings of the 14th International Conference on Rewriting Techniques and Applications, RTA 2003, held in Valencia, Spain in June 2003. The 26 revised regular papers and 6 system descriptions presented together with 3 invited contributi, Rewriting Techniques and Applications to the inventory that you are selling on WonderClubX
X
Add Rewriting Techniques and Applications, The refereed proceedings of the 14th International Conference on Rewriting Techniques and Applications, RTA 2003, held in Valencia, Spain in June 2003. The 26 revised regular papers and 6 system descriptions presented together with 3 invited contributi, Rewriting Techniques and Applications to your collection on WonderClub |