Using simulation across the curriculum
CCSC '00 Proceedings of the fourteenth annual consortium on Small Colleges Southeastern conference
Alternatives to two classic data structures
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Object-oriented algorithm analysis and design with Java
Science of Computer Programming - Special issue on principles and practice of programming in java (PPPJ 2003)
Problem solving and student performance in data structures and algorithms
Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education
DySy: dynamic symbolic execution for invariant inference
Proceedings of the 30th international conference on Software engineering
Experience the ways in which ProofBuilder helps students construct proofs: tutorial presentation
Journal of Computing Sciences in Colleges
Experience the ways in which ProofBuilder helps students construct proofs: tutorial presentation
Journal of Computing Sciences in Colleges
A Fast and Simple Heuristic for Metro Map Path Simplification
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
A Design of Automatic Visualizations for Divide-and-Conquer Algorithms
Electronic Notes in Theoretical Computer Science (ENTCS)
Using Bloom's taxonomy to code verbal protocols of students solving a data structure problem
Proceedings of the 47th Annual Southeast Regional Conference
An effective algorithm to find elementary siphons in a class of Petri nets
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Fast node overlap removal: correction
GD'06 Proceedings of the 14th international conference on Graph drawing
Recursive n-gram hashing is pairwise independent, at best
Computer Speech and Language
A game theoretic trust model for on-line distributed evolution of cooperation inMANETs
Journal of Network and Computer Applications
GD'05 Proceedings of the 13th international conference on Graph Drawing
Eclat: automatic generation and classification of test inputs
ECOOP'05 Proceedings of the 19th European conference on Object-Oriented Programming
Abstraction refinement with craig interpolation and symbolic pushdown systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Reducing the barriers to writing verified specifications
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Towards a lazier symbolic pathfinder
ACM SIGSOFT Software Engineering Notes
Hi-index | 0.00 |
From the Publisher:Mark Allen Weiss provides a proven approach to algorithms and data structures using the exciting Java programming language as the implementation tool. With Java he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes this text with a logical organization of topics, his engaging writing style, and an extensive use of figures and examples showing the successive stages of an algorithm. Features:Contains extensive sample code using Java 1.2, which is available over the Internet.Covers the Java Collections Library in an appendix.Includes a chapter on algorithm and design techniques that covers greedy algorithms, divide-and-conquer algorithms, dynamic programming, randomized algorithms, and backtracking.Presents current topics and new data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees.Offers a chapter on amortized analysis that examines the advanced data structures presented earlier in the book.Provides a chapter on advanced data structures and their implementation, covering red-black trees, top-down splay trees, treaps, k-d trees, pairing heaps, and more.