close
1.

図書

図書
Bruno R. Preiss
出版情報: New York : John Wiley & Sons, 1999  xvii, 635 p. ; 25 cm
所蔵情報: loading…
目次情報: 続きを見る
Algorithm Analysis
Asymptotic Notation
Foundational Data Structures
Data Types and Abstraction
Stacks, Queues, and Deques
Ordered Lists and Sorted Lists
Hashing, Hash Tables, and Scatter Tables
Trees
Search Trees
Heaps and Priority Queues
Sets, Multisets, and Partitions
Garbage Collection
Algorithmic Patterns and Problem Solvers
Sorting Algorithms and Sorters
Graphs and Graph Algorithms
Appendices
Bibliography
Index
Algorithm Analysis
Asymptotic Notation
Foundational Data Structures
2.

図書

図書
Chris Okasaki
出版情報: Cambridge, U.K. : Cambridge University Press, 1999, c1998  x, 220 p. ; 23 cm
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1:
Persistence / 2:
Some familiar data structures in a functional setting / 3:
Lazy evaluation / 4:
Fundamentals of amortization / 5:
Amortization and persistence via lazy evaluation / 6:
Eliminating amortization / 7:
Lazy rebuilding / 8:
Numerical representations / 9:
Data-structural bootstrapping / 10:
Implicit recursive slowdown / 11:
Appendix: Haskell source code
Introduction / 1:
Persistence / 2:
Some familiar data structures in a functional setting / 3:
3.

図書

図書
Rudolf Fleischer, Bernard Moret, Erik Meineche Schmidt (eds.)
出版情報: Berlin ; Tokyo : Springer, c2002  xvii, 278 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2547
所蔵情報: loading…
目次情報: 続きを見る
Algorithm Engineering for Parallel Computation / David A. Bader ; Bernard M. E. Moret ; Peter Sanders1:
Introduction / 1.1:
General Issues / 1.2:
Speedup / 1.3:
Why Speed? / 1.3.1:
What is Speed? / 1.3.2:
Speedup Anomalies / 1.3.3:
Reliable Measurements / 1.4:
Test Instances / 1.5:
Presenting Results / 1.6:
Machine-Independent Measurements? / 1.7:
High-Performance Algorithm Engineering for Shared-Memory Processors / 1.8:
Algorithms for SMPs / 1.8.1:
Leveraging PRAM Algorithms for SMPs / 1.8.2:
Conclusions / 1.9:
References
Examples of Algorithm Engineering for Parallel Computation / 1.A:
Visualization in Algorithm Engineering: Tools and Techniques / Camil Demetrescu ; Irene Finocchi ; Giuseppe F. Italiano ; Stefan Näher2:
Tools for Algorithm Visualization / 2.1:
Interesting Events versus State Mapping / 2.3:
Visualization in Algorithm Engineering / 2.4:
Animation Systems and Heuristics: Max Flow / 2.4.1:
Animation Systems and Debugging: Spring Embedding / 2.4.2:
Animation Systems and Demos: Geometric Algorithms / 2.4.3:
Animation Systems and Fast Prototyping / 2.4.4:
Conclusions and Further Directions / 2.5:
Parameterized Complexity: The Main Ideas and Connections to Practical Computing / Michael R. Fellows3:
Parameterized Complexity in a Nutshell / 3.1:
Empirical Motivation: Two Forms of Fixed-Parameter Complexity / 3.2.1:
The Halting Problem: A Central Reference Point / 3.2.2:
Connections to Practical Computing and Heuristics / 3.3:
A Critical Tool for Evaluating Approximation Algorithms / 3.4:
The Extremal Connection: A General Method Relating FPT, Polynomial-Time Approximation, and Pre-Processing Based Heuristics / 3.5:
A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation / Richard E. Ladner ; Ray Fortna ; Bao-Hoang Nguyen4:
Organization / 4.1:
Cache Aware Search / 4.3:
Cache Oblivious Search / 4.4:
Program Instrumentation / 4.5:
Experimental Results / 4.6:
Conclusion / 4.7:
Using Finite Experiments to Study Asymptotic Performance / Catherine McGeoch ; Rudolf Fleischer ; Paul R. Cohen ; Doina Precup5:
Difficulties with Experimentation / 5.1:
Promising Examples / 5.3:
Theory with Simplifications: Writing to Parallel Disks / 5.3.1:
"Heuristic" Deduction: Random Polling / 5.3.2:
Shellsort / 5.3.3:
Sharpening a Theory: Randomized Balanced Allocation / 5.3.4:
Empirical Curve Bounding Rules / 5.4:
Guess Ratio / 5.4.1:
Guess Difference / 5.4.2:
The Power Rule / 5.4.3:
The BoxCox Rule / 5.4.4:
The Difference Rule / 5.4.5:
Two Negative Results / 5.4.6:
Parameterized Functions / 5.5:
Algorithmic Data Sets / 5.5.2:
A Hybrid Iterative Refinement Method / 5.6:
Remark / 5.6.1:
Discussion / 5.7:
WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms / Christoph Meinel ; Harald Sack ; Arno Wagner6:
WWW Portal Sites for Research Communities / 6.1:
Binary Decision Diagrams / 6.1.2:
A Benchmarking Platform for BDDs / 6.2:
To Publish Code is not Optimal / 6.2.1:
What is Really Needed / 6.2.2:
A Web-Based Testbed / 6.3:
The WWW Interface / 6.3.1:
Implementation / 6.3.2:
Available BDD Tools / 6.3.3:
Added Value: A BDD Portal Site / 6.4:
Structure of a Conventional Portal / 6.4.1:
Shortcomings of Conventional Portals / 6.4.2:
The BDD Portal / 6.4.3:
Online Operation Experiences / 6.5:
Related Work / 6.6:
Algorithms and Heuristics in VLSI Design / Christian Stangier7:
Preliminaries / 7.1:
OBDDs - Ordered Binary Decision Diagrams / 7.2.1:
Operations on OBDDs / 7.2.2:
Influence of the Variable Order on the OBDD Size / 7.2.3:
Reachability Analysis / 7.2.4:
Image Computation Using AndExist / 7.2.5:
Heuristics for Optimizing OBDD-Size - Variable Reordering / 7.3:
Sample Reordering Method / 7.3.1:
Speeding up Symbolic Model Checking with Sample Sifting / 7.3.2:
Experiments / 7.3.3:
Heuristics for Optimizing OBDD Applications - Partitioned Transition Relations / 7.4:
Common Partitioning Strategy / 7.4.1:
RTL Based Partitioning Heuristic / 7.4.2:
Reconstructing Optimal Phylogenetic Trees: A Challengein Experimental Algorithmics / Tandy Warnow7.4.3:
Data for Phylogeny Reconstruction / 8.1:
Phylogenetic Reconstruction Methods / 8.2.1:
Algorithmic and Experimental Challenges / 8.3:
Designing for Speed / 8.3.1:
Designing for Accuracy / 8.3.2:
Performance Evaluation / 8.3.3:
An Algorithm Engineering Example: Solving the Breakpoint Phylogeny / 8.4:
Breakpoint Analysis: Details / 8.4.1:
Re-Engineering BPAnalysis for Speed / 8.4.2:
A Partial Assessment / 8.4.3:
An Experimental Algorithmics Example: Quartet-Based Methods for DNA Data / 8.5:
Quartet-Based Methods / 8.5.1:
Experimental Design / 8.5.2:
Some Experimental Results / 8.5.3:
Observations and Conclusions / 8.6:
Presenting Data from Experiments in Algorithmics / 9:
The Process / 9.1:
Tables / 9.3:
Two-Dimensional Figures / 9.4:
The x Axis / 9.4.1:
The y Axis / 9.4.2:
Arranging Multiple Curves / 9.4.3:
Arranging Instances / 9.4.4:
How to Connect Measurements / 9.4.5:
Measurement Errors / 9.4.6:
Grids and Ticks / 9.5:
Three-Dimensional Figures / 9.6:
The Caption / 9.7:
A Check List / 9.8:
Distributed Algorithm Engineering / Paul G. Spirakis ; Christos D. Zaroliagis10:
The Need of a Simulation Environment / 10.1:
An Overview of Existing Simulation Environments / 10.2.1:
Asynchrony in Distributed Experiments / 10.3:
Difficult Input Instances for Distributed Experiments / 10.4:
The Adversarial-Based Approach / 10.4.1:
The Game-Theoretic Approach / 10.4.2:
Mobile Computing / 10.5:
Models of Mobile Computing / 10.5.1:
Basic Protocols in the Fixed Backbone Model / 10.5.2:
Basic Protocols in the Ad-Hoc Model / 10.5.3:
Modeling Attacks in Networks: A Useful Interplay between Theory and Practice / 10.6:
Implementations and Experimental Studies of Dynamic Graph Algorithms / 10.7:
Dynamic Algorithms for Undirected Graphs / 11.1:
Dynamic Connectivity / 11.2.1:
Dynamic Minimum Spanning Tree / 11.2.2:
Dynamic Algorithms for Directed Graphs / 11.3:
Dynamic Transitive Closure / 11.3.1:
Dynamic Shortest Paths / 11.3.2:
A Software Library for Dynamic Graph Algorithms / 11.4:
Author Index / 11.5:
Algorithm Engineering for Parallel Computation / David A. Bader ; Bernard M. E. Moret ; Peter Sanders1:
Introduction / 1.1:
General Issues / 1.2:
4.

