Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6. LATIN 2004: Buenos Aires, Argentina
- Martin Farach-Colton
:
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
Invited Speakers
- Mike Paterson:
Analysis of Scheduling Algorithms for Proportionate Fairness. 1 - Yoshiharu Kohayakawa:
Advances in the Regularity Method. 2 - Cynthia Dwork:
Fighting Spam: The Science. 3-4 - Jean-Eric Pin:
The Consequences of Imre Simon's Work in the Theory of Automata, Languages, and Semigroups. 5
Contributions
- Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa:
Querying Priced Information in Databases: The Conjunctive Case. 6-15 - Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp:
Sublinear Methods for Detecting Periodic Trends in Data Streams. 16-28 - Graham Cormode, S. Muthukrishnan:
An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. 29-38 - Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro:
Rotation and Lighting Invariant Template Matching. 39-48 - Josep Díaz, Maria J. Serna, Nicholas C. Wormald:
Computation of the Bisection Width for Random d-Regular Graphs. 49-58 - Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris G. Pittel:
Constrained Integer Partitions. 59-68 - Abraham Flaxman, David Gamarnik, Gregory B. Sorkin:
Embracing the Giant Component. 69-79 - Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel:
Sampling Grid Colorings with Fewer Colors. 80-89 - Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand:
The Complexity of Finding Top-Toda-Equivalence-Class Members. 90-99 - Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
List Partitions of Chordal Graphs. 100-108 - Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth. 109-118 - Frank Gurski, Egon Wanke:
Vertex Disjoint Paths on Clique-Width Bounded Graphs. 119-128 - Frédéric Gardi:
On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications. 129-140 - Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc:
Collective Tree Exploration. 141-151 - Alper Üngör:
O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations. 152-161 - 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 - Claudio Gutierrez, Flavio Gutierrez, Maria-Cecilia Rivara:
A Geometric Approach to the Bisection Method. 172-180 - H. K. Dai, Xi-Wen Zhang:
Improved Linear Expected-Time Algorithms for Computing Maxima. 181-192 - Jens S. Kohrt, Kirk Pruhs:
A Constant Approximation Algorithm for Sorting Buffers. 193-202 - Kirk Pruhs, Gerhard J. Woeginger:
Approximation Schemes for a Class of Subset Selection Problems. 203-211 - Prabhakar Gubbala, Balaji Raghavachari:
Finding k-Connected Subgraphs with Minimum Average Weight. 212-221 - Ke Yang:
On the (Im)possibility of Non-interactive Correlation Distillation. 222-231 - Volker Diekert, Paul Gastin:
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces. 232-241 - Sylvain Lombardy, Jacques Sakarovitch:
How Expressions Can Code for Automata. 242-251 - Shigeki Akiyama, Frédérique Bassino, Christiane Frougny:
Automata for Arithmetic Meyer Sets. 252-261 - Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer:
Effciently Computing the Density of Regular Languages. 262-270 - Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot:
Longest Repeats with a Block of Don't Cares. 271-278 - John Rhodes, Benjamin Steinberg:
Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups. 279-291 - Olivier Carton, Chloe Rispal:
Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank. 292-301 - Marcos A. Kiwi, Martin Loebl, Jirí Matousek:
Expected Length of the Longest Common Subsequence for Large Alphabets. 302-311 - Gadiel Seroussi:
Universal Types and Simulation of Individual Sequences. 312-321 - Gérard D. Cohen, Hans Georg Schaathun:
Separating Codes: Constructions and Bounds. 322-328 - Sergei Bespamyatnikh:
Encoding Homotopy of Paths in the Plane. 329-338 - Saverio Caminiti, Irene Finocchi, Rossella Petreschi:
A Unified Approach to Coding Labeled Trees. 339-348 - Hervé Brönnimann, Marc Glisse:
Cost-Optimal Trees for Ray Shooting. 349-358 - Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Packing Problems with Orthogonal Rotations. 359-368 - Alantha Newman, Matthias Ruhl:
Combinatorial Problems on Strings with Applications to Protein Folding. 369-378 - Mark Cieliebak, Stephan J. Eidenbenz:
Measurement Errors Make the Partial Digest Problem NP-Hard. 379-390 - Jean Cardinal, Stefan Langerman:
Designing Small Keyboards Is Hard. 391-400 - James R. Lee, Manor Mendel, Assaf Naor:
Metric Structures in L1: Dimension, Snowflakes, and Average Distortion. 401-412 - Richard J. Lipton, Evangelos Markakis:
Nash Equilibria via Polynomial Equations. 413-422 - Raja Jothi, Balaji Raghavachari:
Minimum Latency Tours and the k-Traveling Repairmen Problem. 423-433 - Nikhil Bansal, Kirk Pruhs:
Server Scheduling in the Weighted lp Norm. 434-443 - Martin Fürer:
An Improved Communication-Randomness Tradeo. 444-454 - Paul Gastin, Benjamin Lerman, Marc Zeitoun:
Distributed Games and Distributed Control for Asynchronous Systems. 455-465 - Mihai Badoiu, Erik D. Demaine:
A Simplified, Dynamic Unified Structure. 466-473 - Ali Akhavi, Céline Moreira Dos Santos:
Another View of the Gaussian Algorithm. 474-487 - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. 488-498 - Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung:
Rooted Maximum Agreement Supertrees. 499-508 - Edith Hemaspaandra, Holger Spakowski, Mayur Thakur:
Complexity of Cycle Length Modularity Problems in Graphs. 509-518 - Dusan Guller:
Procedural Semantics for Fuzzy Disjunctive Programs on Residuated Lattices. 519-529 - Olga Tveretina, Hans Zantema:
A Proof System and a Decision Procedure for Equality Logic. 530-539 - Argimiro Arratia, Carlos E. Ortiz:
Approximating the Expressive Power of Logics in Finite Models. 540-556 - Joachim von zur Gathen:
Arithmetic Circuits for Discrete Logarithms. 557-566 - Jeff Edmonds:
On the Competitiveness of AIMD-TCP within a General Network. 567-576 - Mark Cieliebak:
Gathering Non-oblivious Mobile Robots. 577-588 - Bernard Mans, Igor E. Shparlinski:
Bisecting and Gossiping in Circulant Graphs. 589-598 - Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Nicola Santoro, Cindy Sawchuk:
Multiple Mobile Agent Rendezvous in a Ring. 599-608 - Jeremy Elson, Richard M. Karp, Christos H. Papadimitriou, Scott Shenker:
Global Synchronization in Sensornets. 609-624
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-26 18:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
