dblp.uni-trier.dewww.uni-trier.de

Eduardo Sany Laber Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
49EEFerdinando Cicalese, Eduardo Sany Laber, Marco Molinaro: On the Complexity of Searching in Trees: Average-case Minimization CoRR abs/0904.3503: (2009)
2008
48 Eduardo Sany Laber, Claudson F. Bornstein, Loana Tito Nogueira, Luerbio Faria: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings Springer 2008
47EEFerdinando Cicalese, Eduardo Sany Laber: Function Evaluation Via Linear Programming in the Priced Information Model. ICALP (1) 2008: 173-185
46EEEduardo Sany Laber, Marco Molinaro: An Approximation Algorithm for Binary Searching in Trees. ICALP (1) 2008: 459-471
45EEEduardo Sany Laber: A randomized competitive algorithm for evaluating priced AND/OR trees. Theor. Comput. Sci. 401(1-3): 120-130 (2008)
2007
44EECríston de Souza, Eduardo Sany Laber, Caio Valentim, Eduardo Cardoso: A Polite Policy for Revisiting Web Pages. LA-WEB 2007: 128-135
43EEOrnan 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. 25(4): (2007)
42EERenato 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 3(1): (2007)
41EEVaston Costa, Edward Hermann Haeusler, Eduardo Sany Laber, Loana Tito Nogueira: A note on the size of minimal covers. Inf. Process. Lett. 102(2-3): 124-126 (2007)
2006
40EEEduardo Sany Laber: Hotlink Assignment on the Web. GTIT-C 2006: 1088-1092
39EEClaudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas: On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions. LATIN 2006: 211-223
38EEFerdinando Cicalese, Eduardo Sany Laber: On the competitive ratio of evaluating priced functions. SODA 2006: 944-953
2005
37EEFerdinando Cicalese, Eduardo Sany Laber: An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. ESA 2005: 664-676
36EEFerdinando Cicalese, Eduardo Sany Laber: A new strategy for querying priced information. STOC 2005: 674-683
35EEClaudson F. Bornstein, Eduardo Sany Laber, Marcelo Albuquerque Fernandes Más: Randomized mechanisms for limited supply multi-item auctions. Electronic Notes in Discrete Mathematics 19: 141-147 (2005)
2004
34 Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza: Efficient Implementation of Hotlink Assignment Algorithm for Web Sites. ALENEX/ANALC 2004: 79-87
33EEArtur Alves Pessoa, Eduardo Sany Laber, Críston de Souza: Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search. ISAAC 2004: 778-792
32EEEduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa: Querying Priced Information in Databases: The Conjunctive Case. LATIN 2004: 6-15
31EEEduardo Sany Laber: A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees. STACS 2004: 501-512
30EEEduardo Sany Laber, Loana Tito Nogueira: On the hardness of the minimum height decision tree problem. Discrete Applied Mathematics 144(1-2): 209-212 (2004)
29EERenato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber: Searching in random partially ordered sets. Theor. Comput. Sci. 321(1): 41-57 (2004)
2003
28EERuy Luiz Milidiú, Eduardo Sany Laber, Lorenza O. Moreno, Julio C. Duarte: A fast decoding method for prefix codes. DCC 2003: 438
27 Fabio Porto, Eduardo Sany Laber, Patrick Valduriez: Cherry Picking: A Semantic Query Processing Strategy for the Evaluation of Expensive Predicates. SBBD 2003: 356-370
26 Eduardo Sany Laber, Emerson L. Monte Carmelo: A Note on multicolor bipartite Ramsey numbers for K_{2, n}. Ars Comb. 69: (2003)
25EERuy 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)
2002
24EERuy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber: Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. APPROX 2002: 243-255
23EEEduardo Sany Laber, Ojas Parekh, R. Ravi: Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. ESA 2002: 649-661
22EERuy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber: Pipeline Transportation of Petroleum Products with No Due Dates. LATIN 2002: 248-262
21EERenato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber: Searching in Random Partially Ordered Sets. LATIN 2002: 278-292
20EEEduardo Sany Laber, Leonardo Gomes Holanda: Improved bounds for asymmetric communication protocols. Inf. Process. Lett. 83(4): 205-209 (2002)
19EEEduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa: On Binary Searching with Nonuniform Costs. SIAM J. Comput. 31(4): 1022-1047 (2002)
18 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)
2001
17EEEduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa: On binary searching with non-uniform costs. SODA 2001: 855-864
16EERuy Luiz Milidiú, Eduardo Sany Laber: Bounding the Inefficiency of Length-Restricted Prefix Codes. Algorithmica 31(4): 513-529 (2001)
15EEEduardo Sany Laber, Leonardo Gomes Holanda: On asymmetric communication protocols. Electronic Notes in Discrete Mathematics 7: 6-9 (2001)
14EEEduardo Sany Laber, Loana Tito Nogueira: Fast Searching in Trees. Electronic Notes in Discrete Mathematics 7: 90-93 (2001)
13 Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber: Three space-economical algorithms for calculating minimum-redundancy prefix codes. IEEE Transactions on Information Theory 47(6): 2185-2198 (2001)
2000
12 Ruy Luiz Milidiú, Eduardo Sany Laber: Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract). LATIN 2000: 227-236
11EERuy 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
10EERuy 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)
1999
9EERuy 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
8EERuy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber: Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes. Data Compression Conference 1999: 267-276
7EERuy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa: A Work Efficient Parallel Algorithm for Constructing Huffman Codes. Data Compression Conference 1999: 277-286
6EERuy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa: Bounding the Compression Loss of the FGK Algorithm. Data Compression Conference 1999: 539
5EEEduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa: Strategies for Searching with Different Access Costs. ESA 1999: 236-247
4EEEduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa: Practical Constructions of L-restricted Alphabetic Prefix Codes. SPIRE/CRIWG 1999: 115-119
3EERuy 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
2 Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa: Bounding the Compression Loss of the FGK Algorithm. J. Algorithms 32(2): 195-211 (1999)
1998
1 Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber: In-Place Length-Restricted Prefix Coding. SPIRE 1998: 50-59

