LATIN '95: Theoretical Informatics
Springer Berlin (Verlag)
978-3-540-59175-7 (ISBN)
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.
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.
| Erscheint lt. Verlag | 20.3.1995 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | IX, 530 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 152 x 229 mm |
| Gewicht | 726 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik | |
| Schlagworte | Algorithm analysis and problem complexity • Algorithmen • Algorithmische Mathematik • Automat • Automata • Automata Theory • Automatentheorie • combinatorics • Complexity • computational mathematics • Computer • Computer Science • data structure • data structures • formal language • Formal Languages • Graphentheorie • graph theory • Informatik • Informatik-Logik • Kombinatorik |
| ISBN-10 | 3-540-59175-3 / 3540591753 |
| ISBN-13 | 978-3-540-59175-7 / 9783540591757 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
