Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings de Toshihide Ibaraki

Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings: Lecture Notes in Computer Science, cartea 650

Editat de Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
en Limba Engleză Paperback – 26 noi 1992
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33117 lei

Preț vechi: 41396 lei
-20%

Puncte Express: 497
Preț estimativ în valută:
5855€ • 6959$ • 5080£

Carte tipărită la comandă

Livrare economică 12-26 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540562795
ISBN-10: 3540562796
Pagini: 532
Ilustrații: XII, 516 p.
Dimensiuni: 216 x 279 x 28 mm
Greutate: 0.74 kg
Ediția:1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.