- 5 Ergebnisse
Kleinster Preis: € 42,79, größter Preis: € 67,82, Mittelwert: € 62,81
1
Algorithms and Computation - Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama; Takao Nishizeki; Masafumi Yamashita
Bestellen
bei Springer.com
€ 67,82
Bestellen
Details und Versand
gesponserter Link
Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama; Takao Nishizeki; Masafumi Yamashita:

Algorithms and Computation - neues Buch

ISBN: 9783540475019

This volume gives the proceedings of ISAAC '92, the Third International Symposium on Algorithms and Computation, held in Nagoya, Japan, December 1992. The first symposium was held in Toky… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
2
Algorithms and Computation
Bestellen
bei Springer.com
€ 42,79
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Algorithms and Computation - neues Buch

ISBN: 9783540475019

This volume gives the proceedings of ISAAC '92, the Third International Symposium on Algorithms and Computation, held in Nagoya, Japan, December 1992. The first symposium was held in Toky… Mehr…

Nr. 978-3-540-47501-9. Versandkosten:Worldwide free shipping, , zzgl. Versandkosten. (EUR 0.00)
zuklappen (X)
3
Algorithms and Computation - Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama; Takao Nishizeki; Masafumi Yamashita
Bestellen
bei Springer.com
€ 67,82
Bestellen
Details und Versand
gesponserter Link
Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama; Takao Nishizeki; Masafumi Yamashita:
Algorithms and Computation - neues Buch

ISBN: 9783540475019

Computer Science; Data Structures; Theory of Computation; Computational Mathematics and Numerical Analysis; Computation by Abstract Devices; Combinatorics; Probability Theory and Stochast… Mehr…

  - Versandkosten:zzgl. Versandkosten
zuklappen (X)
4
Algorithms and Computation - Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama; Takao Nishizeki; Masafumi Yamashita
Bestellen
bei Springer.com
€ 67,82
Bestellen
Details und Versand
gesponserter Link
Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama; Takao Nishizeki; Masafumi Yamashita:
Algorithms and Computation - neues Buch

ISBN: 9783540475019

Computer Science; Data Structures; Theory of Computation; Computational Mathematics and Numerical Analysis; Computation by Abstract Devices; Combinatorics; Probability Theory and Stochast… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
5
Algorithms and Computation - Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama; Takao Nishizeki; Masafumi Yamashita
Bestellen
bei Springer.com
€ 67,82
Bestellen
Details und Versand
gesponserter Link
Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama; Takao Nishizeki; Masafumi Yamashita:
Algorithms and Computation - neues Buch

ISBN: 9783540475019

Computer Science; Data Structures; Theory of Computation; Computational Mathematics and Numerical Analysis; Computation by Abstract Devices; Combinatorics; Probability Theory and Stochast… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Algorithms and Computation
Autor:
Titel:
ISBN-Nummer:

9783540475019

Detailangaben zum Buch - Algorithms and Computation


EAN (ISBN-13): 9783540475019
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-01-29T17:51:17+01:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-31T10:32:44+02:00 (Zurich)
ISBN/EAN: 9783540475019

ISBN - alternative Schreibweisen:
978-3-540-47501-9
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: yamashita
Titel des Buches: algorithms

Daten vom Verlag:

Autor/in: Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama; Takao Nishizeki; Masafumi Yamashita
Titel: Lecture Notes in Computer Science; Algorithms and Computation - Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings
Verlag: Springer; Springer Berlin
516 Seiten
Erscheinungsjahr: 2005-07-14
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XII, 516 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Datenbanken; Verstehen; AAC; algorithms; automata; complexity; computational geometry; data structures; distributed computing; formal language; formal languages; term rewriting; combinatorics; C; Data Science; Theory of Computation; Computational Mathematics and Numerical Analysis; Discrete Mathematics; Probability Theory; Computer Science; Theoretische Informatik; Numerische Mathematik; Diskrete Mathematik; Wahrscheinlichkeitsrechnung und Statistik; Stochastik; BC

Methods in parallel algorithmics and who may need to know them?.- Rectilinear paths among rectilinear obstacles.- Linear time algorithms for k-cutwidth problem.- The k-edge-connectivity augmentation problem of weighted graphs.- Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity.- The application of the searching over separators strategy to solve some NP-complete problems on planar graphs.- Parallel and on-line graph coloring algorithms.- Competitive analysis of the Round Robin algorithm.- Competitive analysis of the on-line algorithms for multiple stacks systems.- Self-adjusting augmented search trees.- Algorithms for a class of Min-Cut and Max-Cut problem.- Algorithms for rectilinear optimal multicast tree problem.- Approximating treewidth and pathwidth of some classes of perfect graphs.- Graph spanners and connectivity.- Randomized range-maxima in nearly-constant parallel time.- Fault-tolerant broadcasting in binary jumping networks.- Routing problems on the mesh of buses.- Selection networks with 8n log2 n size and O(log n) depth.- Relativizations of the P=? NP and other problems: Some developments in structural complexity theory.- Boolean circuit complexity.- Searching a solid pseudo 3-sided orthoconvex grid.- An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects.- Topologically consistent algorithms related to convex polyhedra.- Characterizing and recognizing visibility graphs of Funnel-shaped polygons.- On the complexity of composite numbers.- On malign input distributions for algorithms.- Lowness and the complexity of sparse and tally descriptions.- Honest iteration schemes of randomizing algorithms.- Approximating vertices of a convex polygon with grid points in the polygon.- Algorithms for determining the geometrical congruity in two and three dimensions.- On the relationships among constrained geometric structures.- Generating small convergent systems can be extremely hard.- Chew's theorem revisited — uniquely normalizing property of nonlinear term rewriting systems.- Higher order communicating processes with Value-Passing, Assignment and return of results.- Searching informed game trees.- How to generate realistic sample problems for network optimization.- Generalized assignment problems.- Recognizing an envelope of lines in linear time.- Approximation of polygonal curves with minimum number of line segments.- Wiring knock-knee layouts: A global approach.- Algorithms for finding non-crossing paths with minimum total length in plane graphs.- On symmetry of information and polynomial time invertibility.- On probabilistic ACC circuits with an exact-threshold output gate.- Computational and statistical indistinguishabilities.- On symmetric differences of NP-hard sets with weakly-P-selective sets.- Restricted track assignment with applications.- A simple test for the consecutive ones property.- The longest common subsequence problem for small alphabet size between many strings.- The implicit dictionary problem revisited.- Sorting in-place with a worst case complexity of n log n?1.3n+O(log n) comparisons and ? n log n+O(1) transports.- Sorting and/by merging finger trees.

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9783319130743 Algorithms and Computation (Chan-Su Shin)

< zum Archiv...