+612 9045 4394
 
CHECKOUT
Algorithms - ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001: Proceedings :  9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001: Proceedings - F.Meyer Auf Der Heide

Algorithms - ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001: Proceedings

9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001: Proceedings

By: F.Meyer Auf Der Heide (Editor)

Paperback Published: October 2001
ISBN: 9783540424932
Number Of Pages: 544

Share This Book:

Paperback

$158.39
or 4 easy payments of $39.60 with Learn more
Ships in 5 to 9 business days

It is only during the last decade that the functions of sinusoidal endothelial cells, Kupffer cells, hepatic stellate cells, pit cells and other intrahepatic lymphocytes have been better understood. The development of methods for isolation and co-culturing various types of liver cells has established that they communicate and cooperate via secretion of various intercellular mediators. This monograph summarizes multiple data that suggest the important role of cellular cross-talk for the functions of both normal and diseased liver. Special features of the book include concise presentation of the majority of detailed data in 19 tables. Original schemes allow for the clear illustration of complicated intercellular relationships. This is the first ever presentation of the newly emerging field of liver biology, which is important for hepatic function in health and disease and opens new avenues for therapeutic interventions.

External Memory Data Structuresp. 1
Some Algorithmic Problems in Large Networksp. 30
Exact and Approximate Distances in Graphs - A Surveyp. 33
Strongly Competitive Algorithms for Caching with Pipelined Prefetchingp. 49
Duality between Prefetching and Queued Writing with Parallel Disksp. 62
Online Bin Coloringp. 74
A General Decomposition Theorem for the k-Server Problemp. 86
Buying a Constant Competitive Ratio for Pagingp. 98
Simple Minimal Perfect Hashing in Less Spacep. 109
Cuckoo Hashingp. 121
Coupling Variable Fixing Algorithms for the Automatic Recording Problemp. 134
Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraintsp. 146
On the Approximability of the Minimum Test Collection Problemp. 158
Finding Approximate Repetitions under Hamming Distancep. 170
SNPs Problems Complexity, and Algorithmsp. 182
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costsp. 194
Grouping Techniques for Scheduling Problems: Simpler and Fasterp. 206
A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Timesp. 218
A Simple Shortest Path Algorithm with Linear Average Timep. 230
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithmsp. 242
A Separation Bound for Real Algebraic Expressionsp. 254
Property Testing with Geometric Queriesp. 266
Smallest Color-Spanning Objectsp. 278
Explicit Deterministic Constructions for Membership in the Bitprobe Modelp. 290
Lossy Dictionariesp. 300
Splitting a Delaunay Triangulation in Linear Timep. 312
A Fast Algorithm for Approximating the Detour of a Polygonal Chainp. 321
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guaranteep. 333
Distributed O([Delta]log n)-Edge-Coloring Algorithmp. 345
Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulationp. 356
Computing Cycle Covers without Short Cyclesp. 368
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidthp. 380
Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flowsp. 391
Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Optionsp. 404
Competitive Auctions for Multiple Digital Goodsp. 416
Algorithms for Efficient Filtering in Content-Based Multicastp. 428
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Modep. 440
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networksp. 452
Online and Offline Distance Constrained Labeling of Disk Graphsp. 464
Approximate Distance Labeling Schemesp. 476
On the Parameterized Complexity of Layered Graph Drawingp. 488
A General Model of Undirected Web Graphsp. 500
Packing Cycles and Cuts in Undirected Graphsp. 512
Greedy Algorithms for Minimisation Problems in Random Regular Graphsp. 524
Author Indexp. 537
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540424932
ISBN-10: 3540424938
Series: Eso Astrophysics Symposia
Audience: General
Format: Paperback
Language: English
Number Of Pages: 544
Published: October 2001
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.87
Weight (kg): 0.77