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

Algorithms and Computation 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings

Aus der Reihe Lecture Notes in Computer Science

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

27.11.1996

Abbildungen

X, 458 p.

Herausgeber

Tetsuo Asano + weitere

Verlag

Springer Berlin

Seitenzahl

458

Maße (L/B/H)

23,5/15,5/2,6 cm

Gewicht

703 g

Auflage

1996

Sprache

Englisch

ISBN

978-3-540-62048-8

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

27.11.1996

Abbildungen

X, 458 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

458

Maße (L/B/H)

23,5/15,5/2,6 cm

Gewicht

703 g

Auflage

1996

Sprache

Englisch

ISBN

978-3-540-62048-8

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
  • 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.