- 4 Ergebnisse
Kleinster Preis: € 74,89, größter Preis: € 74,96, Mittelwert: € 74,94
1
Algorithms and Computation - Tetsuo Asano; Yoshihide Igarashi; Hiroshi Nagamochi; Satoru Miyano; Subhash Suri
Bestellen
bei Springer.com
€ 74,89
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Tetsuo Asano; Yoshihide Igarashi; Hiroshi Nagamochi; Satoru Miyano; Subhash Suri:

Algorithms and Computation - neues Buch

ISBN: 9783540496335

This book constitutes the refereed proceedings of the 7th International Symposium on Algorithms and Computation, ISAAC'96, held in Osaka, Japan, in December 1996. The 43 revised full pape… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00)
zuklappen (X)
2
Algorithms and Computation - Tetsuo Asano; Yoshihide Igarashi; Hiroshi Nagamochi; Satoru Miyano; Subhash Suri
Bestellen
bei Springer.com
€ 74,96
Bestellen
Details und Versand
gesponserter Link

Tetsuo Asano; Yoshihide Igarashi; Hiroshi Nagamochi; Satoru Miyano; Subhash Suri:

Algorithms and Computation - neues Buch

ISBN: 9783540496335

Computer Science; Theory of Computation; Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Computer Communication Networks; Computer Graphics; Computational Math… Mehr…

  - Versandkosten:zzgl. Versandkosten
zuklappen (X)
3
Algorithms and Computation - Tetsuo Asano; Yoshihide Igarashi; Hiroshi Nagamochi; Satoru Miyano; Subhash Suri
Bestellen
bei Springer.com
€ 74,96
Bestellen
Details und Versand
gesponserter Link
Tetsuo Asano; Yoshihide Igarashi; Hiroshi Nagamochi; Satoru Miyano; Subhash Suri:
Algorithms and Computation - neues Buch

ISBN: 9783540496335

Computer Science; Theory of Computation; Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Computer Communication Networks; Computer Graphics; Computational Math… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
4
Algorithms and Computation - Tetsuo Asano; Yoshihide Igarashi; Hiroshi Nagamochi; Satoru Miyano; Subhash Suri
Bestellen
bei Springer.com
€ 74,96
Bestellen
Details und Versand
gesponserter Link
Tetsuo Asano; Yoshihide Igarashi; Hiroshi Nagamochi; Satoru Miyano; Subhash Suri:
Algorithms and Computation - neues Buch

ISBN: 9783540496335

Computer Science; Theory of Computation; Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Computer Communication Networks; Computer Graphics; Computational Math… 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:

9783540496335

Detailangaben zum Buch - Algorithms and Computation


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

Buch in der Datenbank seit 2017-01-29T17:51:17+01:00 (Zurich)
Detailseite zuletzt geändert am 2021-10-05T15:19:09+02:00 (Zurich)
ISBN/EAN: 9783540496335

ISBN - alternative Schreibweisen:
978-3-540-49633-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: algorithms

Daten vom Verlag:

Autor/in: Tetsuo Asano; Yoshihide Igarashi; Hiroshi Nagamochi; Satoru Miyano; Subhash Suri
Titel: Lecture Notes in Computer Science; Algorithms and Computation - 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings
Verlag: Springer; Springer Berlin
458 Seiten
Erscheinungsjahr: 2005-10-20
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
X, 458 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithmische Geometrie; Graph-Algorithmen; Kombinatorik; Komplexitätstheorie; Netzwerkbetrieb; Routing; Variable; algorithm; algorithms; automata; combinatorics; complexity; complexity theory; computational geometry; cryptography; algorithm analysis and problem complexity; C; Theory of Computation; Algorithms; Computer Communication Networks; Computer Graphics; Computational Mathematics and Numerical Analysis; Computer Science; Algorithmen und Datenstrukturen; Netzwerk-Hardware; Grafikprogrammierung; Numerische Mathematik; BC

Applications of a numbering scheme for polygonal obstacles in the plane.- Multicast communication in high speed networks.- Incremental convex hull algorithms are not output sensitive.- Separating and shattering long line segments.- Optimal line bipartitions of point sets.- Interval finding and its application to data mining.- On the approximability of the Steiner tree problem in phylogeny.- Approximation and special cases of common subtrees and editing distance.- Two-dimensional dynamic dictionary matching.- Discovering unbounded unions of regular pattern languages from positive examples.- Extremal problems for geometric hypergraphs.- Computing fair and bottleneck matchings in geometric graphs.- Computing the maximum overlap of two convex polygons under translations.- OBDDs of a monotone function and of its prime implicants.- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs.- Graph searching on chordal graphs.- An algorithm for enumerating all directed spanning trees in a directed graph.- Vertex ranking of asteroidal triple-free graphs.- Recursively divisible problems.- StUSPACE(log n) ?-DSPACE(log2 n/log log n).- Finding edge-disjoint paths in partial k-trees.- Optimal augmentation for bipartite componentwise biconnectivity in linear time.- Towards more precise parallel biconnectivity approximation.- The complexity of probabilistic versus deterministic finite automata.- Bounded length UCFG equivalence.- The Steiner Minimal Tree problem in the ?-geometry plane.- A study of the LMT-skeleton.- A new subgraph of minimum weight triangulations.- Dynamic tree routing under the “matching with consumption” model.- Dimension-exchange token distribution on the mesh and the torus.- Directed hamiltonian packing in d-dimensional meshes and itsapplication.- k-pairs non-crossing shortest paths in a simple polygon.- Minimum convex partition of a polygon with holes by cuts in given directions.- Efficient list ranking on the reconfigurable mesh, with applications.- Periodic merging networks.- Minimizing wavelengths in an all-optical ring network.- Competitive analysis of on-line disk scheduling.- Scheduling interval ordered tasks with non-uniform deadlines.- Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis.- The multi-variable modular polynomial and its applications to cryptography.- Bounds and algorithms for a practical task allocation model (extended abstract).- Scheduling algorithms for strict multithreaded computations.- On multi-threaded Paging.- A fast and efficient homophonic coding algorithm.- An improvement of the digital cash protocol of Okamoto and Ohta.

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

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

< zum Archiv...