Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Laber, Eduardo Sany"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the competitive ratio of evaluating priced functions
Ferdinando Cicalese
,
Eduardo Sany Laber
Journal of the ACM
58
(3), 2011, pp. 9: 1-40
Function evaluation via linear programming in the priced information model
Ferdinando Cicalese
,
Eduardo Sany Laber
Lecture Notes in Computer Science
5125
, 2008, pp. 173-185
A randomized competitive algorithm for evaluating priced AND/OR trees
Eduardo Sany Laber
Theoretical Computer Science
401
(1-3), 2008, pp. 120-130
An optimal algorithm for querying priced information: Monotone Boolean functions and game trees
Ferdinando Cicalese
,
Eduardo Sany Laber
Lecture Notes in Computer Science
3669
, 2005, pp. 664-676
A new strategy for querying priced information
Ferdinando Cicalese
,
Eduardo Sany Laber
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 674-683
A randomized competitive algorithm for evaluating priced AND/OR trees
Eduardo Sany Laber
Lecture Notes in Computer Science
2996
, 2004, pp. 501-512
Efficient algorithms for the hotlink assignment problem: The worst case search
Artur Alves Pessoa
,
Eduardo Sany Laber
,
Críston de Souza
Lecture Notes in Computer Science
3341
, 2004, pp. 778-792
The complexity of makespan minimization for pipeline transportation
Ruy Luiz Milidiú
,
Artur Alves Pessoa
,
Eduardo Sany Laber
Theoretical Computer Science
306
(1-3), 2003, pp. 339-351
Improved bounds for asymmetric communication protocols
Eduardo Sany Laber
,
Leonardo Gomes Holanda
Information Processing Letters
83
(4), 2002, pp. 205-209
A strategy for searching with different access costs
Eduardo Sany Laber
,
Ruy Luiz Milidiú
,
Artur Alves Pessoa
Theoretical Computer Science
287
(2), 2002, pp. 571-584
The WARM-UP algorithm: A Lagrangian construction of length restricted Huffman codes
Ruy Luiz Milidiú
,
Eduardo Sany Laber
SIAM Journal on Computing
30
(5), 2000, pp. 1405-1426
Strategies for searching with different access costs
Eduardo Sany Laber
,
Ruy Luiz Milidiú
,
Artur Alves Pessoa
Lecture Notes in Computer Science
1643
, 1999, pp. 236-247
Bounding the compression loss of the FGK algorithm
Ruy Luiz Milidiú
,
Eduardo Sany Laber
,
Artur Alves Pessoa
Journal of Algorithms
32
(2), 1999, pp. 195-211