Algorithms and Computation [[electronic resource] ] : Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings / / edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992
• Edizione: 1st ed. 1992.
• Descrizione fisica: 1 online resource (XII, 516 p.)
• Disciplina: 005.73
• Soggetto topico: Data structures (Computer science); Computers; Computer mathematics; Combinatorics; Probabilities; Data Structures; Theory of Computation; Computational Mathematics and Numerical Analysis; Computation by Abstract Devices; Probability Theory and Stochastic Processes
• Persona (resp. second.): IbarakiToshihide; InagakiYasuyoshi; IwamaKazuo; NishizekiT <1947-2022, > (Takao); YamashitaMasafumi
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di contenuto: 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.
• Sommario/riassunto: 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 Tokyo in 1990, as the first international symposium organized by SIGAL (Special Interest Groupon Algorithms in the Information Processing Society of Japan) to serve as anannual international forum in Asia for researchers in the area of algorithms. The second symposium was held in Taipei, Taiwan in 1991, where it was decided that computation would be included in the main scope of the symposium and that ISAAC would be its name. ISAAC '92 focuses on topics in design and analysis of algorithms, computational complexity, and theory of computation, including algorithms and data structures, parallel/distributed computing, automata and formal languages, probabilistic/approximation algorithms, computability and complexity, term rewriting systems, and computational geometry. The volume contains the accepted contributed papers and the invited papers.
• Titolo autorizzato: Algorithms and Computation
• ISBN: 3-540-47501-X
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996465513903316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 650