Efficient Algorithms
% SALE
Efficient Algorithms
% SALE
% SALE
Description
Models of Computation and Complexity.- Building Mathematics-Based Software Systems to Advance Science and Create Knowledge.- On Negations in Boolean Networks.- The Lovász Local Lemma and Satisfiability.- Kolmogorov-Complexity Based on Infinite Computations.- Pervasive Theory of Memory.- Introducing Quasirandomness to Computer Science.- Sorting and Searching.- Reflections on Optimal and Nearly Optimal Binary Search Trees.- Some Results for Elementary Operations.- Maintaining Ideally Distributed Random Search Trees without Extra Space.- A Pictorial Description of Cole's Parallel Merge Sort.- Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction.- Combinatorial Optimization with Applications.- Algorithms for Energy Saving.- Minimizing Average Flow-Time.- Integer Linear Programming in Computational Biology.- Via Detours to I/O-Efficient Shortest Paths.- Computational Geometry and Geometric Graphs.- The Computational Geometry of Comparing Shapes.- Finding Nearest Larger Neighbors.- Multi-core Implementations of Geometric Algorithms.- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension.- On Map Labeling with Leaders.- The Crossing Number of Graphs: Theory and Computation.- Algorithm Engineering, Exactness, and Robustness.- Algorithm Engineering - An Attempt at a Definition.- Of What Use Is Floating-Point Arithmetic in Computational Geometry?.- Car or Public Transport-Two Worlds.- Is the World Linear?.- In Praise of Numerical Computation.- Much Ado about Zero.- Polynomial Precise Interval Analysis Revisited.
Product details
- Type:
- Book
- Binding:
- Paperback
- Edition:
- 1
- Languages:
-
Original:
English
- Number of Pages:
-
456
- Publisher:
-
Springer
- Publication Date:
-
2009-08-28
- ISBN / EAN:
- 9783642034558
- Weight:
-
686 g
- Dimensions:
-
16/24/3 cm
- GPSR Manufacturer Reference:
-
[email protected]
Die gelieferte Auflage kann ggf. abweichen.
Currently sold out
Back in stock email
Add to Wishlist