close
1.

図書
図書
1. Data structures and PL/I programming
Moshe Augenstein, Aaron Tenenbaum
出版情報: Englewood Cliffs, N.J. : Prentice-Hall, c1979  xi, 643 p. ; 25 cm
所蔵情報: loading…
2.

図書
図書
2. Data structures : theory and practice
[by] A.T. Berztiss
出版情報: New York : Academic Press, c1971  xiii, 442 p. ; 24 cm
シリーズ名: Computer science and applied mathematics
所蔵情報: loading…
3.

図書
図書
3. Data structures : theory and practice. 2nd ed
A. T. Berztiss
出版情報: New York : Academic Press, c1975  xv, 586 p. ; 24 cm
シリーズ名: Computer science and applied mathematics : a series of monographs and textbooks
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgments
Discrete Structures in Mathematics / Part I：
Set Theory / Chapter 1.：
Basic Definitions / 1a.：
Indexed Sets / 1b.：
Complement of a Set / 1c.：
Algebra of Sets / 1d.：
Algebra of Sets as an Axiomatic Theory / 1e.：
Venn Diagrams / 1f.：
The Ordered Pair and Related Concepts / 1g.：
Permutations and Combinations / 1h.：
Notes
Exercises
Functions and Relations / Chapter 2.：
Functions / 2a.：
Boolean Functions and Forms / 2b.：
Applications of Boolean Functions / 2c.：
Relations / 2d.：
The Equivalence Relation / 2e.：
Ordering Relations / 2f.：
Lattices / 2g.：
Abstract Algebras / 2h.：
Graph Theory / Chapter 3.：
Diagrams and Graphs / 3a.：
Basic Definitions in the Theory of Digraphs / 3b.：
Digraphs, Matrices, and Relations / 3c.：
Connectedness in a Digraph / 3d.：
Trees / 3e.：
Linear Formulas of Digraphs / 3f.：
Isomorphism of Digraphs / 3g.：
Planar Graphs / 3h.：
Algebras and Strings / Chapter 4.：
Algebraic Structures / 4a.：
Group Codes / 4b.：
Algebra of Strings / 4c.：
Markov Algorithms / 4d.：
Languages and Grammars / 4e.：
Languages and Automata / 4f.：
Applications of Structures / Part II：
Trees as Grammatic Markers / Chapter 5.：
Pushdown Stores / 5b.：
Traversal of B-Trees / 5c.：
Subtree Isomorphism / 5d.：
Prefix, Postfix, and Infix Formulas / 5e.：
Sort Trees and Dictionaries / 5f.：
Decision Trees and Decision Tables / 5g.：
Paths and Cycles in Digraphs / Chapter 6：
Shortest Path Problems / 6a.：
Cycles / 6b.：
A Scheduling Problem / 6c.：
Critical Path Scheduling / 6d.：
Digraphs of Programs / Chapter 7.：
Flowchart Digraphs / 7a.：
Detection of Programming Errors / 7b.：
Segmentation of Programs / 7c.：
Automatic Flowcharting / 7d.：
Other Applications of Graphs / Chapter 8.：
Flow Problems / 8a.：
Graphs in Chemistry / 8b.：
Graphs in Information Retrieval / 8c.：
Computer Representation of Structures / Part III：
Arrays / Chapter 9.：
Storage Media and Their Properties / 9a.：
Storage of Arrays / 9b.：
Sparse Matrices / 9c.：
Storage Allocation at Execution Time / 9d.：
Lists and List Structures / Chapter 10.：
Lists--Introductory Concepts / 10a.：
Sparse Matrices and Cross-Lists / 10b.：
Formats of List Elements / 10c.：
List Structures / 10d.：
Threaded and Symmetric Lists / 10e.：
Representation of Digraphs as List Structures / 10f.：
Variable Length List Elements / 10g.：
Management of List Stores / 10h.：
PL/1-Type Data Structures / 10i.：
Organization of Files / Chapter 11.：
Records and Files / 11a.：
Indexed Files / 11b.：
Scatter Storage Techniques / 11c.：
Sorting / 11d.：
Magnetic Tape Files / 11e.：
Tape Sorting / 11f.：
Files and Disks / 11g.：
Application Studies / Chapter 12.：
Precedence Grammars / 12a.：
Radix Sorting / 12b.：
Symbolic Differentiation / 12c.：
K-Trees and Cycles / 12d.：
Scheduling Networks / 12e.：
Solutions to Selected Exercises
Bibliography
Index
Preface
Acknowledgments
Discrete Structures in Mathematics / Part I：
4.

