LATIN '95: Theoretical Informatics: Second Latin American Symposium, Valparaiso, Chile, April 3 - 7, 1995. Proceedings: Lecture Notes in Computer Science, cartea 911
Editat de Ricardo Baeza-Yates, Eric Goles, Patricio V. Pobleteen Limba Engleză Paperback – 20 mar 1995
The LATIN symposia are intended to be comprehensive events on the theory of computing; they provide a high-level forum for theoretical computer science research in Latin America and facilitate a strong and healthy interaction with the international community. The 38 papers presented in this volume were carefully selected from 68 submissions. Despite the intended broad coverage there are quite a number of papers devoted to computational graph theory; other topics strongly represented are complexity, automata theory, networks, symbolic computation, formal languages, data structures, and pattern matching.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 341.95 lei
- 20% Preț: 369.12 lei
- 20% Preț: 645.28 lei
- 20% Preț: 591.51 lei
- 15% Preț: 580.46 lei
- Preț: 410.88 lei
- 20% Preț: 504.57 lei
- Preț: 381.21 lei
- 20% Preț: 340.32 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 538.29 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 238.01 lei
- 17% Preț: 360.19 lei
- 20% Preț: 438.69 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 596.46 lei
- 15% Preț: 438.59 lei
- 20% Preț: 655.02 lei
- 20% Preț: 649.49 lei
- 20% Preț: 309.90 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 310.26 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 326.98 lei
- 20% Preț: 825.93 lei
- 17% Preț: 427.22 lei
- 20% Preț: 763.23 lei
- 20% Preț: 350.21 lei
- 20% Preț: 307.71 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 20% Preț: 343.62 lei
- 20% Preț: 583.40 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 353.50 lei
- 20% Preț: 607.39 lei
Preț: 344.76 lei
Preț vechi: 430.94 lei
-20% Nou
Puncte Express: 517
Preț estimativ în valută:
65.98€ • 68.62$ • 55.22£
65.98€ • 68.62$ • 55.22£
Carte tipărită la comandă
Livrare economică 15-29 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540591757
ISBN-10: 3540591753
Pagini: 544
Ilustrații: IX, 530 p.
Dimensiuni: 152 x 229 x 29 mm
Greutate: 0.76 kg
Ediția:1995
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540591753
Pagini: 544
Ilustrații: IX, 530 p.
Dimensiuni: 152 x 229 x 29 mm
Greutate: 0.76 kg
Ediția:1995
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Visibility graphs of 2-spiral polygons (Extended abstract).- Random generation of colored trees.- Space filling curves and their use in the design of geometric data structures.- Tight bounds for finding degrees from the adjacency matrix.- Lower bounds for modular counting by circuits with modular gates.- On the relation between BDDs and FDDs.- On dynamical properties of generalized toggle automata.- Free shuffle algebras in language varieties extended abstract.- Lower bounds for the matrix chain ordering problem.- Off-line electronic cash based on secret-key certificates.- Recognizable sets of numbers in nonstandard bases.- On weak growing context-sensitive grammars.- Logic of plotkin continuous domain.- (Probabilistic) recurrence relations revisited.- On linear-time alphabet-independent 2-dimensional pattern matching.- Reversible cellular automaton able to simulate any other reversible one using partitioning automata.- Nearest neighbour graph realizability is NP-hard.- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs.- Paging more than one page.- On edge-colouring indifference graphs.- On the approximability of some maximum spanning tree problems.- Gauss periods and fast exponentiation in finite fields.- Unbounded search and recursive graph problems.- On the complexity of computing the greatest common divisor of several univariate polynomials.- State complexity of SBTA languages.- Pushdown automata with bounded nondeterminism and bounded ambiguity.- Multihead two-way probabilistic finite automata.- Non-erasing turing machines: A new frontier between a decidable halting problem and universality.- Cyclic automata networks on finite graphs.- Multiple alignment of biological sequences with gap flexibility.- Lower bounds for the modularcommunication complexity of various graph accessibility problems.- On monotonous oracle machines.- On using learning automata for fast graph partitioning.- Solution of a problem of yekutieli and mandelbrot.- A rewrite approach for constraint logic programming.- Simulations between cellular automata on cayley graphs.- A temporal logic for real-time partial-ordering with named transactions.- A new approach for routing in arrangement graphs and its performance evaluation.