Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Laber, Eduardo Sany - Departamento de Informática, Pontifícia Universidade Católica do Rio de Janeiro
E#cient Algorithms for the Hotlink Assignment Problem: The Worst Case Search
Inplace LengthRestricted Prefix Coding Ruy Luiz Milidi'u, Artur Alves Pessoa, Eduardo Sany Laber
Bounding the Compression Loss of the FGK Ruy Luiz Milidi'u,Eduardo Sany Laber,Artur Alves Pessoa
A New Strategy for Querying Priced Information Ferdinando Cicalese #
Practical Constructions of Lrestricted Alphabetic Prefix Codes
Practical Use of The Warmup Algorithm on LengthRestricted Coding
Querying Priced Information in Databases: The Conjunctive Case
ON BINARY SEARCHING WITH NONUNIFORM COSTS EDUARDO S. LABER 1 \Lambda , RUY L. MILIDI '
On the Hardness of the Minimum Height Decision Tree Eduardo S. Laber #1
On the Hardness of the Minimum Height Decision Tree Eduardo S. Laber 1
THE WARMUP ALGORITHM: A LAGRANGEAN CONSTRUCTION
Function Evaluation Via Linear Programming in the Priced Information Model
Information Processing Letters 102 (2007) 124126 www.elsevier.com/locate/ipl
Bounding the Inefficiency of LengthRestricted Prefix Codes
Theoretical Computer Science 321 (2004) 4157 www.elsevier.com/locate/tcs
Linear Time Recognition of Optimal LRestricted Prefix Codes (Extended Abstract)
A Note on multicolor bipartite Ramsey numbers PUCRio, Brasil.
A Strategy for Searching with Different Access Eduardo Sany Laber and Ruy Luiz Milidi'u and Artur Alves Pessoa
ARTICLE IN PRESS Theoretical Computer Science ( )
Theoretical Computer Science 306 (2003) 339351 www.elsevier.com/locate/tcs
On the Competitive Ratio of Evaluating Priced Functions (Extended Abstract)
