ISBN: 9783540194873
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… mais…
Indigo.ca new in stock. Custos de envio:spese di spedizione aggiuntive., mais custos de envio Details... |
SWAT '88 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings - novo libro
1988, ISBN: 3540194878
1988 Kartoniert / Broschiert Algorithmus, Mathematik, Theoretische Informatik, Resolution; algorithm; complexity; computationalgeometry; datastructure; datastructures; algorithmanalysis… mais…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Custos de envio:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
ISBN: 9783540194873
SWAT '88 ab 74.99 € als Taschenbuch: 1st Scandinavian Workshop on Algorithm Theory Halmstad Sweden July 5-8 1988. Proceedings. Auflage 1988. Aus dem Bereich: Bücher, Wissenschaft, Mathema… mais…
Hugendubel.de Custos de envio:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00) Details... |
ISBN: 9783540194873
SWAT '88 ab 74.99 € als Taschenbuch: 1st Scandinavian Workshop on Algorithm Theory Halmstad Sweden July 5-8 1988. Proceedings. Auflage 1988. Aus dem Bereich: Bücher, Wissenschaft, Mathema… mais…
Hugendubel.de Custos de envio:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., spese di spedizione aggiuntive. (EUR 7.50) Details... |
ISBN: 3540194878
SWAT '88 ab 74.99 € als Taschenbuch: 1st Scandinavian Workshop on Algorithm Theory Halmstad Sweden July 5-8 1988. Proceedings. Auflage 1988. Aus dem Bereich: Bücher, Wissenschaft, Mathema… mais…
Hugendubel.de Nr. 7072424. Custos de envio:, , DE. (EUR 0.00) Details... |
ISBN: 9783540194873
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… mais…
Lingas, Andrzej (Herausgeber); Karlsson, Rolf (Herausgeber):
SWAT '88 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings - novo libro1988, ISBN: 3540194878
1988 Kartoniert / Broschiert Algorithmus, Mathematik, Theoretische Informatik, Resolution; algorithm; complexity; computationalgeometry; datastructure; datastructures; algorithmanalysis… mais…
ISBN: 9783540194873
SWAT '88 ab 74.99 € als Taschenbuch: 1st Scandinavian Workshop on Algorithm Theory Halmstad Sweden July 5-8 1988. Proceedings. Auflage 1988. Aus dem Bereich: Bücher, Wissenschaft, Mathema… mais…
ISBN: 9783540194873
SWAT '88 ab 74.99 € als Taschenbuch: 1st Scandinavian Workshop on Algorithm Theory Halmstad Sweden July 5-8 1988. Proceedings. Auflage 1988. Aus dem Bereich: Bücher, Wissenschaft, Mathema… mais…
ISBN: 3540194878
SWAT '88 ab 74.99 € als Taschenbuch: 1st Scandinavian Workshop on Algorithm Theory Halmstad Sweden July 5-8 1988. Proceedings. Auflage 1988. Aus dem Bereich: Bücher, Wissenschaft, Mathema… mais…
Dados bibliográficos do melhor livro correspondente
Autor: | |
Título: | |
Número ISBN: |
Dados detalhados do livro - SWAT '88
EAN (ISBN-13): 9783540194873
ISBN (ISBN-10): 3540194878
Livro de bolso
Ano de publicação: 1988
Editor/Editora: Springer Berlin Heidelberg
272 Páginas
Peso: 0,415 kg
Língua: eng/Englisch
Livro na base de dados desde 2007-04-25T20:31:35+01:00 (Lisbon)
Página de detalhes modificada pela última vez em 2023-04-06T15:25:47+01:00 (Lisbon)
Número ISBN/EAN: 3540194878
Número ISBN - Ortografia alternativa:
3-540-19487-8, 978-3-540-19487-3
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: lingas, andrzej just, karlsson, mehlhorn, wood rolf
Título do livro: sweden, scandinavian, swat, theory, lecture notes computer science, july
Dados da editora
Autor: Rolf Karlsson; Andrzej Lingas
Título: Lecture Notes in Computer Science; SWAT '88 - 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings
Editora: Springer; Springer Berlin
264 Páginas
Ano de publicação: 1988-06-22
Berlin; Heidelberg; DE
Língua: Inglês
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
VIII, 264 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; Resolution; algorithm; complexity; computational geometry; data structure; data structures; algorithm analysis and problem complexity; Theory of Computation; Mathematics; Algorithms; Mathematik; Algorithmen und Datenstrukturen; EA
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.Outros livros adicionais, que poderiam ser muito similares com este livro:
Último livro semelhante:
9783540392880 SWAT '88 (Rolf Karlsson; Andrzej Lingas)
< Para arquivar...