1.
|
図書
|
André Thayse
|
2.
|
図書
|
edited by J.C. Mason and M.G. Cox
目次情報:
続きを見る
Development of Algorithms / Part 1: |
Spline Approximation and Smoothing / 1: |
Spline Interpolation and Shape Preservation / 2: |
Multivariate Interpolation / 3: |
Least Square Methods / 4: |
Rational Approximation / 5: |
Complex and Nonlinear Approximation / 6: |
Computer-Aided Design and Blending / 7: |
Applications / Part 2: |
Applications in Numerical Analysis / 8: |
Applications in Partial Differential Equations / 9: |
Applications in Other Disciplines / 10: |
Software / Part 3: |
Development of Algorithms / Part 1: |
Spline Approximation and Smoothing / 1: |
Spline Interpolation and Shape Preservation / 2: |
|
3.
|
図書
|
M.N.S. Swamy, K. Thulasiraman
|
4.
|
図書
|
G.M. Adelson-Velsky, V.L. Arlazarov, M.V. Donskoy ; [translator, Arthur Brown]
出版情報: |
New York ; Berlin ; Tokyo : Springer, c1988 x, 197 p. ; 25 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
5.
|
図書
|
edited by H.J.J. te Riele, Th.J. Dekker, H.A. van der Vorst
|
6.
|
図書
|
Lydia Kronsjö
出版情報: |
Chichester ; New York : Wiley, c1987 xiii, 363 p. ; 24 cm |
シリーズ名: |
Wiley series in computing |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
7.
|
図書
|
edited by Leah H. Jamieson, Dennis Gannon, Robert J. Douglass
|
8.
|
図書
|
Samuel D. Stearns, Ruth A. David
|
9.
|
図書
|
Varol Akman
|
10.
|
図書
|
Herbert S. Wilf
出版情報: |
Englewood Cliffs, N.J. : Prentice-Hall, c1986 vi, 231 p. ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
目次情報:
続きを見る
Preface |
Preface to the Second Edition |
What this Book Is About / 0: |
Background / 0.1: |
Hard versus Easy Problems / 0.2: |
A Preview / 0.3: |
Mathematical Preliminaries / 1: |
Orders of Magnitude / 1.1: |
Positional Number Systems / 1.2: |
Manipulations with Series / 1.3: |
Recurrence Relations / 1.4: |
Counting / 1.5: |
Graphs / 1.6: |
Recursive Algorithms / 2: |
Introduction / 2.1: |
Quicksort / 2.2: |
Recursive Graph Algorithms / 2.3: |
Fast Matrix Multiplication / 2.4: |
The Discrete Fourier Transform / 2.5: |
Applications of the FFT / 2.6: |
A Review / 2.7: |
Bibliography / 2.8: |
The Network Flow Problem / 3: |
Algorithms for the Network Flow Problem / 3.1: |
The Algorithm of Ford and Fulkerson / 3.3: |
The Max-Flow Min-Cut Theorem / 3.4: |
The Complexity of the Ford-Fulkerson Algorithm / 3.5: |
Layered Networks / 3.6: |
The MPM Algorithm / 3.7: |
Applications of Network Flow / 3.8: |
Algorithms in the Theory of Numbers / 4: |
Preliminaries / 4.1: |
The Greatest Common Divisor / 4.2: |
The Extended Euclidean Algorithm / 4.3: |
Primality Testing / 4.4: |
Interlude: The Ring of Integers Modulo n / 4.5: |
Pseudoprimality Tests / 4.6: |
Proof of Goodness of the Strong Pseudoprimality Test / 4.7: |
Factoring and Cryptography / 4.8: |
Factoring Large Integers / 4.9: |
Proving Primality / 4.10: |
NP-Completeness / 5: |
Turing Machines / 5.1: |
Cook's Theorem / 5.3: |
Some Other NP-Complete Problems / 5.4: |
Half a Loaf ... / 5.5: |
Backtracking (I): Independent Sets / 5.6: |
Backtracking (II): Graph Coloring / 5.7: |
Approximate Algorithms for Hard Problems / 5.8: |
Hints and Solutions for Selected Problems |
Index |
Preface |
Preface to the Second Edition |
What this Book Is About / 0: |
|
11.
|
図書
|
T.C. Hu
出版情報: |
Reading, MA : Addison-Wesley Pub. Co., c1982 292 p. ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
目次情報:
続きを見る
Shortest Paths / Chapter 1: |
Graph terminology / 1.1: |
Shortest path / 1.2: |
Multiterminal shortest paths / 1.3: |
Decomposition algorithm / 1.4: |
Acyclic network / 1.5: |
Shortest paths in a general network / 1.6: |
Minimum spanning tree / 1.7: |
Breadth-first-search and depth-first-search / 1.8: |
Maximum flows / Chapter 2: |
Maximum flow / 2.1: |
Algorithms for max flows / 2.2: |
Ford and Fulkerson / 2.2.1: |
Karzanov's algorithm / 2.2.2: |
MPM algorithms / 2.2.3: |
Analysis of algorithms / 2.2.4: |
Multi-terminal maximum flows / 2.3: |
Realization / 2.3.1: |
Analysis / 2.3.2: |
Synthesis / 2.3.3: |
Multi-commodity flows / 2.3.4: |
Minimum cost flows / 2.4: |
Applications / 2.5: |
Sets of distinct representatives / 2.5.1: |
PERT / 2.5.2: |
Optimum communication spanning tree / 2.5.3: |
Dynamic programming / Chapter 3: |
Introduction / 3.1: |
Knapsack problem / 3.2: |
Two-dimensional knapsack problem / 3.3: |
Minimum-cost alphabetic tree / 3.4: |
Summary / 3.5: |
Backtracking / Chapter 4: |
Estimating the efficiency of backtracking / 4.1: |
Branch and bound / 4.3: |
Game-tree / 4.4: |
Binary tree / Chapter 5: |
Huffman's tree / 5.1: |
Alphabetic tree / 5.3: |
Hu-Tucker algorithm / 5.4: |
Feasibility and optimality / 5.5: |
Garsia and Wachs' algorithm / 5.6: |
Regular cost function / 5.7: |
T-ary tree and other results / 5.8: |
Heuristic and near optimum / Chapter 6: |
Greedy algorithm / 6.1: |
Bin-packing / 6.2: |
Job-scheduling / 6.3: |
Job-scheduling (tree-constraints) / 6.4: |
Matrix multiplication / Chapter 7: |
Strassen's matrix multiplication / 7.1: |
Optimum order of multiplying matrices / 7.2: |
Partitioning a convex polygon / 7.3: |
The heuristic algorithm / 7.4: |
NP-complete / Chapter 8: |
Polynomial algorithms / 8.1: |
Nondeterministic algorithms / 8.3: |
NP-complete problems / 8.4: |
Facing a new problem / 8.5: |
Local indexing algorithms / Chapter 9: |
Mergers of algorithms / 9.1: |
Maximum flows and minimum cuts / 9.2: |
Maximum adjacency and minimum separation / 9.3: |
Gomory-Hu tree / Chapter 10: |
Tree edges and tree links / 10.1: |
Contraction / 10.2: |
Domination / 10.3: |
Equivalent formulations / 10.4: |
Optimum mergers of companies / 10.4.1: |
Optimum circle partition / 10.4.2: |
Extreme stars and host-feasible circles / 10.5: |
The high-level approach / 10.6: |
Chop-stick method / 10.7: |
Relationship between phases / 10.8: |
The staircase diagram / 10.9: |
Complexity issues / 10.10: |
Comments on Chapters 2, 5 & 6 / Appendix A: |
Ancestor trees / A.1: |
Minimum surface or plateau problem / A.2: |
Comments on binary trees in chapter 5 / A.3: |
A simple proof of the Hu-Tucker algorithm / A.3.1: |
Binary search trees / A.3.2: |
Binary search on a tape / A.3.3: |
Comments on §6.2, bin-packing / A.4: |
Network algebra / Appendix B: |
Shortest Paths / Chapter 1: |
Graph terminology / 1.1: |
Shortest path / 1.2: |
|
12.
|
図書
|
Robert Sedgewick
|
13.
|
図書
|
by John P. Fishburn
|
14.
|
図書
|
N. S. Rajbman and V. M. Chadeev ; translator F. W. Gerretsen ; scientific editor P. Eykhoff
出版情報: |
Amsterdam ; New York : North-Holland Publishing Co. : sole distributors for the U.S.A. and Canada, Elsevier North-Holland, 1980 xiv, 435 p. ; 23 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
15.
|
図書
|
by Robert A. Paige
|
16.
|
図書
|
Selim G. Akl
出版情報: |
Englewood Cliffs, N.J. : Prentice Hall, c1989 xiii, 401 p. ; 25 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
17.
|
図書
|
J. Mikloško ... [et al.] ; edited by J. Mikloško
出版情報: |
Bratislava : VEDA, Pub. House of the Slovak Academy of Sciences , Amsterdam ; Tokyo : North-Holland, 1989 xv, 261 p. ; 25 cm |
シリーズ名: |
Special topics in supercomputing ; v. 5 |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
18.
|
図書
|
Alan Gibbons, Wojciech Rytter
出版情報: |
Cambridge [Cambridgeshire] : Cambridge University Press, c1988 viii, 259 p. ; 26 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
目次情報:
続きを見る
Preface |
Introduction / 1: |
The model of parallel computation / 1.1: |
Some general algorithmic techniques / 1.2: |
Reducing the number of processors / 1.3: |
Examples of fast parallel computations on vectors and lists / 1.4: |
Bibliography |
Graph algorithms / 2: |
Parallel computations on trees / 2.1: |
Paths, spanning trees, connected components and blocks / 2.2: |
Eulerian circuits and maximal matchings / 2.3: |
Colouring of graphs / 2.4: |
Bibliographic notes |
Expression evaluation / 3: |
Constructing the expression tree / 3.1: |
A parallel pebble game with applications to expression evaluation / 3.2: |
An optimal parallel algorithm for expression evaluation / 3.3: |
The optimal parallel transformation of regular expressions to non-deterministic finite automata / 3.4: |
Evaluation of generalised expressions: straight-line programs / 3.5: |
More efficient algorithms for dynamic programming / 3.6: |
A more algebraic point of view: a method of simultaneous substitutions / 3.7: |
Parallel recognition and parsing of context-free languages / 4: |
Parallel recognition of general context-free languages / 4.1: |
Parallel recognition of unambiguous context-free languages / 4.2: |
Parallel parsing of general context-free languages / 4.3: |
Optimal parallel recognition and parsing of bracket languages / 4.4: |
Optimal parallel recognition of input-driven languages / 4.5: |
Fast parallel sorting / 5: |
Batcher's sorting networks / 5.1: |
Cole's optimal parallel merge sort / 5.2: |
A theoretical optimal sorting network: Paterson's version of the algorithm of Ajtai, Komlos and Szemeredi / 5.3: |
Parallel string matching / 6: |
Analysis of the text / 6.1: |
Preprocessing the pattern / 6.2: |
Complexity of the whole pattern-matching algorithm / 6.3: |
P-completeness: hardly parallelisable problems / 7: |
A first P-complete problem / 7.1: |
A selection of P-complete problems / 7.2: |
Index of definitions, techniques and algorithms |
Preface |
Introduction / 1: |
The model of parallel computation / 1.1: |
|
19.
|
図書
|
Anil K. Jain, Richard C. Dubes
|
20.
|
図書
|
Theo Pavlidis
出版情報: |
Rockville, MD : Computer Science Press, c1982 xv, 416 p., [29] p. of plates ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
21.
|
図書
|
by A.A. Markov and N.M. Nagorny ; translated by M. Greendlinger
|
22.
|
図書
|
Jagdish J. Modi
|
23.
|
図書
|
David E. Goldberg
出版情報: |
Reading, Mass. ; Tokyo : Addison-Wesley, c1989 xiii, 412 p. ; 25 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
目次情報:
続きを見る
Genetic Algorithms Revisited: Mathematical Foundations |
Computer Implementation of a Genetic Algorithm |
Some Applications of Genetic Algorithms |
Advanced Operators and Techniques in Genetic Search |
Introduction to Genetics-Based Machine Learning |
Applications of Genetics-Based Machine Learning |
A Look Back, A Glance Ahead |
Appendixes |
Genetic Algorithms Revisited: Mathematical Foundations |
Computer Implementation of a Genetic Algorithm |
Some Applications of Genetic Algorithms |
|
24.
|
図書
|
S. Lakshmivarahan
出版情報: |
New York : Springer-Verlag, c1981 x, 279 p. ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
25.
|
図書
|
T. Theoharis
|
26.
|
図書
|
V.E. Golender and A.B. Rozenblit
出版情報: |
Letchworth, Hertfordshire, Eng. : Research Studies Press , New York : Wiley, c1983 xiii, 289 p. ; 24 cm |
シリーズ名: |
Chemometrics series ; 6 |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
27.
|
図書
|
Jeffrey D. Smith
出版情報: |
Boston : PWS-KENT Pub. Co., c1989 xiii, 447 p. ; 25 cm |
シリーズ名: |
Computer science series |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
28.
|
図書
|
Daniel H. Greene, Donald E, Knuth
|
29.
|
図書
|
Louis Baker
出版情報: |
New York : McGraw-Hill, c1989 xii, 324 p. ; 23 cm |
シリーズ名: |
Computing that works |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
30.
|
図書
|
Thomas S. Parker, Leon O. Chua
出版情報: |
New York ; Berlin : Springer-Verlag, c1989 xiv, 348 p. ; 25 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
目次情報:
続きを見る
Steady-State Solutions |
PoincarF Maps |
Stability |
Integration |
Locating Limit Sets |
Manifolds |
Dimension |
Bifurcation Diagrams |
Programming |
Phase Portraits |
The Newton-Raphson Algorithm |
The Variational Equation |
Differential Topology |
The PoincarF Map |
One Lyapunov Exponent Vanishes |
Cantor Sets |
List ot Symbols |
Bibliography |
Index |
Steady-State Solutions |
PoincarF Maps |
Stability |
|
31.
|
図書
|
Niklaus Wirth
出版情報: |
Englewood Cliffs, N.J. : Prentice-Hall, c1986 288 p. ; 25 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
32.
|
図書
|
Pierre Berlioux and Philippe Bizard ; translated by Annwyl Williams
出版情報: |
Chichester [West Sussex] ; New York : J. Wiley, c1986 ix, 145 p. ; 23 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
33.
|
図書
|
B. Benninghofen, S. Kemmerich, M.M. Richter
目次情報:
続きを見る
Finite Sets of Reductions |
Infinite Sets of Reductions |
Automata and Reductions |
Deciding Algebraic Properties of Finitely Presented Monoids by Friedrich Otto |
References |
Subject Index |
List of Symbols and Abbreviations |
Finite Sets of Reductions |
Infinite Sets of Reductions |
Automata and Reductions |
|
34.
|
図書
|
David Harel
出版情報: |
Wokingham, England ; Reading, Mass. : Addison-Wesley, c1987 xiv, 425 p. ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
35.
|
図書
|
Gilles Brassard and Paul Bratley
出版情報: |
Englewood Cliffs, N.J. : Prentice Hall, c1988 xvi, 361 p. ; 25 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
36.
|
図書
|
Lydia Kronsjö
|
37.
|
図書
|
Udi Manber
出版情報: |
Reading, Mass. : Addison-Wesley, c1989 xiv, 478 p. ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
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 |
|
38.
|
図書
|
Jeff L. Kennington, Richard V. Helgason
出版情報: |
New York : Wiley, c1980 xiii, 291 p. ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
39.
|
図書
|
Richard E. Blahut
出版情報: |
Reading, Mass. : Addison-Wesley Pub. Co., c1985 xiv, 441 p. ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
40.
|
図書
|
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
|
41.
|
図書
|
Michel Gondran and Michel Minoux ; translated by Steven Vajda
|
42.
|
図書
|
by Masaru Tomita
|
43.
|
図書
|
edited by Lawrence Davis
|