| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Eduardo Sany Laber Eduardo Sany Laber, Renato Carmo , Yoshiharu Kohayakawa : Querying Priced Information in Databases: The Conjunctive Case. LATIN 2004 : 6-15 Eduardo Sany Laber: A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees. STACS 2004 : 501-512 Ruy Luiz Milidiú , Eduardo Sany Laber, Lorenza O. Moreno , Julio C. Duarte : A fast decoding method for prefix codes. DCC 2003 : 438 Fabio Porto , Eduardo Sany Laber, Patrick Valduriez : Cherry Picking: A Semantic Query Processing Strategy for the Evaluation of Expensive Predicates. SBBD 2003 : 356-370 Eduardo Sany Laber, Emerson L. Monte Carmelo : A Note on multicolor bipartite Ramsey numbers for K_{2, n}. Ars Comb. 69 : (2003) Ruy Luiz Milidiú , Artur Alves Pessoa , Eduardo Sany Laber: The complexity of makespan minimization for pipeline transportation. Theor. Comput. Sci. 306 (1-3): 339-351 (2003) Ruy Luiz Milidiú , Artur Alves Pessoa , Eduardo Sany Laber: Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. APPROX 2002 : 243-255 Eduardo Sany Laber, Ojas Parekh , R. Ravi : Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. ESA 2002 : 649-661 Ruy Luiz Milidiú , Artur Alves Pessoa , Eduardo Sany Laber: Pipeline Transportation of Petroleum Products with No Due Dates. LATIN 2002 : 248-262 Renato Carmo , Jair Donadelli , Yoshiharu Kohayakawa , Eduardo Sany Laber: Searching in Random Partially Ordered Sets. LATIN 2002 : 278-292 Eduardo Sany Laber, Leonardo Gomes Holanda : Improved bounds for asymmetric communication protocols. Inf. Process. Lett. 83 (4): 205-209 (2002) Eduardo Sany Laber, Ruy Luiz Milidiú , Artur Alves Pessoa : On Binary Searching with Nonuniform Costs. SIAM J. Comput. 31 (4): 1022-1047 (2002) Eduardo Sany Laber, Ruy Luiz Milidiú , Artur Alves Pessoa : A strategy for searching with different access costs. Theor. Comput. Sci. 287 (2): 571-584 (2002) Eduardo Sany Laber, Ruy Luiz Milidiú , Artur Alves Pessoa : On binary searching with non-uniform costs. SODA 2001 : 855-864 Ruy Luiz Milidiú , Eduardo Sany Laber: Bounding the Inefficiency of Length-Restricted Prefix Codes. Algorithmica 31 (4): 513-529 (2001) Ruy Luiz Milidiú , Eduardo Sany Laber: Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract). LATIN 2000 : 227-236 Ruy Luiz Milidiú , Artur Alves Pessoa , Eduardo Sany Laber, Raúl P. Rentería : Fast Calculation of Optimal Strategies for Searching with Non-Uniform Costs. SPIRE 2000 : 229-235 Ruy Luiz Milidiú , Eduardo Sany Laber: The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes. SIAM J. Comput. 30 (5): 1405-1426 (2000) Ruy Luiz Milidiú , Artur Alves Pessoa , Eduardo Sany Laber: Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes. ALENEX 1999 : 1-17 Ruy Luiz Milidiú , Artur Alves Pessoa , Eduardo Sany Laber: Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes. Data Compression Conference 1999 : 267-276 Ruy Luiz Milidiú , Eduardo Sany Laber, Artur Alves Pessoa : A Work Efficient Parallel Algorithm for Constructing Huffman Codes. Data Compression Conference 1999 : 277-286 Ruy Luiz Milidiú , Eduardo Sany Laber, Artur Alves Pessoa : Bounding the Compression Loss of the FGK Algorithm. Data Compression Conference 1999 : 539 Eduardo Sany Laber, Ruy Luiz Milidiú , Artur Alves Pessoa : Strategies for Searching with Different Access Costs. ESA 1999 : 236-247 Eduardo Sany Laber, Ruy Luiz Milidiú , Artur Alves Pessoa : Practical Constructions of L-restricted Alphabetic Prefix Codes. SPIRE/CRIWG 1999 : 115-119 Ruy Luiz Milidiú , Artur Alves Pessoa , Eduardo Sany Laber: A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes. SPIRE/CRIWG 1999 : 128-134 Ruy Luiz Milidiú , Eduardo Sany Laber, Artur Alves Pessoa : Bounding the Compression Loss of the FGK Algorithm. J. Algorithms 32 (2): 195-211 (1999) Ruy Luiz Milidiú , Artur Alves Pessoa , Eduardo Sany Laber: In-Place Length-Restricted Prefix Coding. SPIRE 1998 : 50-59 1 [ 23 ] 2 [ 18 ] [ 27 ] 3 [ 18 ] 4 [ 25 ] 5 [ 17 ] 6 [ 18 ] [ 27 ] 7 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 19 ] [ 21 ] [ 22 ] [ 25 ] 8 [ 25 ] 9 [ 20 ] 10 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 11 ] [ 14 ] [ 15 ] [ 16 ] [ 19 ] [ 21 ] [ 22 ] 11 [ 24 ] 12 [ 20 ] 13 [ 11 ] 14 [ 24 ]  ©2004 Association for Computing Machinery |