Coauthor Index

1Claudson F. Bornstein [35] [39] [48]
2Eduardo Cardoso [44]
3Emerson L. Monte Carmelo [26]
4Renato Carmo [21] [29] [32] [42]
5Ferdinando Cicalese [36] [37] [38] [47] [49]
6Vaston Costa [41]
7Jair Donadelli [21] [29]
8Julio C. Duarte [28]
9Luerbio Faria [48]
10Tomás Feder [42]
11Ornan Ori Gerstel [43]
12Edward Hermann Haeusler [41]
13Leonardo Gomes Holanda [15] [20]
14Yoshiharu Kohayakawa [21] [29] [32] [42]
15Shay Kutten [43]
16Marcelo Mas [39]
17Marcelo Albuquerque Fernandes Más [35]
18Rachel Matichin [43]
19Ruy Luiz Milidiú [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [16] [17] [18] [19] [22] [24] [25] [28]
20Marco Molinaro [46] [49]
21Lorenza O. Moreno [28]
22Rajeev Motwani [42]
23Loana Tito Nogueira [14] [30] [41] [48]
24Liadan O'Callaghan [42]
25Rina Panigrahy [42]
26Ojas Parekh [23]
27David Peleg [43]
28Artur Alves Pessoa [1] [2] [3] [4] [5] [6] [7] [8] [9] [11] [13] [17] [18] [19] [22] [24] [25] [33] [34] [43]
29Fabio Porto [27]
30R. Ravi [23]
31Raúl P. Rentería [11]
32Críston de Souza [33] [34] [43] [44]
33Dilys Thomas [42]
34Patrick Valduriez [27]
35Caio Valentim [44]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)