図書
図書
4. The design of dynamic data structures (: gw ; : us)
Mark H. Overmars
出版情報: Berlin ; Tokyo : Springer-Verlag, 1983  vii, 181 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 156
所蔵情報: loading…
目次情報: 続きを見る
Introduction
A Catalog of (Multi-Dimensional) Searching Problems
Local Rebuilding (Balancing)
Partial Rebuilding
Global Rebuilding
Order Decomposable Set Problems
Decomposable Searching Problems
Batched Dynamization
Searching in the Past
Final Comments and Open Problems
References.
Introduction
A Catalog of (Multi-Dimensional) Searching Problems
Local Rebuilding (Balancing)
5.

図書
図書
5. Algorithms+data structures=programs
Niklaus Wirth
出版情報: Englewood Cliffs, N.J. : Prentice-Hall, c1976  xvii, 366 p. ; 24 cm
シリーズ名: Prentice-Hall series in automatic computation
所蔵情報: loading…
6.

図書
図書
6. Data structures and C programs
Christopher J. Van Wyk
出版情報: Reading, Mass. : Addison-Wesley, 1988  x, 387 p. ; 24 cm
所蔵情報: loading…
7.

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

図書
図書
8. Data structure and algorithms with object-oriented design patterns in Java
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
9.

図書
図書
9. Adaptive processing of sequences and data structures : International Summer School on Neural Networks "E.R. Caianiello", Vietri sul Mare, Salerno, Italy, September 6-13, 1997, tutorial lectures
C. Lee Giles, Marco Gori, eds
出版情報: Berlin ; New York : Springer, c1998  xii, 434 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1387 . Lecture notes in artificial intelligence
所蔵情報: loading…
10.

図書
図書
10. Data mining and reverse engineering : searching for semantics : IFIP TC2 WG2.6 IFIP Seventh Conference on Database Semantics (DS-7), 7-10 October 1997, Leysin, Switzerland
edited by Stefano Spaccapietra and Fred Maryanski
出版情報: London : Chapman & Hall, c1998  xvi, 497 p. ; 24cm
所蔵情報: loading…
11.

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

図書
図書
12. Algorithms and data structures in C++
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
13.

図書
図書
13. Genetic algorithms + data structures = evolution programs. 3rd, rev. and extended ed (: hardcover ; : [pbk.])
Zbigniew Michalewicz
出版情報: Berlin ; New York : Springer-Verlag, 1996  xx, 387 p. ; 25 cm
所蔵情報: loading…
14.

図書
図書
14. Data models : a semantic approach for database systems
Sheldon A. Borkin
出版情報: Cambridge, Mass. : MIT Press, 1980  269 p. ; 24 cm
シリーズ名: MIT Press series in computer science ; 4
所蔵情報: loading…
15.

図書
図書
15. Data structures and operating systems
Teodor Rus
出版情報: București : Editura Academiei , Chichester : John Wiley & Sons, 1979  xi, 364 p. ; 25 cm
シリーズ名: Wiley series in computing
所蔵情報: loading…
16.

