6. LATIN 2004:
Buenos Aires,
Argentina
Martin Farach-Colton (Ed.):
LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings.
Lecture Notes in Computer Science 2976 Springer 2004, ISBN 3-540-21258-2 BibTeX
@proceedings{DBLP:conf/latin/2004,
editor = {Martin Farach-Colton},
title = {LATIN 2004: Theoretical Informatics, 6th Latin American Symposium,
Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
booktitle = {LATIN},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2976},
year = {2004},
isbn = {3-540-21258-2},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Speakers
Contributions
- Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa:
Querying Priced Information in Databases: The Conjunctive Case.
6-15
Electronic Edition (link) BibTeX
- Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp:
Sublinear Methods for Detecting Periodic Trends in Data Streams.
16-28
Electronic Edition (link) BibTeX
- Graham Cormode, S. Muthukrishnan:
An Improved Data Stream Summary: The Count-Min Sketch and Its Applications.
29-38
Electronic Edition (link) BibTeX
- Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro:
Rotation and Lighting Invariant Template Matching.
39-48
Electronic Edition (link) BibTeX
- Josep Díaz, Maria J. Serna, Nicholas C. Wormald:
Computation of the Bisection Width for Random d-Regular Graphs.
49-58
Electronic Edition (link) BibTeX
- Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris Pittel:
Constrained Integer Partitions.
59-68
Electronic Edition (link) BibTeX
- Abraham Flaxman, David Gamarnik, Gregory B. Sorkin:
Embracing the Giant Component.
69-79
Electronic Edition (link) BibTeX
- Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel:
Sampling Grid Colorings with Fewer Colors.
80-89
Electronic Edition (link) BibTeX
- Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand:
The Complexity of Finding Top-Toda-Equivalence-Class Members.
90-99
Electronic Edition (link) BibTeX
- Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
List Partitions of Chordal Graphs.
100-108
Electronic Edition (link) BibTeX
- Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth.
109-118
Electronic Edition (link) BibTeX
- Frank Gurski, Egon Wanke:
Vertex Disjoint Paths on Clique-Width Bounded Graphs.
119-128
Electronic Edition (link) BibTeX
- Frédéric Gardi:
On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications.
129-140
Electronic Edition (link) BibTeX
- Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc:
Collective Tree Exploration.
141-151
Electronic Edition (link) BibTeX
- Alper Üngör:
O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations.
152-161
Electronic Edition (link) BibTeX
- Hervé Brönnimann, Timothy M. Chan:
Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time.
162-171
Electronic Edition (link) BibTeX
- Claudio Gutiérrez, Flavio Gutierrez, Maria-Cecilia Rivara:
A Geometric Approach to the Bisection Method.
172-180
Electronic Edition (link) BibTeX
- H. K. Dai, Xi-Wen Zhang:
Improved Linear Expected-Time Algorithms for Computing Maxima.
181-192
Electronic Edition (link) BibTeX
- Jens S. Kohrt, Kirk Pruhs:
A Constant Approximation Algorithm for Sorting Buffers.
193-202
Electronic Edition (link) BibTeX
- Kirk Pruhs, Gerhard J. Woeginger:
Approximation Schemes for a Class of Subset Selection Problems.
203-211
Electronic Edition (link) BibTeX
- Prabhakar Gubbala, Balaji Raghavachari:
Finding k-Connected Subgraphs with Minimum Average Weight.
212-221
Electronic Edition (link) BibTeX
- Ke Yang:
On the (Im)possibility of Non-interactive Correlation Distillation.
222-231
Electronic Edition (link) BibTeX
- Volker Diekert, Paul Gastin:
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces.
232-241
Electronic Edition (link) BibTeX
- Sylvain Lombardy, Jacques Sakarovitch:
How Expressions Can Code for Automata.
242-251
Electronic Edition (link) BibTeX
- Shigeki Akiyama, Frédérique Bassino, Christiane Frougny:
Automata for Arithmetic Meyer Sets.
252-261
Electronic Edition (link) BibTeX
- Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer:
Effciently Computing the Density of Regular Languages.
262-270
Electronic Edition (link) BibTeX
- Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot:
Longest Repeats with a Block of Don't Cares.
271-278
Electronic Edition (link) BibTeX
- John Rhodes, Benjamin Steinberg:
Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups.
279-291
Electronic Edition (link) BibTeX
- Olivier Carton, Chloe Rispal:
Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank.
292-301
Electronic Edition (link) BibTeX
- Marcos A. Kiwi, Martin Loebl, Jirí Matousek:
Expected Length of the Longest Common Subsequence for Large Alphabets.
302-311
Electronic Edition (link) BibTeX
- Gadiel Seroussi:
Universal Types and Simulation of Individual Sequences.
312-321
Electronic Edition (link) BibTeX
- Gérard D. Cohen, Hans Georg Schaathun:
Separating Codes: Constructions and Bounds.
322-328
Electronic Edition (link) BibTeX
- Sergei Bespamyatnikh:
Encoding Homotopy of Paths in the Plane.
329-338
Electronic Edition (link) BibTeX
- Saverio Caminiti, Irene Finocchi, Rossella Petreschi:
A Unified Approach to Coding Labeled Trees.
339-348
Electronic Edition (link) BibTeX
- Hervé Brönnimann, Marc Glisse:
Cost-Optimal Trees for Ray Shooting.
349-358
Electronic Edition (link) BibTeX
- Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Packing Problems with Orthogonal Rotations.
359-368
Electronic Edition (link) BibTeX
- Alantha Newman, Matthias Ruhl:
Combinatorial Problems on Strings with Applications to Protein Folding.
369-378
Electronic Edition (link) BibTeX
- Mark Cieliebak, Stephan Eidenbenz:
Measurement Errors Make the Partial Digest Problem NP-Hard.
379-390
Electronic Edition (link) BibTeX
- Jean Cardinal, Stefan Langerman:
Designing Small Keyboards Is Hard.
391-400
Electronic Edition (link) BibTeX
- James R. Lee, Manor Mendel, Assaf Naor:
Metric Structures in L1: Dimension, Snowflakes, and Average Distortion.
401-412
Electronic Edition (link) BibTeX
- Richard J. Lipton, Evangelos Markakis:
Nash Equilibria via Polynomial Equations.
413-422
Electronic Edition (link) BibTeX
- Raja Jothi, Balaji Raghavachari:
Minimum Latency Tours and the k-Traveling Repairmen Problem.
423-433
Electronic Edition (link) BibTeX
- Nikhil Bansal, Kirk Pruhs:
Server Scheduling in the Weighted lp Norm.
434-443
Electronic Edition (link) BibTeX
- Martin Fürer:
An Improved Communication-Randomness Tradeo.
444-454
Electronic Edition (link) BibTeX
- Paul Gastin, Benjamin Lerman, Marc Zeitoun:
Distributed Games and Distributed Control for Asynchronous Systems.
455-465
Electronic Edition (link) BibTeX
- Mihai Badoiu, Erik D. Demaine:
A Simplified, Dynamic Unified Structure.
466-473
Electronic Edition (link) BibTeX
- Ali Akhavi, Céline Moreira Dos Santos:
Another View of the Gaussian Algorithm.
474-487
Electronic Edition (link) BibTeX
- Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections.
488-498
Electronic Edition (link) BibTeX
- Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung:
Rooted Maximum Agreement Supertrees.
499-508
Electronic Edition (link) BibTeX
- Edith Hemaspaandra, Holger Spakowski, Mayur Thakur:
Complexity of Cycle Length Modularity Problems in Graphs.
509-518
Electronic Edition (link) BibTeX
- Dusan Guller:
Procedural Semantics for Fuzzy Disjunctive Programs on Residuated Lattices.
519-529
Electronic Edition (link) BibTeX
- Olga Tveretina, Hans Zantema:
A Proof System and a Decision Procedure for Equality Logic.
530-539
Electronic Edition (link) BibTeX
- Argimiro Arratia, Carlos E. Ortiz:
Approximating the Expressive Power of Logics in Finite Models.
540-556
Electronic Edition (link) BibTeX
- Joachim von zur Gathen:
Arithmetic Circuits for Discrete Logarithms.
557-566
Electronic Edition (link) BibTeX
- Jeff Edmonds:
On the Competitiveness of AIMD-TCP within a General Network.
567-576
Electronic Edition (link) BibTeX
- Mark Cieliebak:
Gathering Non-oblivious Mobile Robots.
577-588
Electronic Edition (link) BibTeX
- Bernard Mans, Igor Shparlinski:
Bisecting and Gossiping in Circulant Graphs.
589-598
Electronic Edition (link) BibTeX
- Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Nicola Santoro, Cindy Sawchuk:
Multiple Mobile Agent Rendezvous in a Ring.
599-608
Electronic Edition (link) BibTeX
- Jeremy Elson, Richard M. Karp, Christos H. Papadimitriou, Scott Shenker:
Global Synchronization in Sensornets.
609-624
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:28:32 2009
by Michael Ley (ley@uni-trier.de)
