- 5 Resultados
precio mínimo: € 45,45, precio máximo: € 57,23, precio promedio: € 52,63
1
Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings Toshihide Ibaraki Editor
Pedir
por BarnesandNoble.com
€ 54,99
Pedir
Detalles y envío
Enlace patrocinado

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

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… Más…

new in stock. Gastos de envío:zzgl. Versandkosten., más gastos de envío
cerrar (X)
2
Algorithms and Computation
Pedir
por Springer.com
€ 53,49
Envío: € 0,001
Pedir
Detalles del proveedor
Enlace patrocinado
Algorithms and Computation - libro nuevo

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… Más…

Nr. 978-3-540-56279-5. Gastos de envío:Worldwide free shipping, , zzgl. Versandkosten. (EUR 0.00)
cerrar (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)
Pedir
por Amazon.de (Intern. Bücher)
€ 57,23
Envío: € 0,001
Pedir
Detalles del proveedor
Enlace patrocinado
Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992 Proceedings (Lecture Notes in Computer Science, 650, Band 650) - Pasta blanda

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… Más…

Gastos de envío:Auf Lager, Lieferung von Amazon. (EUR 0.00) Amazon.de
cerrar (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)
Pedir
por Amazon.de (Intern. Bücher)
€ 51,98
Envío: € 3,001
Pedir
Detalles del proveedor
Enlace patrocinado
Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992 Proceedings (Lecture Notes in Computer Science, 650, Band 650) - Pasta blanda

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… Más…

Gastos de envío:Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00)
cerrar (X)
5
Algorithms and Computation - Ibaraki, Toshihide Inagaki, Yasuyoshi Iwama, Kazuo Nishizeki, Takao Yamashita, Masafumi
Pedir
por booklooker.de
€ 45,45
Envío: € 0,001
Pedir
Detalles del proveedor
Enlace patrocinado
Ibaraki, Toshihide Inagaki, Yasuyoshi Iwama, Kazuo Nishizeki, Takao Yamashita, Masafumi:
Algorithms and Computation - Primera edición

1992, ISBN: 9783540562795

Pasta blanda

[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… Más…

Gastos de envío:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Moluna GmbH
cerrar (X)
1Dado que algunas plataformas no nos comunican las condiciones de envío y éstas pueden depender del país de entrega, del precio de compra, del peso y tamaño del artículo, de una posible membresía a la plataforma, de una entrega directa por parte de la plataforma o a través de un tercero (Marketplace), etc., es posible que los gastos de envío indicados por eurolibro/terralibro no concuerden con los de la plataforma ofertante.

Datos bibliográficos del mejor libro coincidente

Detalles del libro
Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992 Proceedings (Lecture Notes in Computer Science, 650, Band 650)
Autor:
Título:
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.

Detalles del libro - 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
Tapa dura
Tapa blanda
Año de publicación: 1992
Editorial: Ibaraki, Toshihide, Springer
532 Páginas
Peso: 0,795 kg
Idioma: eng/Englisch

Libro en la base de datos desde 2007-11-01T10:10:08-06:00 (Mexico City)
Página de detalles modificada por última vez el 2024-03-31T02:32:40-06:00 (Mexico City)
ISBN/EAN: 3540562796

ISBN - escritura alterna:
3-540-56279-6, 978-3-540-56279-5
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: inagaki, yamashita, kazuo, ibar
Título del libro: nagoya, algorithms computation, computer algorithms, not, proceedings third symposium, lecture notes computer science, science 1992, ufo symposium, 650

Datos del la editorial

Autor: Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama; Takao Nishizeki; Masafumi Yamashita
Título: Lecture Notes in Computer Science; Algorithms and Computation - Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings
Editorial: Springer; Springer Berlin
516 Páginas
Año de publicación: 1992-11-26
Berlin; Heidelberg; DE
Idioma: Inglés
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.
< para archivar...