図書
図書
16. Computability theory, semantics, and logic programming
Melvin Fitting
出版情報: New York : Oxford University Press , Oxford : Clarendon Press, 1987  xi, 198 p. ; 25 cm
シリーズ名: Oxford logic guides ; 13
所蔵情報: loading…
目次情報: 続きを見る
A String Manipulation Language / Part 1：
Language Background / 1：
Informalities / 2：
Syntax / 3：
Operational Semantics / 4：
Expanding a Work Space / 5：
Program Verification / 6：
Denotational Semantics / 7：
Background and References / 8：
The Family of EFS Languages / Part 2：
EFS Languages
Numbers
Binary Trees
Sets
A Relational Data Base
Logical Notation
Bounded Quantification
Models and Program Correctness
Procedure Completeness / 9：
Operators / 10：
Introduction
Monotone Operators
The Least Fixed Point Theorem
Approximating to a Least Fixed Point
More on Monotone Operators
Procedures That Accept Input
Procedures as Operators
More on Models
The First Recursion Theorem
A Second Proof / 11：
Applications / 12：
A Normal Form Theorem / 13：
Implementing Data Structures / 14：
Codings
Implementations
Conservative Implementations
Different Sized Alphabets
Numbers and Words
Trees and Words
Sets and Words
Implementability
The Church-Turing Thesis / Part 5：
Register Machines
Computations
Computation States
Translating Register Machines into EFS(str(L))
An Imperative Language IMP
Implementing IMP
Enhancing and Restricting IMP
A Logic-Based Language LOG(L)
EFS and LOG
LOG and IMP
Programming Language Equivalences
Efficiency
Programs as Data / 15：
The Alphabet
Elementary Syntax
Procedure Execution
Introducing Constants
Indexes
Some Positive Results
Complements
The Halting Problem
The Universal Quantifier
The Second Recursion Theorem
Rice's Theorem
A String Manipulation Language / Part 1：
Language Background / 1：
Informalities / 2：
17.

図書
図書
17. Fundamental structures of computer science (hard. ; pbk.)
William A. Wulf ... [et al.]
出版情報: Reading, Mass. : Addison-Wesley, c1981  xviii, 621 p. ; 24 cm
所蔵情報: loading…
18.

図書
図書
18. Data structures using Modula--2
Richard F. Sincovec, Richard S. Wiener
出版情報: New York : Wiley, 1985  xxiii, 500 p. ; 25 cm
所蔵情報: loading…
19.

図書
図書
19. Fundamentals of data structures
Ellis Horowitz, Sartaj Sahni
出版情報: [Woodland Hills, Calif.] : Computer Science Press, c1976  xii, 564 p. ; 24 cm
シリーズ名: Computer software engineering series
所蔵情報: loading…
20.

図書
図書
20. Data structures : an object-oriented approach
William J. Collins
出版情報: Reading, Mass. : Addison-Wesley Pub. Co., c1992  xvii, 624 p. ; 24 cm
所蔵情報: loading…
目次情報:
0201569531B04062001
0201569531B04062001
21.

図書
図書
21. Data structures and algorithm analysis
Mark Allen Weiss
出版情報: Redwood City, Calif. : Benjamin/Cummings Pub. Co., c1992  xvii, 455 p. ; 25 cm
所蔵情報: loading…
22.

図書
図書
22. Data structures and their implementation
Robert J. Baron, Linda G. Shapiro
出版情報: New York : Van Nostrand Reinhold, c1980  x, 469 p. ; 24 cm
シリーズ名: Van Nostrand Reinhold/university computer science series
所蔵情報: loading…
23.

図書
図書
23. Genetic algorithms + data structures = evolution programs (: gw ; : us)
Zbigniew Michalewicz
出版情報: Berlin ; New York : Springer-Verlag, c1992  xiv, 250 p. ; 25 cm
シリーズ名: Artificial intelligence
所蔵情報: loading…
24.

