|
Search the dblp DataBase
Artur Alves Pessoa:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:1-17 [Conf]
- Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza
Efficient Implementation of Hotlink Assignment Algorithm for Web Sites. [Citation Graph (0, 0)][DBLP] ALENEX/ANALC, 2004, pp:79-87 [Conf]
- Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:243-255 [Conf]
- Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa
A Work Efficient Parallel Algorithm for Constructing Huffman Codes. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 1999, pp:277-286 [Conf]
- Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa
Bounding the Compression Loss of the FGK Algorithm. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 1999, pp:539- [Conf]
- Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 1999, pp:267-276 [Conf]
- Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
Strategies for Searching with Different Access Costs. [Citation Graph (0, 0)][DBLP] ESA, 1999, pp:236-247 [Conf]
- Artur Alves Pessoa
Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks. [Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:766-777 [Conf]
- Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza
Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search. [Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:778-792 [Conf]
- Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Pipeline Transportation of Petroleum Products with No Due Dates. [Citation Graph (0, 0)][DBLP] LATIN, 2002, pp:248-262 [Conf]
- Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
On binary searching with non-uniform costs. [Citation Graph (0, 0)][DBLP] SODA, 2001, pp:855-864 [Conf]
- Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
Practical Constructions of L-restricted Alphabetic Prefix Codes. [Citation Graph (0, 0)][DBLP] SPIRE/CRIWG, 1999, pp:115-119 [Conf]
- Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes. [Citation Graph (0, 0)][DBLP] SPIRE/CRIWG, 1999, pp:128-134 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] SPIRE, 2000, pp:229-235 [Conf]
- Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
In-Place Length-Restricted Prefix Coding. [Citation Graph (0, 0)][DBLP] SPIRE, 1998, pp:50-59 [Conf]
- Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa
Bounding the Compression Loss of the FGK Algorithm. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:32, n:2, pp:195-211 [Journal]
- Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
On Binary Searching with Nonuniform Costs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:4, pp:1022-1047 [Journal]
- Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
A strategy for searching with different access costs. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:287, n:2, pp:571-584 [Journal]
- Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
The complexity of makespan minimization for pipeline transportation. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:306, n:1-3, pp:339-351 [Journal]
- Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Three space-economical algorithms for calculating minimum-redundancy prefix codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2185-2198 [Journal]
- Artur Alves Pessoa, Marcus Poggi de Aragão, Eduardo Uchoa
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP] WEA, 2007, pp:150-160 [Conf]
- Ornan Ori Gerstel, Shay Kutten, Eduardo Sany Laber, Rachel Matichin, David Peleg, Artur Alves Pessoa, Críston de Souza
Reducing human interactions in Web directory searches. [Citation Graph (0, 0)][DBLP] ACM Trans. Inf. Syst., 2007, v:25, n:4, pp:- [Journal]
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. [Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs
|