Algorithms and Computation - neues Buch

EAN (ISBN-13): 9783540486534
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-01-29T17:51:17+01:00 (Vienna)
Detailseite zuletzt geändert am 2018-11-06T11:13:20+01:00 (Vienna)
ISBN/EAN: 9783540486534

ISBN - alternative Schreibweisen:
978-3-540-48653-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: zhang
Titel des Buches: algorithms

---

Daten vom Verlag:

Autor/in: Ding-Zhu Du; Xiang-Sun Zhang
Titel: Lecture Notes in Computer Science; Algorithms and Computation - 5th International Symposium, ISAAC '94, Beijing, P.R. China, August 25 - 27, 1994. Proceedings
Verlag: Springer; Springer Berlin
693 Seiten
Erscheinungsjahr: 2005-07-14
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XV, 693 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Boolean function; Computation; Erfüllbarkeitsproblem der Aussagenlogik; Public Key; algorithms; automata; calculus; combinatorics; communication; complexity; computational geometry; geometry; learning; programming; sets; data structures; algorithm analysis and problem complexity; C; Theory of Computation; Data Science; Algorithms; Discrete Mathematics; Artificial Intelligence; Computer Science; Datenbanken; Algorithmen und Datenstrukturen; Diskrete Mathematik; Künstliche Intelligenz; BC

Polynomial equations-solving and its applications.- Quasi-random combinatorial structures.- Hamiltonian abstract Voronoi diagrams in linear time.- Every set of disjoint line segments admits a binary tree.- The traveling cameraman problem, with applications to automatic optical inspection.- On determining the congruity of point sets in higher dimensions.- On random hard sets for NP.- Computing solutions uniquely collapses the polynomial hierarchy.- Verifying the determinant in parallel.- Hardness of approximating graph transformation problem.- Randomized wait-free naming.- Unifying themes for network selection.- Robust asynchronous algorithms in networks with a fault detection ring.- Distributed algorithms for finding small cycle covers in arbitrary networks.- A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming.- Analysis of the convergency of topology preserving neural networks on learning.- On helping and interactive proof systems.- Average time complexity of the SAT 1.2 algorithm.- Average cost to produce partial orders.- Two notes on low-density subset sum algorithm.- Rotation distance, triangulations of planar surfaces and hyperbolic geometry.- Finitely representable spatial objects and efficient computation.- Computing all small cuts in undirected networks.- Edge-coloring and f-coloring for various classes of graphs.- Edge-disjoint paths in permutation graphs.- Minimum augmentation to k-edge-connect specified vertices of a graph.- Algorithmic Chernoff-Hoeffding inequalities in integer programming.- Approximate pattern matching with samples.- An efficient optimal algorithm for minimizing the overall communication cost in replicated data management.- Multispace search: A new optimization approach.- Realizing degree sequences in parallel.- Efficient sequential and parallel algorithms for the negative cycle problem.- Fast and efficient operations on Parallel Priority Queues.- Heaps with bits.- Components and projections of curves over finite fields.- On the approximation of finding various minimal, maximal, and consistent sequences.- A linear-time algorithm for computing characteristic strings.- The maximum latency and identification of positive Boolean functions.- Fast deterministic Hot-Potato routing on processor arrays.- k-pairwise cluster fault tolerant routing in hypercubes.- On Steiner minimal trees in grid graphs and its application to VLSI routing.- Optimal routing of permutations on rings.- Resource bounded randomness and weakly complete problems.- Deterministic ? automata vis-a-vis deterministic Buchi automata.- Quantum computation and NP-complete problems.- Separability and one-way functions.- On the approximation of largest common subtrees and largest common point sets.- An approximation scheme for some Steiner tree problems in the plane.- A chain decomposition algorithm for the proof of a property on minimum weight triangulations.- Generating algorithm for quasi-full Steiner tree.- Analysing deletions in competitive self-adjusting linear list algorithms.- Are Fibonacci heaps optimal?.- Simple and efficient graph compression schemes for dense and complement graphs.- Improved algorithms for coloring random graphs.- On the parallel complexity of solving recurrence equations.- Extended graph connectivity and its gradually increasing parallel complexity.- Parallel h-v drawings of binary trees.- An efficient parallel strategy for recognizing series-parallel graphs.- Orthogonal queries in segments and triangles.- Further computational geometry insecondary memory.- Shortest safari routes in simple polygons.- On greedy tetrahedralization of points in 3D.- The totally-perfect bipartite graph and its construction.- k Best Cuts for Circular-Arc graphs.- Revisiting circular arc graphs.- Weighted irredundance of interval graphs.- A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs.- On the size of ordered binary decision diagrams representing threshold functions.- Nonuniform lowness and strong nonuniform lowness.- Definition and existence of super complexity cores.- Efficient algorithms for assigning chain-like tasks on a chain-like network computer.- Manpower scheduling with shift change constraints.- Fast algorithms for transversal matroid intersection problems.- A convex hull algorithm on coarse-grained multiprocessor.- A multiway merging network.- Reporting and counting intersections of lines within a polygon.- A new problem in string searching.- Achieving the shortest clock period by inserting the minimum amount of delay.- A randomized algorithm to Finite Automata Public Key Cryptosystem.