図書
図書
24. Search mechanisms for large files
by Marie-Anne Kamal Neimat
出版情報: Ann Arbor, Mich. : UMI Research Press, c1981  xi, 114 p. ; 24 cm
シリーズ名: Computer science ; Distributed database systems ; no. 11
所蔵情報: loading…
25.

図書
図書
25. Data types and structures
C. C. Gotlieb and L. R. Gotlieb
出版情報: Englewood Cliffs, N. J. : Prentice-Hall, c1978  xii, 444 p. ; 25 cm
所蔵情報: loading…
26.

図書
図書
26. Module specifications and constraints (: us ; : gw)
Ehrig, Hartmut ; Mahr, Bernd
出版情報: Berlin ; Tokyo : Springer-Verlag, c1990  xi, 427 p. ; 24 cm
シリーズ名: EATCS monographs on theoretical computer science ; v. 21 . Fundamentals of algebraic specification / Hartmut Ehrig, Bernd Mahr ; v. 2
所蔵情報: loading…
27.

図書
図書
27. Interactive computer graphics : data structures, algorithms, languages
Wolfgang K. Giloi
出版情報: Englewood Cliffs, N.J. : Prentice-Hall, c1978  xiii, 354 p. ; 24 cm
所蔵情報: loading…
28.

図書
図書
28. Efficient structures for geometric data management (: gw ; : us)
Oliver Günther
出版情報: Berlin ; Tokyo : Springer-Verlag, c1988  xi, 135 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 337
所蔵情報: loading…
29.

図書
図書
29. Computational structures : an introduction to non-numerical computing (: u.s. ; : u.k.)
Patrick A.V. Hall
出版情報: London : Macdonald and Jane's , New York : American Elsevier, 1975  xv, 193 p. ; 23 cm
シリーズ名: Computer monographs ; 23
所蔵情報: loading…
30.

図書
図書
30. Data structures, files and databases (pbk)
Carl Bamford and Paul Curran
出版情報: Basingstoke : Macmillan Education, 1987  viii, 223 p ; 24cm
所蔵情報: loading…
31.

図書
図書
31. The design and analysis of spatial data structures
Hanan Samet
出版情報: Reading, Mass. ; Tokyo : Addison-Wesley, c1990  xvii, 493 p. ; 24 cm
シリーズ名: Addison-Wesley series in computer science
所蔵情報: loading…
32.

図書
図書
32. Algorithms and data structures
Niklaus Wirth
出版情報: Englewood Cliffs, N.J. : Prentice-Hall, c1986  288 p. ; 25 cm
所蔵情報: loading…
33.

図書
図書
33. Data structured program design. [Rev. ed.]
Kirk Hansen
出版情報: Englewood Cliffs, NJ : Prentice-Hall, 1986  xiii, 302 p. ; 25 cm
所蔵情報: loading…
34.

図書
図書
34. Data and reality : basic assumptions in data processing reconsidered
William Kent
出版情報: Amsterdam ; New York : North-Holland Pub. Co. , New York : sole distributors for the U.S.A. and Canada Elsevier/North-Holland, c1978  xv, 211 p. ; 23 cm
所蔵情報: loading…
35.

図書
図書
35. Database design
Gio Wiederhold
出版情報: New York : McGraw-Hill, c1977  xiii, 658 p. ; 24 cm
シリーズ名: McGraw-Hill computer science series
所蔵情報: loading…
36.

図書
図書
36. Live data structures in logic programs : derivation by means of abstract interpretation (: gw ; : us)
Anne Mulkers
出版情報: Berlin ; Tokyo : Springer-Verlag, c1993  viii, 220 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 675
所蔵情報: loading…
37.

図書
図書
37. Experimental algorithmics : from algorithm design to robust and efficient software
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：
38.

