( en | de | ru )

 

Disambiguation of "Laber, Eduardo Sany"

Author of the publication

copydeleteadd this publication to your clipboard
An Approximation Algorithm for Binary Searching in Trees.

, and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 459-471. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Monamie Sanyal

Bhaskar Sanyal

Raman Sanyal

Norbert Laber

Birgit Laber

 

Other publications of authors with the same name

Improved approximations for the hotlink assignment problem., and . ACM Trans. Algorithms, 7 (3): 39:1-39:34 (2011)The computational complexity of some explainable clustering problems.. CoRR, (2022)Data Structures for Detecting Rare Variations in Time Series., , and . ECML/PKDD (2), volume 7524 of Lecture Notes in Computer Science, page 709-724. Springer, (2012)Function Evaluation Via Linear Programming in the Priced Information Model., and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 173-185. Springer, (2008)An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees., and . ESA, volume 3669 of Lecture Notes in Computer Science, page 664-676. Springer, (2005)Querying Priced Information in Databases: The Conjunctive Case., , and . LATIN, volume 2976 of Lecture Notes in Computer Science, page 6-15. Springer, (2004)A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes., , and . SPIRE/CRIWG, page 128-134. IEEE Computer Society, (1999)Minimization of Gini Impurity: NP-completeness and Approximation Algorithm via Connections with the k-means Problem., and . LAGOS, volume 346 of Electronic Notes in Theoretical Computer Science, page 567-576. Elsevier, (2019)Hotlink Assignment on the Web.. GTIT-C, volume 4123 of Lecture Notes in Computer Science, page 1088-1092. Springer, (2006)On the hardness of the minimum height decision tree problem., and . Discret. Appl. Math., 144 (1-2): 209-212 (2004)