A Decomposition Approach for Balancing Large-Scale Acyclic Data Flow Graphs
IEEE Transactions on Computers
A new placement level wirability estimate with measurements
ACM SIGDA Newsletter
Efficient implementation of bit-vector operation in Common Lisp
ACM SIGPLAN Lisp Pointers
Speeding up the “Puzzle” Benchmark a “bit”
ACM SIGPLAN Lisp Pointers
ACM SIGPLAN Notices
A new sort algorithm: self-indexed sort
ACM SIGPLAN Notices
ACM SIGACT News
A stabilizing algorithm for finding biconnected components
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A framework for teaching recursion
ACM SIGCSE Bulletin
Information Sciences: an International Journal
Text classification based on multi-word with support vector machine
Knowledge-Based Systems
The recursive network-based routing algorithm
SEPADS'10 Proceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems
CIS'04 Proceedings of the First international conference on Computational and Information Science
A parallel routing algorithm on circulant networks employing the hamiltonian circuit latin square
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
A parallel routing algorithm on 2-circulant networks employing the hamiltonian circuit latin square
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
A parallel routing algorithm on circulant networks employing the Hamiltonian circuit latin square
Information Sciences: an International Journal
Hi-index | 0.00 |
From the Publisher:This edition features an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms, along with the addition of new topics and exercises. It continues the tradition of solid mathematical analysis and clear writing style: emphasizes the development of algorithms through a step-by-step process rather than by merely presenting the end result; stresses the importance of the algorithm analysis process - continuously re-evaluating, modifying, and perhaps rejecting algorithms until a satisfactory solution is attained; provides extensive treatment of recursion with a clear, student-friendly review of how it works and why it is a valuable programming technique; uses a Java-like pseudocode; and includes an appendix with java examples.