図書

図書
Christopher J. Van Wyk
出版情報: Reading, Mass. : Addison-Wesley, 1988  x, 387 p. ; 24 cm
所蔵情報: loading…
5.

図書

図書
Ivan Flores
出版情報: Englewood Cliffs, N.J. : Prentice-Hall, c1970  x, 390 p. ; 24 cm
所蔵情報: loading…
6.

図書

図書
by Fran Goertzel Gustavson
出版情報: Ann Arbor, Mich. : UMI Research Press, c1982  xii, 140 p. ; 24 cm
シリーズ名: Computer science ; Systems programming ; no. 11
所蔵情報: loading…
7.

図書

図書
Iain T. Adamson
出版情報: London : Springer, c1996  xi, 419 p. ; 24 cm
所蔵情報: loading…
8.

図書

図書
Leendert Ammeraal
出版情報: Chichester ; New York : Wiley, 1996  x, 352 p. ; 24 cm
所蔵情報: loading…
目次情報: 続きを見る
Some Aspects of Programming in C++
Arithmetic
Sorting Arrays and Files
Stacks, Queues and Lists
Searching and String Processing
Binary Trees
B-trees
Tries, Priority Queues and File Compression
Graphs
Some Combinatorial Algorithms
Fundamentals of Interpreters and Compilers
Appendix
Bibliography
Index
Some Aspects of Programming in C++
Arithmetic
Sorting Arrays and Files
9.

図書

図書
[by] Peter C. Brillinger [and] Doron J. Cohen
出版情報: Englewood Cliffs, N.J. : Prentice-Hall, c1972  629 p. ; 24 cm
シリーズ名: Prentice-Hall series in automatic computation
所蔵情報: loading…
10.

図書

図書
Teodor Rus
出版情報: București : Editura Academiei , Chichester : John Wiley & Sons, 1979  xi, 364 p. ; 25 cm
シリーズ名: Wiley series in computing
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