図書
図書
38. Data structures and algorithms using Python (: pbk)
Rance D. Necaise
出版情報: Hoboken, N.J. : Wiley, c2011  xviii, 520 p. ; 26 cm
所蔵情報: loading…
目次情報: 続きを見る
Abstract Data Types / Chapter 1：
Introduction / 1.1：
Abstractions / 1.1.1：
Data Structures / 1.1.2：
The Date ADT / 1.2：
Preconditions and Postconditions / 1.2.1：
Using the ADT / 1.2.2：
Implementing the ADT / 1.2.3：
The Bag ADT / 1.3：
Selecting a Data Structure / 1.3.1：
The Class Definition / 1.3.3：
Iterators / 1.4：
The Set ADT / 1.5：
The Map ADT / 1.5.1：
Defining the ADT / 1.6.1：
Implementing the Map ADT / 1.6.2：
Alternate Implementation / 1.6.3：
Application: Histograms / 1.7：
Building a Histogram / 1.7.1：
Implementing the Histogram ADT / 1.7.2：
Programming Problems
Arrays and Vectors / Chapter 2：
The Array Structure / 2.1：
Simulating an Array / 2.1.1：
The Array ADT / 2.1.2：
The Python List (Vector) / 2.1.3：
Multi-Dimensional Arrays / 2.3：
The MultiArray ADT / 2.3.1：
Data Organization / 2.3.2：
Variable Length Arguments / 2.3.3：
MultiArray Implementation / 2.3.4：
The Matrix ADT / 2.4：
Matrix Operations / 2.4.1：
Application: The Game of Life / 2.4.2：
Rules of the Game / 2.5.1：
Designing a Solution / 2.5.2：
ADT Implementation / 2.5.3：
Exercises
Algorithm Analysis / Chapter 3：
Complexity Analysis / 3.1：
Big-O Notation / 3.1.1：
Classes of Algorithms / 3.1.2：
Empirical Analysis / 3.1.3：
Evaluating ADT Implementations / 3.2：
Evaluating the Python List / 3.2.1：
Evaluating the Set ADT / 3.2.2：
Searching / 3.3：
Linear Search / 3.3.1：
Binary Search / 3.3.2：
Working with Ordered Lists / 3.4：
Building An Ordered List / 3.4.1：
Merging Ordered Lists / 3.4.2：
The Set ADT Revisited / 3.5：
Application: The Sparse Matrix / 3.6：
Implementation / 3.6.1：
Analysis / 3.6.2：
The Linked List / Chapter 4：
A Linked Structure / 4.1：
The Singly-Linked List / 4.2：
Basic Operations / 4.2.1：
Evaluating the Linked List / 4.2.2：
The Bag ADT Revisited / 4.3：
Implementation Details / 4.3.1：
Linked List Iterator / 4.3.2：
Using a Tail Pointer / 4.4：
The Ordered Linked List / 4.5：
The Sparse Matrix Revisited / 4.6：
The New Implementation / 4.6.1：
Comparing Implementations / 4.6.2：
Application: Polynomials / 4.7：
Polynomial Operations / 4.7.1：
The Polynomial ADT / 4.7.2：
Advanced Linked Lists / 4.7.3：
Doubly-Linked List / 5.1：
Organization / 5.1.1：
List Operations / 5.1.2：
Circular Linked List / 5.2：
Multi-Linked Lists / 5.2.1：
Multiple Chains / 5.3.1：
The Sparse Matrix / 5.3.2：
Complex Iterators / 5.4：
Application: Text Editor / 5.5：
Typical Editor Operations / 5.5.1：
The Edit Buffer ADT / 5.5.2：
Stacks / 5.5.3：
The Stack ADT / 6.1：
Implementing the Stack / 6.2：
Vector Based / 6.2.1：
Linked List Version / 6.2.2：
Stack Applications / 6.3：
Balanced Delimiters / 6.3.1：
Evaluating Postfix Expressions / 6.3.2：
Application: Solving a Maze / 6.4：
Backtracking / 6.4.1：
The Maze ADT / 6.4.2：
Queues / 6.4.4：
The Queue ADT / 7.1：
Implementing the Queue / 7.2：
Circular Array / 7.2.1：
The Priority Queue / 7.2.3：
Application: Computer Simulations / 7.4：
Airline Ticket Counter / 7.4.1：
Class Specifications / 7.4.2：
Hash Tables / Chapter 8：
Hash Functions / 8.1：
Open Addressing / 8.3：
Linear Probing / 8.3.1：
Collision Resolution / 8.3.2：
Bucket Hashing / 8.4：
Hashing Efficiency / 8.5：
The Map ADT Revisited / 8.6：
Application: The Color Histogram / 8.7：
Recursion / Chapter 9：
Recursive Functions / 9.1：
Properties of Recursion / 9.2：
Classic Example: The Factorial Function / 9.2.1：
Greatest Common Divisor / 9.2.2：
Recursion and Stacks / 9.3：
The Towers of Hanoi / 9.4：
Backtracking Revisited / 9.5：
The Eight-Queens Problem / 9.5.1：
Solving the Four-Queens / 9.5.2：
Recursive Solution / 9.5.3：
Application: Sudoku Puzzles / 9.6：
Binary Trees and Heaps / Chapter 10：
Tree Structure / 10.1：
The Binary Tree / 10.2：
Traversals / 10.2.1：
Arithmetic Expresssions / 10.2.2：
Tree Threading / 10.3：
Heaps / 10.4：
Insertions / 10.4.1：
Removals / 10.4.2：
Evaluating the Heap / 10.4.3：
The Priority Queue Revisited / 10.4.4：
Application: Morse Code / 10.5：
Advanced Search Trees / Chapter 11：
The Binary Search Tree / 11.1：
Deletions / 11.1.1：
Evaluating the BST / 11.1.4：
AVL Trees / 11.2：
Evaluating the AVL Tree / 11.2.1：
2-3 Trees / 11.3：
Splay Trees / 11.4：
Application: Improved Map ADT / 11.5：
Sorting Algorithms / Chapter 12：
The Simple Algorithms / 12.1：
Bubble Sort / 12.1.1：
Selection Sort / 12.1.2：
Insertion Sort / 12.1.3：
Radix Sort / 12.2：
Basic Algorithm / 12.2.1：
Bucket Sorting / 12.2.2：
Divide and Conquer / 12.3：
Merge Sort / 12.3.1：
Quick Sort / 12.3.2：
Heap Sort / 12.4：
Application: Empirical Analysis / 12.5：
Python Review / Appendix A：
Basic Concepts / A.1：
Functions / A.2：
Sequence Types / A.3：
Classes / A.4：
Copying Objects / A.5：
Exceptions / A.6：
Object-Oriented Programming / Appendix B：
Encapsulation / B.1：
Inheritance / B.3：
Polymorphism / B.4：
Abstract Data Types / Chapter 1：
Introduction / 1.1：
Abstractions / 1.1.1：
39.

