- 5 Résultats
prix le plus bas: € 45,45, prix le plus élevé: € 57,23, prix moyen: € 52,63
1
Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings Toshihide Ibaraki Editor
Commander
sur BarnesandNoble.com
€ 54,99
Commander
Détails et expédition
Lien sponsorisé

Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings Toshihide Ibaraki Editor - nouveau livre

ISBN: 9783540562795

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… Plus…

new in stock. Frais d'envoizzgl. Versandkosten., Livraison non-comprise
fermer(X)
2
Algorithms and Computation
Commander
sur Springer.com
€ 53,49
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé
Algorithms and Computation - nouveau livre

ISBN: 9783540562795

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… Plus…

Nr. 978-3-540-56279-5. Frais d'envoiWorldwide free shipping, , zzgl. Versandkosten. (EUR 0.00)
fermer(X)
3
Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992 Proceedings (Lecture Notes in Computer Science, 650, Band 650)
Commander
sur Amazon.de (Intern. Bücher)
€ 57,23
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé
Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992 Proceedings (Lecture Notes in Computer Science, 650, Band 650) - Livres de poche

2009

ISBN: 9783540562795

Series Editor: Yamashita, Masafumi, Series Editor: Inagaki, Yasuyoshi, Series Editor: Iwama, Kazuo, Series Editor: Nishizeki, Takao, Springer, Taschenbuch, Auflage: 1992, 528 Seiten, Publ… Plus…

Frais d'envoiAuf Lager, Lieferung von Amazon. (EUR 0.00) Amazon.de
fermer(X)
4
Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992 Proceedings (Lecture Notes in Computer Science, 650, Band 650)
Commander
sur Amazon.de (Intern. Bücher)
€ 51,98
Envoi: € 3,001
Commander
Détails du fournisseur
Lien sponsorisé
Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992 Proceedings (Lecture Notes in Computer Science, 650, Band 650) - Livres de poche

2009, ISBN: 9783540562795

Series Editor: Yamashita, Masafumi, Series Editor: Inagaki, Yasuyoshi, Series Editor: Iwama, Kazuo, Series Editor: Nishizeki, Takao, Springer, Taschenbuch, Auflage: 1992, 528 Seiten, Publ… Plus…

Frais d'envoiDie angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00)
fermer(X)
5
Algorithms and Computation - Ibaraki, Toshihide Inagaki, Yasuyoshi Iwama, Kazuo Nishizeki, Takao Yamashita, Masafumi
Commander
sur booklooker.de
€ 45,45
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé
Ibaraki, Toshihide Inagaki, Yasuyoshi Iwama, Kazuo Nishizeki, Takao Yamashita, Masafumi:
Algorithms and Computation - Première édition

1992, ISBN: 9783540562795

Livres de poche

[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This volume gives the pro… Plus…

Frais d'envoiVersandkostenfrei, Versand nach Deutschland. (EUR 0.00) Moluna GmbH
fermer(X)
1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre
Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992 Proceedings (Lecture Notes in Computer Science, 650, Band 650)
Auteur:
Titre:
ISBN:

3540562796


This volume gives the proceedings of ISAAC '92, the ThirdInternational Symposium on Algorithms and Computation, heldin Nagoya, Japan, December 1992.The first symposium was held in Tokyo in 1990, as the firstinternational symposium organized by SIGAL (Special InterestGroupon Algorithms in the Information Processing Society ofJapan) to serve as anannual international forum in Asia forresearchers in the area of algorithms. The second symposiumwas held in Taipei, Taiwan in 1991, where it was decidedthat computation would be included in the main scope of thesymposium and that ISAAC would be its name.ISAAC '92 focuses on topics in design and analysis ofalgorithms, computational complexity, and theory ofcomputation, including algorithms and data structures,parallel/distributed computing, automata and formallanguages, probabilistic/approximation algorithms,computability and complexity, term rewriting systems, andcomputational geometry. The volume contains the acceptedcontributed papers and the invited papers.

Informations détaillées sur le livre - Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992 Proceedings (Lecture Notes in Computer Science, 650, Band 650)


EAN (ISBN-13): 9783540562795
ISBN (ISBN-10): 3540562796
Version reliée
Livre de poche
Date de parution: 1992
Editeur: Ibaraki, Toshihide, Springer
532 Pages
Poids: 0,795 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2007-11-01T17:10:08+01:00 (Paris)
Page de détail modifiée en dernier sur 2024-03-31T10:32:40+02:00 (Paris)
ISBN/EAN: 3540562796

ISBN - Autres types d'écriture:
3-540-56279-6, 978-3-540-56279-5
Autres types d'écriture et termes associés:
Auteur du livre: inagaki, yamashita, kazuo, ibar
Titre du livre: nagoya, algorithms computation, computer algorithms, not, proceedings third symposium, lecture notes computer science, science 1992, ufo symposium, 650

Données de l'éditeur

Auteur: Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama; Takao Nishizeki; Masafumi Yamashita
Titre: Lecture Notes in Computer Science; Algorithms and Computation - Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings
Editeur: Springer; Springer Berlin
516 Pages
Date de parution: 1992-11-26
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XII, 516 p.

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

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.
< pour archiver...