7. LATIN 2006:
Valdivia,
Chile
José R. Correa, Alejandro Hevia, Marcos A. Kiwi (Eds.):
LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings.
Lecture Notes in Computer Science 3887 Springer 2006, ISBN 3-540-32755-X BibTeX
Keynotes
Regular Contributions
- Saurabh Agarwal, Gudmund Skovbjerg Frandsen:
A New GCD Algorithm for Quadratic Number Rings with Unique Factorization.
30-42
Electronic Edition (link) BibTeX
- Nir Ailon, Steve Chien, Cynthia Dwork:
On Clusters in Markov Chains.
43-55
Electronic Edition (link) BibTeX
- Miklós Ajtai, Cynthia Dwork, Larry J. Stockmeyer:
An Architecture for Provably Secure Computation.
56-67
Electronic Edition (link) BibTeX
- Elói Araújo, José Soares:
Scoring Matrices That Induce Metrics on Sequences.
68-79
Electronic Edition (link) BibTeX
- Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
80-92
Electronic Edition (link) BibTeX
- Boris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu:
The Complexity of Diffuse Reflections in a Simple Polygon.
93-104
Electronic Edition (link) BibTeX
- Argimiro Arratia, Carlos E. Ortiz:
Counting Proportions of Sets: Expressive Power with Almost Order.
105-117
Electronic Edition (link) BibTeX
- Abdullah N. Arslan:
Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets.
118-129
Electronic Edition (link) BibTeX
- Nuttapong Attrapadung, Yang Cui, David Galindo, Goichiro Hanaoka, Ichiro Hasuo, Hideki Imai, Kanta Matsuura, Peng Yang, Rui Zhang:
Relations Among Notions of Security for Identity Based Encryption Schemes.
130-141
Electronic Edition (link) BibTeX
- Ilya Baran, Erik D. Demaine, Dmitriy A. Katz:
Optimally Adaptive Integration of Univariate Lipschitz Functions.
142-153
Electronic Edition (link) BibTeX
- Benjamín René Callejas Bedregal, Santiago Figueira:
Classical Computability and Fuzzy Turing Machines.
154-165
Electronic Edition (link) BibTeX
- Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi:
An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees.
166-177
Electronic Edition (link) BibTeX
- Thorsten Bernholt, Thomas Hofmeister:
An Algorithm for a Generalized Maximum Subsequence Problem.
178-189
Electronic Edition (link) BibTeX
- Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda:
Random Bichromatic Matchings.
190-201
Electronic Edition (link) BibTeX
- Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell:
Eliminating Cycles in the Discrete Torus.
202-210
Electronic Edition (link) BibTeX
- Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas:
On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions.
211-223
Electronic Edition (link) BibTeX
- Jérémie Bourdon, Brigitte Vallée:
Pattern Matching Statistics on Correlated Sources.
224-237
Electronic Edition (link) BibTeX
- Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier:
Robust Model-Checking of Linear-Time Properties in Timed Automata.
238-249
Electronic Edition (link) BibTeX
- Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart:
The Computational Complexity of the Parallel Knock-Out Problem.
250-261
Electronic Edition (link) BibTeX
- Gruia Calinescu, Adrian Dumitrescu, János Pach:
Reconfigurations in Graphs and Grids.
262-273
Electronic Edition (link) BibTeX
- Laura Chaubard:
C-Varieties, Actions and Wreath Product.
274-285
Electronic Edition (link) BibTeX
- Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.
286-297
Electronic Edition (link) BibTeX
- Vicky Choi, Navin Goyal:
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise.
298-310
Electronic Edition (link) BibTeX
- Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young:
Oblivious Medians Via Online Bidding.
311-322
Electronic Edition (link) BibTeX
- Corinna Cortes, Mehryar Mohri, Ashish Rastogi, Michael Riley:
Efficient Computation of the Relative Entropy of Probabilistic Automata.
323-336
Electronic Edition (link) BibTeX
- Ho-Kwok Dai, Hung-Chi Su:
A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences.
337-348
Electronic Edition (link) BibTeX
- Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu:
De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).
349-361
Electronic Edition (link) BibTeX
- Sandeep Dey, Nicolas Schabanel:
Customized Newspaper Broadcast: Data Broadcast with Dependencies.
362-373
Electronic Edition (link) BibTeX
- Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann:
On Minimum k-Modal Partitions of Permutations.
374-385
Electronic Edition (link) BibTeX
- Frederic Dorn, Jan Arne Telle:
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm.
386-397
Electronic Edition (link) BibTeX
- Douglas G. Down, George Karakostas:
Maximizing Throughput in Queueing Networks with Limited Flexibility.
398-409
Electronic Edition (link) BibTeX
- Feodor F. Dragan, Chenyu Yan:
Network Flow Spanners.
410-422
Electronic Edition (link) BibTeX
- Khaled M. Elbassioni:
Finding All Minimal Infrequent Multi-dimensional Intervals.
423-434
Electronic Edition (link) BibTeX
- Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor:
Cut Problems in Graphs with a Budget Constraint.
435-446
Electronic Edition (link) BibTeX
- Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro:
Lower Bounds for Clear Transmissions in Radio Networks.
447-454
Electronic Edition (link) BibTeX
- Nazim Fatès, Damien Regnault, Nicolas Schabanel, Eric Thierry:
Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.
455-466
Electronic Edition (link) BibTeX
- Hervé Fournier, Antoine Vigneron:
Lower Bounds for Geometric Diameter Problems.
467-478
Electronic Edition (link) BibTeX
- Pierre Fraigniaud, Nicolas Nisse:
Connected Treewidth and Connected Graph Searching.
479-490
Electronic Edition (link) BibTeX
- Martin Fürer:
A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs.
491-501
Electronic Edition (link) BibTeX
- Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers:
The Committee Decision Problem.
502-514
Electronic Edition (link) BibTeX
- Ling Gai, Guochuan Zhang:
Common Deadline Lazy Bureaucrat Scheduling Revisited.
515-523
Electronic Edition (link) BibTeX
- Joachim Giesen, Eva Schuberth, Milos Stojakovic:
Approximate Sorting.
524-531
Electronic Edition (link) BibTeX
- Michel X. Goemans, Jan Vondrák:
Stochastic Covering and Adaptivity.
532-543
Electronic Edition (link) BibTeX
- Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton:
Algorithms for Modular Counting of Roots of Multivariate Polynomials.
544-555
Electronic Edition (link) BibTeX
- Venkatesan Guruswami, Valentine Kabanets:
Hardness Amplification Via Space-Efficient Direct Products.
556-568
Electronic Edition (link) BibTeX
- Mikael Hammar, Bengt J. Nilsson, Mia Persson:
The Online Freeze-Tag Problem.
569-579
Electronic Edition (link) BibTeX
- Herman J. Haverkort, Laura Toma:
I/O-Efficient Algorithms on Near-Planar Graphs.
580-591
Electronic Edition (link) BibTeX
- Pinar Heggernes, Federico Mancini:
Minimal Split Completions of Graphs.
592-604
Electronic Edition (link) BibTeX
- Regant Y. S. Hung, Hing-Fung Ting:
Design and Analysis of Online Batching Systems.
605-616
Electronic Edition (link) BibTeX
- Wojciech Jawor, Marek Chrobak, Christoph Dürr:
Competitive Analysis of Scheduling Algorithms for Aggregated Links.
617-628
Electronic Edition (link) BibTeX
- James King:
A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains.
629-640
Electronic Edition (link) BibTeX
- Goran Konjevod, Andréa W. Richa, Donglin Xia:
On Sampling in Higher-Dimensional Peer-to-Peer Systems.
641-652
Electronic Edition (link) BibTeX
- Evangelos Kranakis, Danny Krizanc, Euripides Markou:
Mobile Agent Rendezvous in a Synchronous Torus.
653-664
Electronic Edition (link) BibTeX
- Lap Chi Lau, Michael Molloy:
Randomly Colouring Graphs with Girth Five and Large Maximum Degree.
665-676
Electronic Edition (link) BibTeX
- Orlando Lee, Aaron Williams:
Packing Dicycle Covers in Planar Graphs with No K5-e Minor.
677-688
Electronic Edition (link) BibTeX
- Loïck Lhote, Brigitte Vallée:
Sharp Estimates for the Main Parameters of the Euclid Algorithm.
689-702
Electronic Edition (link) BibTeX
- Veli Mäkinen, Gonzalo Navarro:
Position-Restricted Substring Searching.
703-714
Electronic Edition (link) BibTeX
- Yan Mayster, Mario A. Lopez:
Rectilinear Approximation of a Set of Points in the Plane.
715-726
Electronic Edition (link) BibTeX
- Frédéric Mazoit:
The Branch-Width of Circular-Arc Graphs.
727-736
Electronic Edition (link) BibTeX
- Eduardo Moreno, Martín Matamala:
Minimal Eulerian Circuit in a Labeled Digraph.
737-744
Electronic Edition (link) BibTeX
- Frank Neumann, Marco Laumanns:
Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization.
745-756
Electronic Edition (link) BibTeX
- Nadia Pisanti, Alexandra M. Carvalho, Laurent Marsan, Marie-France Sagot:
RISOTTO: Fast Extraction of Motifs with Mismatches.
757-768
Electronic Edition (link) BibTeX
- Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige:
Minimum Cost Source Location Problems with Flow Requirements.
769-780
Electronic Edition (link) BibTeX
- Daniel Sawitzki:
Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.
781-792
Electronic Edition (link) BibTeX
- Igor Shparlinski, Arne Winterhof:
Constructions of Approximately Mutually Unbiased Bases.
793-799
Electronic Edition (link) BibTeX
- Yngve Villanger:
Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In.
800-811
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:28:33 2009
by Michael Ley (ley@uni-trier.de)
