ISBN: 9783540392880
The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas… Mehr…
| Springer.com new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00) Details... |
ISBN: 9783540392880
The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas… Mehr…
| Springer.com Nr. 978-3-540-39288-0. Versandkosten:Worldwide free shipping, , zzgl. Versandkosten. (EUR 0.00) Details... |
ISBN: 9783540392880
Computer Science; Theory of Computation; Mathematics, general; Algorithm Analysis and Problem Complexity Algorithms, Resolution, algorithm, complexity, computational geometry, data struct… Mehr…
| Springer.com Versandkosten:zzgl. Versandkosten Details... |
ISBN: 9783540392880
Computer Science; Theory of Computation; Mathematics, general; Algorithm Analysis and Problem Complexity Algorithms, Resolution, algorithm, complexity, computational geometry, data struct… Mehr…
| Springer.com Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540392880
Computer Science; Theory of Computation; Mathematics, general; Algorithm Analysis and Problem Complexity Algorithms, Resolution, algorithm, complexity, computational geometry, data struct… Mehr…
| Springer.com Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540392880
The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas… Mehr…
ISBN: 9783540392880
The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas… Mehr…
ISBN: 9783540392880
Computer Science; Theory of Computation; Mathematics, general; Algorithm Analysis and Problem Complexity Algorithms, Resolution, algorithm, complexity, computational geometry, data struct… Mehr…
ISBN: 9783540392880
Computer Science; Theory of Computation; Mathematics, general; Algorithm Analysis and Problem Complexity Algorithms, Resolution, algorithm, complexity, computational geometry, data struct… Mehr…
ISBN: 9783540392880
Computer Science; Theory of Computation; Mathematics, general; Algorithm Analysis and Problem Complexity Algorithms, Resolution, algorithm, complexity, computational geometry, data struct… Mehr…
Bibliographische Daten des bestpassenden Buches
| Autor: | |
| Titel: | |
| ISBN-Nummer: |
Detailangaben zum Buch - SWAT '88
EAN (ISBN-13): 9783540392880
Herausgeber: Springer Science+Business Media
Buch in der Datenbank seit 2017-06-04T23:08:15+02:00 (Vienna)
Detailseite zuletzt geändert am 2024-02-09T16:24:30+01:00 (Vienna)
ISBN/EAN: 9783540392880
ISBN - alternative Schreibweisen:
978-3-540-39288-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: karlsson
Daten vom Verlag:
Autor/in: Rolf Karlsson; Andrzej Lingas
Titel: Lecture Notes in Computer Science; SWAT '88 - 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings
Verlag: Springer; Springer Berlin
264 Seiten
Erscheinungsjahr: 2005-07-05
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
VIII, 264 p.
EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; Resolution; algorithm; complexity; computational geometry; data structure; data structures; algorithm analysis and problem complexity; C; Theory of Computation; Mathematics; Algorithms; Computer Science; Mathematik; Algorithmen und Datenstrukturen; BC
An implicit binomial queue with constant insertion time.- Implicit selection.- An extrapolation on the interpolation search.- Time parameter and arbitrary deunions in the set union problem.- Two new algorithms for constructing min-max heaps.- Extremal cost tree data structures.- Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques.- Problems of posting sentries: Variations on the art gallery theorem.- A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons.- On recognizing and characterizing visibility graphs of simple polygons.- Connectability problems.- Two hybrid methods for collision resolution in open addressing hashing.- On an alternative sum useful in the analysis of some data structures.- Bin-packing in 1.5 dimension.- Applications of a symbolic perturbation scheme.- A fast parallel algorithm for computing all maximal cliques in a graph and the related problems.- Parallel solution of sparse linear systems.- A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors.- Probabilistic log-space reductions and problems probabilistically hard for p.- Searching with uncertainty extended abstract.- An optimal expected-time parallel algorithm for Voronoi diagrams.- Generating binary trees by transpositions.- Approximating the complete Euclidean graph.- Upper and lower bounds for the dictionary problem.- Linear algorithms for graph separation problems.- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees.- NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems.- Independent covers in outerplanar graphs.- Tight lower bounds for Shellsort.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9780387194875 Swat 88: 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, (Lecture Notes in Computer Science) (Karlsson, R)
< zum Archiv...