LATIN '95: Theoretical informatics. 2nd Latin American symposium, Valparaíso, Chile, April 3--7, 1995. Proceedings (Q1805034)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Abello, James; Kumar, Krishna}, Visibility graphs of 2-spiral polygons (extended abstract), 1-15 [Zbl 1495.68235] \textit{Alonso, L.; Schott, R.}, Random generation of colored trees, 16-35 [Zbl 1495.68160] \textit{Asano, Tetsuo; Ranjan, Desh; Roos, Thomas; Welzl, Emo; Widmayer, Peter}, Space filling curves and their use in the design of geometric data structures, 36-48 [Zbl 1495.68236] \textit{Balasubramanian, R.; Raman, Venkatesh; Srinivasaraghavan, G.}, Tight bounds for finding degrees from the adjacency matrix, 49-59 [Zbl 1495.68161] \textit{Mix Barrington, David; Straubing, Howard}, Lower bounds for modular counting by circuits with modular gates, 60-71 [Zbl 1495.68066] \textit{Becker, Bernd; Drechsler, Rolf; Werchner, Ralph}, On the relation between BDDs and FDDs (extended abstract), 72-83 [Zbl 1495.68046] \textit{Blanchard, F.; Maass, A.}, On dynamical properties of generalized toggle automata, 84-98 [Zbl 1495.68146] \textit{Bloom, Stephen L.; Ésik, Zoltán}, Free shuffle algebras in language varieties (extended abstract), 99-111 [Zbl 1495.68144] \textit{Bradford, Phillip G.; Choppella, Venkatesh; Rawlins, Gregory J. E.}, Lower bounds for the matrix chain ordering problem (extended abstract), 112-130 [Zbl 1495.68092] \textit{Brands, Stefan}, Off-line electronic cash based on secret-key certificates, 131-166 [Zbl 1495.94046] \textit{Bruyère, Véronique; Hansel, Georges}, Recognizable sets of numbers in nonstandard bases, 167-179 [Zbl 07572141] \textit{Buntrock, Gerhard; Niemann, Gundula}, On weak growing context-sensitive grammars, 180-194 [Zbl 1495.68110] \textit{Bedregal, Benjamín R. Callejas; Acióly, Benedito Melo}, Logic of Plotkin continuous domain, 195-206 [Zbl 1495.03049] \textit{Chaudhuri, Shiva; Dubhashi, Devdatt}, (Probabilistic) recurrence relations revisited, 207-219 [Zbl 1495.68246] \textit{Crochemore, Maxime; Rytter, Wojciech}, On linear-time alphabet-independent 2-dimensional pattern matching, 220-229 [Zbl 1495.68243] \textit{Durand-Lose, Jérôme Olivier}, Reversible cellular automaton able to simulate any other reversible one using partitioning automata, 230-244 [Zbl 1495.68147] \textit{Eades, Peter; Whitesides, Sue}, Nearest neighbour graph realizability is NP-hard, 245-256 [Zbl 1495.68166] \textit{Fernández-Baca, David; Slutzki, Giora}, Linear-time algorithms for parametric minimum spanning tree problems on planar graphs, 257-271 [Zbl 1495.68167] \textit{Feuerstein, Esteban}, Paging more than one page, 272-285 [Zbl 1495.68039] \textit{de Figueiredo, Celina M. H.; Meidanis, João; Picinin de Mello, Célia}, On edge-colouring indifference graphs, 286-299 [Zbl 1498.05094] \textit{Galbiati, Giulia; Morzenti, Angelo; Maffioli, Francesco}, On the approximability of some maximum spanning tree problems, 300-310 [Zbl 1495.68172] \textit{Gao, Shuhong; von zur Gathen, Joachim; Panario, Daniel}, Gauss periods and fast exponentiation in finite fields (extended abstract), 311-322 [Zbl 0906.11056] \textit{Gasarch, William I.; Guimarães, Katia S.}, Unbounded search and recursive graph problems, 323-331 [Zbl 1495.68173] \textit{González-Vega, Laureano}, On the complexity of computing the greatest common divisor of several univariate polynomials, 332-345 [Zbl 07572153] \textit{Gruska, J.; Monti, A.; Napoli, M.; Parente, D.}, State complexity of SBTA languages, 346-357 [Zbl 1495.68122] \textit{Herzog, Christian}, Pushdown automata with bounded nondeterminism and bounded ambiguity, 358-370 [Zbl 1495.68123] \textit{Macarie, Ioan I.}, Multihead two-way probabilistic finite automata (extended abstract), 371-385 [Zbl 1495.68124] \textit{Margenstern, Maurice}, Non-erasing Turing machines: a new frontier between a decidable halting problem and universality, 386-397 [Zbl 1495.68056] \textit{Matamala, Martín; Goles, Eric}, Cyclic automata networks on finite graphs, 398-410 [Zbl 1495.68148] \textit{Meidanis, Joào; Setubal, Joào C.}, Multiple alignment of biological sequences with gap flexibility, 411-426 [Zbl 1495.68253] \textit{Meinel, Christoph; Waack, Stephan}, Lower bounds for the modular communication complexity of various graph accessibility problems, 427-435 [Zbl 1495.68083] \textit{Mundhenk, M.}, On monotonous oracle machines, 436-448 [Zbl 1495.68057] \textit{Oommen, B. John; de St. Croix, Edward V.}, On using learning automata for fast graph partitioning, 449-460 [Zbl 1495.68181] \textit{Prodinger, Helmut}, Solution of a problem of Yekutieli and Mandelbrot, 461-468 [Zbl 1495.68183] \textit{Richard, Gilles; Saubion, Frédéric}, A rewrite approach for constraint logic programming, 469-482 [Zbl 1495.68033] \textit{Róka, Zsuzsanna}, Simulations between cellular automata on Cayley graphs, 483-493 [Zbl 1495.68149] \textit{Wang, Farn}, A temporal logic for real-time partial-ordering with named transactions, 494-508 [Zbl 1495.68142] \textit{Yamakawa, Peter M.; Ebara, Hiroyuki; Nakano, Hideo}, A new approach for routing in arrangement graphs and its performance evaluation, 509-523 [Zbl 1495.68184]