Del i serien Lecture Notes in Computer Science

Algorithms - ESA '95

Third Annual European Symposium, Corfu, Greece, September, 25 - 27, 1995. Proceedings

Häftad, Engelska, 1995

1 479 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book consitutes the proceedings of the Third Annual European Symposium on Algorithms, ESA '95, held in Corfu, Greece in September 1995.The volume presents 42 full revised papers selected during a careful refereeing process from a total of 119 submissions; in addition, there is a prominent keynote address. This year, the scope has been further expanded to new areas of computational endeavour in science; the book covers many aspects of algorithms research and application ranging from combinatorial mathematics to hardware design.

Produktinformation

Utgivningsdatum1995-09-13
Mått155 x 233 x 33 mm
Vikt920 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor603
Upplaga1995
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540603139

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

On mixed connectivity certificates.- Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model.- Optimal parallel shortest paths in small treewidth digraphs.- Shared memory simulations with triple-logarithmic delay.- Implementing shared memory on multi-dimensional meshes and on the fat-tree.- Beyond the worst-case bisection bound: Fast sorting and ranking on meshes.- Fast deterministic simulation of computations on faulty parallel machines.- Average circuit depth and average communication complexity.- Packing trees.- Sometimes travelling is easy: The master tour problem.- Interval graphs with side (and size) constraints.- Maximum skew-symmetric flows.- Certificates and fast algorithms for biconnectivity in fully-dynamic graphs.- On the all-pairs shortest path algorithm of Moffat and Takaoka.- Fully Dynamic Transitive Closure in plane dags with one source and one sink.- Planarity for clustered graphs.- A geometric approach to betweenness.- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon.- Linear size binary space partitions for fat objects.- Geometric pattern matching in d-dimensional space.- Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time.- External-memory algorithms for processing line segments in geographic information systems.- Optimized binary search and text retrieval.- On using q-gram locations in approximate string matching.- Routing with bounded buffers and hot-potato routing in vertex-symmetric networks.- Load balancing for response time.- Self-simulation for the Passive Optical Star model.- Computing the agreement of trees with bounded degrees.- Approximation algorithms for feasible cut and multicut problems.- On parallel versus sequential approximation.- An efficient and effective approximation algorithm for the Map Labeling Problem.- Approximating the bandwidth for asteroidal triple-free graphs.- Near-optimal distributed edge coloring.- The centroid of points with approximate weights.- 0/1-Integer programming: Optimization and Augmentation are equivalent.- The online transportation problem.- A polyhedral approach to planar augmentation and related problems.- Optimal layouts on a chain ATM network.- Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary.- Adaptive Video on Demand.- The binomial transform and its application to the analysis of skip lists.- An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search.- Fast skeleton construction.

Du kanske också är intresserad av

Speed Tribes: Days and Night's with Japan's Next Generation

Karl Taro Greenfeld

Häftad, 1995

319 kr

Practical Sampling Techniques

Ranjan K. Som

Inbunden, 1995

9 699 kr

Russian National Security and Foreign Policy in Transition

Eugene B. Rumer

Häftad, 1995

339 kr

Irritable Bowel Syndrome

Philippe Denis

Inbunden, 1995

2 159 kr

Quantitative Evaluation of Computing and Communication Systems

Heinz Beilner, Falko Bause

Häftad, 1995

749 kr

Del 56

Anionic Surfactants

Helmut W. Stache

Inbunden, 1995

4 519 kr

Internet and Network Economics

Paul Spirakis, Marios Mavronicolas, Spyros Kontogiannis

Häftad, 2006

749 kr

Static Analysis

Alan Mycroft

Häftad, 1995

749 kr

Del 10616

Stabilization, Safety, and Security of Distributed Systems

Paul Spirakis, Philippas Tsigas

Häftad, 2017

749 kr

Spatial Information Theory: A Theoretical Basis for GIS

Andrew U. Frank, Werner Kuhn

Häftad, 1995

1 439 kr

Del i serien Lecture Notes in Computer Science

Algorithms - ESA '95

Third Annual European Symposium, Corfu, Greece, September, 25 - 27, 1995. Proceedings

Häftad, Engelska, 1995

AvPaul Spirakis

1 479 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1995-09-13
Mått155 x 233 x 33 mm
Vikt920 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor603
Upplaga1995
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540603139

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

On mixed connectivity certificates.- Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model.- Optimal parallel shortest paths in small treewidth digraphs.- Shared memory simulations with triple-logarithmic delay.- Implementing shared memory on multi-dimensional meshes and on the fat-tree.- Beyond the worst-case bisection bound: Fast sorting and ranking on meshes.- Fast deterministic simulation of computations on faulty parallel machines.- Average circuit depth and average communication complexity.- Packing trees.- Sometimes travelling is easy: The master tour problem.- Interval graphs with side (and size) constraints.- Maximum skew-symmetric flows.- Certificates and fast algorithms for biconnectivity in fully-dynamic graphs.- On the all-pairs shortest path algorithm of Moffat and Takaoka.- Fully Dynamic Transitive Closure in plane dags with one source and one sink.- Planarity for clustered graphs.- A geometric approach to betweenness.- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon.- Linear size binary space partitions for fat objects.- Geometric pattern matching in d-dimensional space.- Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time.- External-memory algorithms for processing line segments in geographic information systems.- Optimized binary search and text retrieval.- On using q-gram locations in approximate string matching.- Routing with bounded buffers and hot-potato routing in vertex-symmetric networks.- Load balancing for response time.- Self-simulation for the Passive Optical Star model.- Computing the agreement of trees with bounded degrees.- Approximation algorithms for feasible cut and multicut problems.- On parallel versus sequential approximation.- An efficient and effective approximation algorithm for the Map Labeling Problem.- Approximating the bandwidth for asteroidal triple-free graphs.- Near-optimal distributed edge coloring.- The centroid of points with approximate weights.- 0/1-Integer programming: Optimization and Augmentation are equivalent.- The online transportation problem.- A polyhedral approach to planar augmentation and related problems.- Optimal layouts on a chain ATM network.- Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary.- Adaptive Video on Demand.- The binomial transform and its application to the analysis of skip lists.- An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search.- Fast skeleton construction.