Finding large 3-free sets I: The small n case
Journal of Computer and System Sciences
Cache-aware optimization of BAN applications
CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
What the parallel-processing community has (failed) to offer the multi/many-core generation
Journal of Parallel and Distributed Computing
Vehicle localization by matching triangulated point patterns
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
An ordinal optimization theory-based algorithm for large distributed power systems
Computers & Mathematics with Applications
Saving space by algebraization
Proceedings of the forty-second ACM symposium on Theory of computing
A multi-objective approach for throughput optimization and traffic engineering in WDM networks
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Optimal Task Migration in Service-Oriented Systems: Algorithms and Mechanisms
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Optimizations generating Armstrong numbers
ACM Inroads
Orthogonal signaling-based queue status investigation method in IEEE 802.11
Computer Communications
Modelling human preference in evolutionary art
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
On the complexity of core, kernel, and bargaining set
Artificial Intelligence
Computing maximal Kleene closures that are embeddable in a given constrained DNA language
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
A family of skeletons for motion planning and geometric reasoning applications
Artificial Intelligence for Engineering Design, Analysis and Manufacturing - Representing and Reasoning About Three-Dimensional Space
Non-rigid shape matching using geometry and photometry
ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part III
Metaphors and analogies for teaching algorithms
Proceedings of the 43rd ACM technical symposium on Computer Science Education
Certain conjunctive query answering in first-order logic
ACM Transactions on Database Systems (TODS)
Computer Science Review
Iterative approximate byzantine consensus in arbitrary directed graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Minimum convex partitions and maximum empty polytopes
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Protecting location privacy: optimal strategy against localization attacks
Proceedings of the 2012 ACM conference on Computer and communications security
Using XQuery for problem solving
Software—Practice & Experience
A derivation-first approach to teaching algorithms
Proceeding of the 44th ACM technical symposium on Computer science education
MaxMax: a graph-based soft clustering algorithm applied to word sense induction
CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
Computing maximal Kleene closures that are embeddable in a given subword-closed language
Natural Computing: an international journal
Toward incremental computation of argumentation semantics: A decomposition-based approach
Annals of Mathematics and Artificial Intelligence
Proceedings of the 13th Koli Calling International Conference on Computing Education Research
Three generalizations of the FOCUS constraint
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
What makes big-O analysis difficult: understanding how students understand runtime analysis
Journal of Computing Sciences in Colleges
| Hi-index | 0.00 |
This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center. "Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read." Tim Roughgarden Stanford University Table of contents0 Prologue1 Algorithms with Numbers2 Divide-and-Conquer Algorithms3 Decompositions of Graphs4 Paths in Graphs5 Greedy algorithms6 Dynamic Programming7 Linear Programming and Reductions8 NP-complete Problems9 Coping with NP-completeness10 Quantum Algorithms