図書
図書
39. Introduction to algorithms : a creative approach
Udi Manber
出版情報: Reading, Mass. : Addison-Wesley, c1989  xiv, 478 p. ; 24 cm
所蔵情報: loading…
目次情報: 続きを見る
Introduction
Mathematical Induction
Analysis of Algorithms
Data Structures
Design of Algorithms by Induction
Algorithms Involving Sequences and Sets
Graph Algorithms
Geometric Algorithms
Algebraic and Numeric Algorithms
Reductions
NP-Completeness
Parallel Algorithms
Introduction
Mathematical Induction
Analysis of Algorithms
40.

図書
図書
40. Purely functional data structures (: pbk)
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：
41.

図書
図書
41. Data structures and algorithms : a first course
Iain T. Adamson
出版情報: London : Springer, c1996  xi, 419 p. ; 24 cm
所蔵情報: loading…
42.

図書
図書
42. Data structures using C and C++. 2nd ed
Yedidyah Langsam, Moshe J. Augenstein, Aaron M. Tenenbaum
出版情報: Upper Saddle River, N.J. : Prentice Hall, c1996  xvi, 672 p. ; 25 cm
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Data Structures / 1：
The Stack / 2：
Recursion / 3：
Queues and Lists / 4：
Trees / 5：
Sorting / 6：
Searching / 7：
Graphs and Their Applications / 8：
Storage Management / 9：
Bibliography and References
Index
Introduction to Data Structures / 1：
The Stack / 2：
Recursion / 3：
43.

