SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
ACM SIGACT News
Static and dynamic partitioning of pointers as links and threads
Proceedings of the first ACM SIGPLAN international conference on Functional programming
ACM Computing Surveys (CSUR)
IEEE/ACM Transactions on Networking (TON)
One-bit counts between unique and sticky
Proceedings of the 1st international symposium on Memory management
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Problems in comprehending recursion and suggested solutions
Proceedings of the 6th annual conference on Innovation and technology in computer science education
DORA: Efficient Routing for MPLS Traffic Engineering
Journal of Network and Systems Management
Mitra: A Scalable Continuous Media Server
Multimedia Tools and Applications
A simulation-based method for the verification of shared memory in multiprocessor systems
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Effective Temporal Aggregation Using Point-Based Trees
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
P-tree structures and event horizon: efficient event-set implementations
WSC '05 Proceedings of the 37th conference on Winter simulation
Journal of Network and Systems Management
Network-aware scheduling for real-time execution support in data-intensive optical Grids
Future Generation Computer Systems
Algorithms and theory of computation handbook
Constrained minimum lightpath affinity routing in multi-layer optical transport networks
Journal of High Speed Networks
Model matching for trace link generation in model-driven software development
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
| Hi-index | 0.00 |
From the Publisher:structures (and their algorithms) that comprise the foundation of software engineering. Designed to show students at the sophomore level the connection between a programming approach and mathematical theory, the text focuses on practical techniques for students to master data structures and efficient algorithm implementation. Other topics pertinent to programmers also receive coverage. Chapter-ending problems and references give students a helpful review and solidify chapter concepts.