Vor Ort
Merkzettel Warenkorb
  • Produktbild: Algorithms and Computation
  • Produktbild: Algorithms and Computation
Band 650

Algorithms and Computation Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings

Aus der Reihe Lecture Notes in Computer Science

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

26.11.1992

Abbildungen

XII, 516 p.

Herausgeber

Toshihide Ibaraki + weitere

Verlag

Springer Berlin

Seitenzahl

516

Maße (L/B/H)

23,5/15,5/2,9 cm

Gewicht

797 g

Auflage

1992

Sprache

Englisch

ISBN

978-3-540-56279-5

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

26.11.1992

Abbildungen

XII, 516 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

516

Maße (L/B/H)

23,5/15,5/2,9 cm

Gewicht

797 g

Auflage

1992

Sprache

Englisch

ISBN

978-3-540-56279-5

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Algorithms and Computation
  • Produktbild: Algorithms and Computation
  • 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.