HOME > Detail View

Detail View

Algorithms - ESA '94 : Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994 : proceedings

Algorithms - ESA '94 : Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994 : proceedings

Material type
단행본
Personal Author
Van Leeuwen, Jan.
Title Statement
Algorithms - ESA '94 : Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994 : proceedings / Jan van Leeuwen (ed.).
Publication, Distribution, etc
Berlin ;   New York :   Springer,   1994.  
Physical Medium
x, 510 p. : ill. ; 24 cm.
Series Statement
Lecture notes in computer science ;. 855.
ISBN
354058434X
Bibliography, Etc. Note
Includes bibliographical references and index.
Subject Added Entry-Topical Term
Computer algorithms --Congresses.
000 00754camuuu200205 a 4500
001 000000922911
005 19990121093340.0
008 970108s1994 ge a b 101 0 eng d
020 ▼a 354058434X
040 ▼a 244002 ▼c 244002
049 0 ▼l 151033034 ▼v 94
082 0 4 ▼a 004/.01/5118 ▼2 20
090 ▼a 004.015118 ▼b A396
245 0 0 ▼a Algorithms - ESA '94 : ▼b Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994 : proceedings / ▼c Jan van Leeuwen (ed.).
260 ▼a Berlin ; ▼a New York : ▼b Springer, ▼c 1994.
300 ▼a x, 510 p. : ▼b ill. ; ▼c 24 cm.
440 0 ▼a Lecture notes in computer science ; ▼v . 855.
504 ▼a Includes bibliographical references and index.
650 0 ▼a Computer algorithms ▼x Congresses.
700 1 ▼a Van Leeuwen, Jan.

Holdings Information

No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Sejong Academic Information Center/Science & Technology/ Call Number 004.015118 A396 Accession No. 151033034 Availability Available Due Date Make a Reservation Service C M

Contents information

Table of Contents

Optimization algorithms for large networks.- Wanna buy an algorithm? Cheap! or: Algorithms for text searching which could have commercial value.- Planar drawings and angular resolution: Algorithms and bounds.- A better heuristic for orthogonal graph drawings.- Hamiltonian triangulations for fast rendering.- Efficient construction of a bounded degree spanner with low weight.- Approaching the 5/4 - approximation for rectilinear Steiner trees.- Membership in constant time and minimum space.- Faster searching in tries and quadtrees-An analysis of level compression.- The analysis of a hashing scheme by the diagonal poisson transform.- Some lower bounds for comparison-based algorithms.- An efficient algorithm for edge-ranking trees.- Edge-disjoint (s, t)-paths in undirected planar graphs in linear time.- A simple min cut algorithm.- Approximation algorithm on multi-way maxcut partitioning.- A linear-time algorithm for finding a central vertex of a chordal graph.- The time complexity of updating snapshot memories.- Non-exploratory self-stabilization for constant-space symmetry-breaking.- On-line distributed data management.- A unified scheme for detecting fundamental curves in binary edge images.- How to compute the Voronoi diagram of line segments: Theoretical and experimental results.- Range searching and point location among fat objects.- Convex tours of bounded curvature.- Optimal shortest path and minimum-link path queries in the presence of obstacles.- Fast algorithms for collision and proximity problems involving moving geometric objects.- Reverse-Fit: A 2-optimal algorithm for packing rectangles.- An optimal algorithm for preemptive on-line scheduling.- Tight approximations for resource constrained scheduling problems.- An algorithm for 0-1 programming with application to airline crew scheduling.- An o(n) work EREW parallel algorithm for updating MST.- On the structure of DFS-forests on directed graphs and the dynamic maintenance of DFS on DAG's.- Finding and counting given length cycles.- Greedy hot-potato routing on the mesh.- Desnakification of mesh sorting algorithms.- Tight bounds on deterministic PRAM emulations with constant redundancy.- PRAM computations resilient to memory faults.- An area lower bound for a class of fat-trees.- A unified approach to approximation schemes for NP- and PSPACE-hard problems for geometric graphs.- The parallel complexity of eden growth, solid-on-solid growth and ballistic deposition.- A new approach to resultant computations and other algorithms with exact division.- Testing equivalence of morphisms on context-free languages.- Work-time optimal parallel prefix matching.- On the exact complexity of the string prefix-matching problem.- Incremental text editing: a new data structure.- The ESA '93 Proceedings.


Information Provided By: : Aladin

New Arrivals Books in Related Fields

김효곤 (2022)