| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro |
On the complexity of searching in trees and partially ordered structures.  |
Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Marco Molinaro |
An Approximation Algorithm for Binary Searching in Trees. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes |
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Marco Molinaro |
Improved approximations for the hotlink assignment problem. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Eduardo Sany Laber |
On the competitive ratio of evaluating priced functions. |
J. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic |
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim |
Binary Identification Problems for Weighted Trees. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Teixeira Cardoso, Iam Vita Jabour, Eduardo Sany Laber, Rogério Rodrigues, Pedro Cardoso |
An efficient language-independent method to extract content from news webpages. |
ACM Symposium on Document Engineering |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic |
Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro |
On the Complexity of Searching in Trees: Average-Case Minimization. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro |
On Greedy Algorithms for Decision Trees. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro |
On the Complexity of Searching in Trees: Average-case Minimization |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Bruno Tenório Ávila, Eduardo Sany Laber |
Merge source coding. |
ISIT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Críston Pereira de Souza, Iam Vita Jabour, Evelin Carvalho Freire de Amorim, Eduardo Teixeira Cardoso, Raúl P. Rentería, Lúcio Cunha Tinoco, Caio Dias Valentim |
A fast and simple method for extracting relevant content from news webpages. |
CIKM |
2009 |
DBLP DOI BibTeX RDF |
electronic news, html parser, information extraction |
| 1 | Eduardo Sany Laber |
A randomized competitive algorithm for evaluating priced AND/OR trees. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Marco Molinaro |
An Approximation Algorithm for Binary Searching in Trees. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Eduardo Sany Laber |
Function Evaluation Via Linear Programming in the Priced Information Model. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Claudson F. Bornstein, Loana Tito Nogueira, Luerbio Faria (eds.) |
LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings |
|
2008 |
DBLP BibTeX RDF |
|
| 1 | Vaston G. Costa, Edward Hermann Haeusler, Eduardo Sany Laber, Loana Tito Nogueira |
A note on the size of minimal covers. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas |
Querying priced information in databases: The conjunctive case. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
online algorithms, Competitive analysis |
| 1 | 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. |
ACM Trans. Inf. Syst. |
2007 |
DBLP DOI BibTeX RDF |
Hotlink, directory tree, hotlist, algorithms, hyperlink |
| 1 | Críston de Souza, Eduardo Sany Laber, Caio Dias Valentim, Eduardo Teixeira Cardoso |
A Polite Policy for Revisiting Web Pages. |
LA-WEB |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Eduardo Sany Laber |
On the competitive ratio of evaluating priced functions. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber |
Hotlink Assignment on the Web. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas |
On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Albuquerque Fernandes Más |
Randomized mechanisms for limited supply multi-item auctions. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Eduardo Sany Laber |
An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Eduardo Sany Laber |
A new strategy for querying priced information. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
priced information, competitive analysis, monotone function |
| 1 | Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber |
Searching in random partially ordered sets. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Loana Tito Nogueira |
On the hardness of the minimum height decision tree problem. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa |
Querying Priced Information in Databases: The Conjunctive Case. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza |
Efficient Implementation of Hotlink Assignment Algorithm for Web Sites. |
ALENEX/ANALC |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eduardo Sany Laber |
A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza |
Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber |
The complexity of makespan minimization for pipeline transportation. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Emerson L. Monte Carmelo |
A Note on multicolor bipartite Ramsey numbers for K_{2, n}. |
Ars Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Fabio Porto, Eduardo Sany Laber, Patrick Valduriez |
Cherry Picking: A Semantic Query Processing Strategy for the Evaluation of Expensive Predicates. |
SBBD |
2003 |
DBLP BibTeX RDF |
|
| 1 | Ruy Luiz Milidiú, Eduardo Sany Laber, Lorenza O. Moreno, Julio C. Duarte |
A fast decoding method for prefix codes. |
DCC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Leonardo Gomes Holanda |
Improved bounds for asymmetric communication protocols. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa |
A strategy for searching with different access costs. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa |
On Binary Searching with Nonuniform Costs. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Ojas Parekh, R. Ravi |
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber |
Searching in Random Partially Ordered Sets. |
LATIN |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber |
Pipeline Transportation of Petroleum Products with No Due Dates. |
LATIN |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber |
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Loana Tito Nogueira |
Fast Searching in Trees. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Leonardo Gomes Holanda |
On asymmetric communication protocols. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruy Luiz Milidiú, Eduardo Sany Laber |
Bounding the Inefficiency of Length-Restricted Prefix Codes. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
Huffman trees, Approximative algorithm, Compression, Redundancy, Prefix codes |
| 1 | Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber |
Three space-economical algorithms for calculating minimum-redundancy prefix codes. |
IEEE Transactions on Information Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa |
On binary searching with non-uniform costs. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruy Luiz Milidiú, Eduardo Sany Laber |
The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruy Luiz Milidiú, Eduardo Sany Laber |
Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract). |
LATIN |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. (PDF / PS) |
SPIRE |
2000 |
DBLP DOI BibTeX RDF |
optimal search strategies, nonuniform access costs, worst-case cost minimization, last accessed key, magnetic disks, optical disks, expected running time, cost matrix, tree searching, NUMA, binary search tree |
| 1 | Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa |
Bounding the Compression Loss of the FGK Algorithm. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa |
Strategies for Searching with Different Access Costs. |
ESA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa |
Bounding the Compression Loss of the FGK Algorithm. |
Data Compression Conference |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber |
Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes. |
Data Compression Conference |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa |
A Work Efficient Parallel Algorithm for Constructing Huffman Codes. |
Data Compression Conference |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber |
A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes. (PDF / PS) |
SPIRE/CRIWG |
1999 |
DBLP DOI BibTeX RDF |
Huffman Tree, Space Usage, Data Compression, Homogenization, Prefix Codes |
| 1 | Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa |
Practical Constructions of L-restricted Alphabetic Prefix Codes. (PDF / PS) |
SPIRE/CRIWG |
1999 |
DBLP DOI BibTeX RDF |
Alphabetic Prefix Codes, Length Restriction, Data Compression |
| 1 | Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber |
In-Place Length-Restricted Prefix Coding. |
SPIRE |
1998 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")