LATIN B

74 papers

YearTitle / Authors
2006A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains.
James King
2006A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs.
Martin Fürer
2006A New GCD Algorithm for Quadratic Number Rings with Unique Factorization.
Saurabh Agarwal, Gudmund Skovbjerg Frandsen
2006A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences.
Ho-Kwok Dai, Hung-Chi Su
2006Algorithmic Challenges in Web Search Engines.
Ricardo A. Baeza-Yates
2006Algorithms for Modular Counting of Roots of Multivariate Polynomials.
Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton
2006An Algorithm for a Generalized Maximum Subsequence Problem.
Thorsten Bernholt, Thomas Hofmeister
2006An Architecture for Provably Secure Computation.
Miklós Ajtai, Cynthia Dwork, Larry J. Stockmeyer
2006An Efficient Approximation Algorithm for Point Pattern Matching Under Noise.
Vicky Choi, Navin Goyal
2006An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees.
Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
2006Approximate Sorting.
Joachim Giesen, Eva Schuberth, Milos Stojakovic
2006Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.
Nazim Fatès, Damien Regnault, Nicolas Schabanel, Eric Thierry
2006C-Varieties, Actions and Wreath Product.
Laura Chaubard
2006Classical Computability and Fuzzy Turing Machines.
Benjamín René Callejas Bedregal, Santiago Figueira
2006Common Deadline Lazy Bureaucrat Scheduling Revisited.
Ling Gai, Guochuan Zhang
2006Competitive Analysis of Scheduling Algorithms for Aggregated Links.
Wojciech Jawor, Marek Chrobak, Christoph Dürr
2006Connected Treewidth and Connected Graph Searching.
Pierre Fraigniaud, Nicolas Nisse
2006Constructions of Approximately Mutually Unbiased Bases.
Igor E. Shparlinski, Arne Winterhof
2006Counting Proportions of Sets: Expressive Power with Almost Order.
Argimiro Arratia, Carlos E. Ortiz
2006Customized Newspaper Broadcast: Data Broadcast with Dependencies.
Sandeep Dey, Nicolas Schabanel
2006Cut Problems in Graphs with a Budget Constraint.
Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
2006Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
2006De Dictionariis Dynamicis Pauco Spatio Utentibus (
Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu
2006Design and Analysis of Online Batching Systems.
Regant Y. S. Hung, Hing-Fung Ting
2006Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets.
Abdullah N. Arslan
2006Efficient Computation of the Relative Entropy of Probabilistic Automata.
Corinna Cortes, Mehryar Mohri, Ashish Rastogi, Michael Riley
2006Eliminating Cycles in the Discrete Torus.
Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell
2006Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.
Daniel Sawitzki
2006Finding All Minimal Infrequent Multi-dimensional Intervals.
Khaled M. Elbassioni
2006Hardness Amplification Via Space-Efficient Direct Products.
Venkatesan Guruswami, Valentine Kabanets
2006I/O-Efficient Algorithms on Near-Planar Graphs.
Herman J. Haverkort, Laura Toma
2006Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In.
Yngve Villanger
2006LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings
José R. Correa, Alejandro Hevia, Marcos A. Kiwi
2006Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.
Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
2006Lossless Data Compression Via Error Correction.
Sergio Verdú
2006Lower Bounds for Clear Transmissions in Radio Networks.
Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro
2006Lower Bounds for Geometric Diameter Problems.
Hervé Fournier, Antoine Vigneron
2006Matching Based Augmentations for Approximating Connectivity Problems.
R. Ravi
2006Maximizing Throughput in Queueing Networks with Limited Flexibility.
Douglas G. Down, George Karakostas
2006Minimal Eulerian Circuit in a Labeled Digraph.
Eduardo Moreno, Martín Matamala
2006Minimal Split Completions of Graphs.
Pinar Heggernes, Federico Mancini
2006Minimum Cost Source Location Problems with Flow Requirements.
Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
2006Mobile Agent Rendezvous in a Synchronous Torus.
Evangelos Kranakis, Danny Krizanc, Euripides Markou
2006Modelling Errors and Recovery for Communication.
Madhu Sudan
2006Network Flow Spanners.
Feodor F. Dragan, Chenyu Yan
2006Oblivious Medians Via Online Bidding.
Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
2006On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions.
Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas
2006On Clusters in Markov Chains.
Nir Ailon, Steve Chien, Cynthia Dwork
2006On Minimum
Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann
2006On Sampling in Higher-Dimensional Peer-to-Peer Systems.
Goran Konjevod, Andréa W. Richa, Donglin Xia
2006Optimally Adaptive Integration of Univariate Lipschitz Functions.
Ilya Baran, Erik D. Demaine, Dmitriy A. Katz
2006Packing Dicycle Covers in Planar Graphs with No
Orlando Lee, Aaron Williams
2006Pattern Matching Statistics on Correlated Sources.
Jérémie Bourdon, Brigitte Vallée
2006Position-Restricted Substring Searching.
Veli Mäkinen, Gonzalo Navarro
2006RISOTTO: Fast Extraction of Motifs with Mismatches.
Nadia Pisanti, Alexandra M. Carvalho, Laurent Marsan, Marie-France Sagot
2006RNA Molecules: Glimpses Through an Algorithmic Lens.
Anne Condon
2006Random Bichromatic Matchings.
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda
2006Randomly Colouring Graphs with Girth Five and Large Maximum Degree.
Lap Chi Lau, Michael Molloy
2006Reconfigurations in Graphs and Grids.
Gruia Calinescu, Adrian Dumitrescu, János Pach
2006Rectilinear Approximation of a Set of Points in the Plane.
Yan Mayster, Mario Alberto López
2006Relations Among Notions of Security for Identity Based Encryption Schemes.
Nuttapong Attrapadung, Yang Cui, David Galindo, Goichiro Hanaoka, Ichiro Hasuo, Hideki Imai, Kanta Matsuura, Peng Yang, Rui Zhang
2006Robust Model-Checking of Linear-Time Properties in Timed Automata.
Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier
2006Scoring Matrices That Induce Metrics on Sequences.
Elói Araújo, José Soares
2006Sharp Estimates for the Main Parameters of the Euclid Algorithm.
Loïck Lhote, Brigitte Vallée
2006Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization.
Frank Neumann, Marco Laumanns
2006Squares.
Ferran Hurtado
2006Stochastic Covering and Adaptivity.
Michel X. Goemans, Jan Vondrák
2006The Branch-Width of Circular-Arc Graphs.
Frédéric Mazoit
2006The Committee Decision Problem.
Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers
2006The Complexity of Diffuse Reflections in a Simple Polygon.
Boris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu
2006The Computational Complexity of the Parallel Knock-Out Problem.
Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart
2006The Online Freeze-Tag Problem.
Mikael Hammar, Bengt J. Nilsson, Mia Persson
2006The Power and Weakness of Randomness in Computation.
Avi Wigderson
2006Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm.
Frederic Dorn, Jan Arne Telle