図書
図書
43. Programming language structures
Elliott I. Organick, Alexandra I. Forsythe, Robert P. Plummer
出版情報: New York : Academic Press, c1978  xviii, 659 p. ; 27 cm
所蔵情報: loading…
44.

図書
図書
44. Data-structures and programming
Malcolm C. Harrison
出版情報: Glenview, Ill. : Scott, Foresman, c1973  322 p. ; 24 cm
所蔵情報: loading…
45.

図書
図書
45. Introduction to data structures and non-numeric computation
[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…
46.

図書
図書
46. Data structures and algorithms
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
出版情報: Reading, Mass. : Addison-Wesley, c1983  xi, 427 p. ; 25 cm
シリーズ名: Addison-Wesley series in computer science and information processing
所蔵情報: loading…
47.

電子ブック
ＥＢ
47. Data structures and algorithms in Python (: electronic bk)
Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser
出版情報: [東京] : Maruzen eBook Library  1オンラインリソース(xix, 748 p.)
所蔵情報: loading…
目次情報: 続きを見る
Python Programming Basics / Chapter 1：
Object-Oriented Design / Chapter 2：
Analysis Tools and Recursion / Chapter 3：
Stacks, Queues, and Deques / Chapter 4：
Sequence Abstractions / Chapter 5：
Tree Structures / Chapter 6：
Priority Queues / Chapter 7：
Maps and Dictionaries / Chapter 8：
Search Tree Structures / Chapter 9：
Sorting, Sets, and Selection / Chapter 10：
Strings and Dynamic Programming / Chapter 11：
Graph Algorithms / Chapter 12：
Memory Management and B-trees / Chapter 13：
Useful Mathematical Facts / Appendix A：
Python Programming Basics / Chapter 1：
Object-Oriented Design / Chapter 2：
Analysis Tools and Recursion / Chapter 3：
48.

電子ブック
ＥＢ
48. Chemical structure information systems : interfaces, communication, and standards
Wendy A. Warr, editor
出版情報: [S.l.] : ACS Publications  1 online resource (x, 132 p.)
シリーズ名: ACS symposium series ; 400
所蔵情報: loading…
目次情報: 続きを見る
Introduction Design Considerations for Multipurpose Structure Files
Information Integration in an Incompatible World Chemical Structure Browsing
Integration and Standards: Use of a Host Language Interface
A Standard Interface to Public, Corporate, and Personal Files
Towards the Universal Chemical Structure Interface
A Universal Structure/Substructure Representation for PC-Host Communication
Chemical Structure Information at the Bench
A New Integrated Approach Building a Comprehensive Chemical Information System
The Standard Molecular Data Format (SMD Format) as an Integration Tool in Computer Chemistry
The Effort to Define a Standard Molecular Description File Format
Introduction Design Considerations for Multipurpose Structure Files
Information Integration in an Incompatible World Chemical Structure Browsing
Integration and Standards: Use of a Host Language Interface
49.

図書
図書
49. Equations and initial semantics (: U.S. ; : Germany)
H. Ehrig, B. Mahr
出版情報: Berlin ; Tokyo : Springer-Verlag, c1985  xi, 321 p. ; 24 cm
シリーズ名: EATCS monographs on theoretical computer science ; v. 6 . Fundamentals of algebraic specification ; v. 1
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