LATIN 2004: Theoretical informatics. 6th Latin American symposium, Buenos Aires, Argentina, April 5--8, 2004. Proceedings. (Q1884193)

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 0989.00058). Indexed articles: \textit{Laber, Sany; Carmo, Renato; Kohayakawa, Yoshiharu}, Querying priced information in databases: the conjunctive case, 6-15 [Zbl 1196.68072] \textit{Ergun, Funda; Muthukrishnan, S.; Sahinalp, S. Cenk}, Sublinear methods for detecting periodic trends in data streams, 16-28 [Zbl 1196.68080] \textit{Cormode, Graham; Muthukrishnan, S.}, An improved data stream summary: the Count-Min Sketch and its applications, 29-38 [Zbl 1196.68057] \textit{Fredriksson, Kimmo; Mäkinen, Veli; Navarro, Gonzalo}, Rotation and lighting invariant template matching, 39-48 [Zbl 1196.68216] \textit{Díaz, Josep; Serna, Maria J.; Wormald, Nicholas C.}, Computation of the bisection width for random \(d\)-regular graphs, 49-58 [Zbl 1196.05095] \textit{Borgs, Christian; Chayes, Jennifer T.; Mertens, Stephan; Pittel, Boris}, Constrained integer partitions, 59-68 [Zbl 1196.90101] \textit{Flaxman, Abraham; Gamarnik, David; Sorkin, Gregory B.}, Embracing the giant component, 69-79 [Zbl 1196.05096] \textit{Achlioptas, Dimitris; Molloy, Mike; Moore, Cristopher; Bussel, Frank Van}, Sampling grid colorings with fewer colors, 80-89 [Zbl 1196.05027] \textit{Hemaspaandra, Lane A.; Ogihara, Mitsunori; Zaki, Mohammed J.; Zimand, Marius}, The complexity of finding top-Toda-equivalence-class members, 90-99 [Zbl 1196.68107] \textit{Feder, Tomás; Hell, Pavol; Klein, Sulamita; Nogueira, Loana Tito; Protti, Fábio}, List partitions of chordal graphs, 100-108 [Zbl 1196.05060] \textit{Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M.}, Bidimensional parameters and local treewidth, 109-118 [Zbl 1196.68169] \textit{Gurski, Frank; Wanke, Egon}, Vertex disjoint paths on clique-width bounded graphs, 119-128 [Zbl 1196.68173] \textit{Gardi, Frédéric}, On partitioning interval and circular-arc graphs into proper interval subgraphs with applications, 129-140 [Zbl 1196.05077] \textit{Fraigniaud, Pierre; Gasieniec, Leszek; Kowalski, Dariusz R.; Pelc, Andrzej}, Collective tree exploration, 141-151 [Zbl 1196.68171] \textit{Üngör, Alper}, Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations, 152-161 [Zbl 1196.68300] \textit{Brönnimann, Hervé; Chan, Timothy M.}, Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time, 162-171 [Zbl 1196.68296] \textit{Gutierrez, Claudio; Gutierrez, Flavio; Rivara, Maria-Cecilia}, A geometric approach to the bisection method, 172-180 [Zbl 1196.68299] \textit{Dai, H. K.; Zhang, X. W.}, Improved linear expected-time algorithms for computing maxima, 181-192 [Zbl 1196.68298] \textit{Kohrt, Jens S.; Pruhs, Kirk}, A constant approximation algorithm for sorting buffers, 193-202 [Zbl 1196.90049] \textit{Pruhs, Kirk; Woeginger, Gerhard J.}, Approximation schemes for a class of subset selection problems, 203-211 [Zbl 1196.90106] \textit{Gubbala, Prabhakar; Raghavachari, Balaji}, Finding \(k\)-connected subgraphs with minimum average weight, 212-221 [Zbl 1196.68172] \textit{Yang, Ke}, On the (im)possibility of non-interactive correlation distillation, 222-231 [Zbl 1196.94038] \textit{Diekert, Volker; Gastin, Paul}, Pure future local temporal logics are expressively complete for Mazurkiewicz traces, 232-241 [Zbl 1196.68155] \textit{Lombardy, Sylvain; Sakarovitch, Jacques}, How expressions can code for automata, 242-251 [Zbl 1196.68120] \textit{Akiyama, Shigeki; Bassino, Frédérique; Frougny, Christiane}, Automata for arithmetic Meyer sets, 252-261 [Zbl 1196.68116] \textit{Bodirsky, Manuel; Gärtner, Tobias; von Oertzen, Timo; Schwinghammer, Jan}, Efficiently computing the density of regular languages, 262-270 [Zbl 1196.68118] \textit{Crochemore, Maxime; Iliopoulos, Costas S.; Mohamed, Manal; Sagot, Marie-France}, Longest repeats with a block of don't cares, 271-278 [Zbl 1196.68347] \textit{Rhodes, John; Steinberg, Benjamin}, Join irreducible pseudovarieties, group mapping, and Kovács-Newman semigroups., 279-291 [Zbl 1187.20065] \textit{Carton, Olivier; Rispal, Chloé}, Complementation of rational sets on scattered linear orderings of finite rank, 292-301 [Zbl 1196.68119] \textit{Kiwi, Marcos; Loebl, Martin; Matoušek, Jiří}, Expected length of the longest common subsequence for large alphabets, 302-311 [Zbl 1196.68179] \textit{Seroussi, Gadiel}, Universal types and simulation of individual sequences, 312-321 [Zbl 1196.94037] \textit{Cohen, Gérard; Schaathun, Hans Georg}, Separating codes: constructions and bounds, 322-328 [Zbl 1196.68079] \textit{Bespamyatnikh, Sergei}, Encoding homotopy of paths in the plane, 329-338 [Zbl 1196.68295] \textit{Caminiti, Saverio; Finocchi, Irene; Petreschi, Rossella}, A unified approach to coding labeled trees, 339-348 [Zbl 1196.68078] \textit{Brönnimann, Hervé; Glisse, Marc}, Cost-optimal trees for ray shooting, 349-358 [Zbl 1196.68297] \textit{Miyazawa, Flavio Keidi; Wakabayashi, Yoshiko}, Packing problems with orthogonal rotations, 359-368 [Zbl 1196.90105] \textit{Newman, Alantha; Ruhl, Matthias}, Combinatorial problems on strings with applications to protein folding, 369-378 [Zbl 1196.68322] \textit{Cieliebak, Mark; Eidenbenz, Stephan}, Measurement errors make the partial digest problem NP-hard, 379-390 [Zbl 1196.68100] \textit{Cardinal, Jean; Langerman, Stefan}, Designing small keyboards is hard, 391-400 [Zbl 1196.68098] \textit{Lee, James R.; Mendel, Manor; Naor, Assaf}, Metric structures in \(L _{1}\): dimension, snowflakes, and average distortion, 401-412 [Zbl 1196.68310] \textit{Lipton, Richard J.; Markakis, Evangelos}, Nash equilibria via polynomial equations, 413-422 [Zbl 1196.91012] \textit{Jothi, Raja; Raghavachari, Balaji}, Minimum latency tours and the \(k\)-traveling repairmen problem, 423-433 [Zbl 1196.90104] \textit{Bansal, Nikhil; Pruhs, Kirk}, Server scheduling in the weighted \(\ell_p\) norm, 434-443 [Zbl 1196.68027] \textit{Fürer, Martin}, An improved communication-randomness tradeoff, 444-454 [Zbl 1196.68103] \textit{Gastin, Paul; Lerman, Benjamin; Zeitoun, Marc}, Distributed games and distributed control for asynchronous systems, 455-465 [Zbl 1196.68157] \textit{Bădoiu, Mihai; Demaine, Erik D.}, A simplified and dynamic unified structure, 466-473 [Zbl 1196.68056] \textit{Akhavi, Ali; Dos Santos, Céline Moreira}, Another view of the Gaussian algorithm, 474-487 [Zbl 1196.68353] \textit{Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid}, Generating maximal independent sets for hypergraphs with bounded edge-intersections, 488-498 [Zbl 1196.05057] \textit{Jansson, Jesper; Ng, Joseph H.-K.; Sadakane, Kunihiko; Sung, Wing-Kin}, Rooted maximum agreement supertrees, 499-508 [Zbl 1196.68108] \textit{Hemaspaandra, Edith; Spakowski, Holger; Thakur, Mayur}, Complexity of cycle length modularity problems in graphs, 509-518 [Zbl 1196.68106] \textit{Guller, Dušan}, Procedural semantics for fuzzy disjunctive programs on residuated lattices, 519-529 [Zbl 1196.68032] \textit{Tveretina, Olga; Zantema, Hans}, A proof system and a decision procedure for equality logic, 530-539 [Zbl 1196.03045] \textit{Arratia, Argimiro; Ortiz, Carlos E.}, Approximating the expressive power of logics in finite models, 540-556 [Zbl 1196.68096] \textit{von zur Gathen, Joachim}, Arithmetic circuits for discrete logarithms, 557-566 [Zbl 1196.94072] \textit{Edmonds, Jeff}, On the competitiveness of AIMD-TCP within a general network, 567-576 [Zbl 1196.68029] \textit{Cieliebak, Mark}, Gathering non-oblivious mobile robots, 577-588 [Zbl 1196.68283] \textit{Mans, Bernard; Shparlinski, Igor}, Bisecting and gossiping in circulant graphs, 589-598 [Zbl 1196.68175] \textit{Flocchini, Paola; Kranakis, Evangelos; Krizanc, Danny; Santoro, Nicola; Sawchuk, Cindy}, Multiple mobile agent rendezvous in a ring, 599-608 [Zbl 1196.68021] \textit{Elson, Jeremy; Karp, Richard M.; Papadimitriou, Christos H.; Shenker, Scott}, Global synchronization in sensornets, 609-624 [Zbl 1196.68024]