( en | de | ru )

 

Disambiguation of "Laber, Eduardo Sany"

Author of the publication

copydeleteadd this publication to your clipboard
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost.

, , and . Algorithmica, 79 (3): 763-796 (2017)

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)Shallow decision trees for explainable k-means clustering., , and . Pattern Recognit., (May 2023)An Approximation Algorithm for Binary Searching in Trees., and . Algorithmica, 59 (4): 601-620 (2011)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)Decision Trees for the efficient evaluation of discrete functions: worst case and expected case analysis., , and . CoRR, (2013)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)On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem., and . Discret. Appl. Math., (2021)The computational complexity of some explainable clustering problems.. CoRR, (2022)Querying Priced Information in Databases: The Conjunctive Case., , and . LATIN, volume 2976 of Lecture Notes in Computer Science, page 6-15. Springer, (2004)