Eduardo Sany Laber

Available identifiers

zbMath Open laber.eduardo-sanyMaRDI QIDQ935153

List of research outcomes

Publication	Date of Publication	Type
The computational complexity of some explainable clustering problems	2024-03-26	Paper
Nearly tight bounds on the price of explainability for the \(k\)-center and the maximum-spacing clustering problems	2023-02-24	Paper
Minimization of Gini impurity: NP-completeness and approximation algorithm via connections with the \(k\)-means problem	2022-04-27	Paper
Information Theoretical Clustering Is Hard to Approximate	2021-02-22	Paper
On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem	2020-12-29	Paper
Correction to: ``Trading off worst and expected cost in decision tree problems	2019-01-11	Paper
Decision trees for function evaluation: simultaneous optimization of worst and expected cost	2017-11-09	Paper
Trading off worst and expected cost in decision tree problems	2017-11-09	Paper
Decision tree classification with bounded number of errors	2017-08-16	Paper
Trading off Worst and Expected Cost in Decision Tree Problems	2016-01-11	Paper
Querying priced information in databases	2015-09-02	Paper
Approximating decision trees with value dependent testing costs	2015-05-21	Paper
Improved approximation algorithms for the average-case tree searching problem	2014-12-02	Paper
Improved approximations for the hotlink assignment problem	2014-09-09	Paper
Approximating the maximum consecutive subsums of a sequence	2014-03-13	Paper
The binary identification problem for weighted trees	2012-11-08	Paper
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence	2012-08-14	Paper
On the complexity of searching in trees and partially ordered structures	2011-12-07	Paper
Binary Identification Problems for Weighted Trees	2011-08-12	Paper
Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case	2011-08-10	Paper
On the competitive ratio of evaluating priced functions	2011-07-14	Paper
An approximation algorithm for binary searching in trees	2011-03-30	Paper
On Greedy Algorithms for Decision Trees	2010-12-09	Paper
On the Complexity of Searching in Trees: Average-Case Minimization	2010-09-07	Paper
A new strategy for querying priced information	2010-08-16	Paper
On the competitive ratio of evaluating priced functions	2010-08-16	Paper
A note on the size of minimal covers	2010-01-29	Paper
Hotlink Assignment on the Web	2009-01-22	Paper
On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions	2008-09-18	Paper
Function Evaluation Via Linear Programming in the Priced Information Model	2008-08-28	Paper
An Approximation Algorithm for Binary Searching in Trees	2008-08-28	Paper
A randomized competitive algorithm for evaluating priced AND/OR trees	2008-07-31	Paper
STACS 2004	2007-10-01	Paper
https://portal.mardi4nfdi.de/entity/Q3439676	2007-05-29	Paper
Algorithms – ESA 2005	2006-06-27	Paper
Algorithms and Computation	2005-12-22	Paper
https://portal.mardi4nfdi.de/entity/Q5466041	2005-08-23	Paper
On the hardness of the minimum height decision tree problem	2004-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q3044331	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q3044333	2004-08-11	Paper
Searching in random partially ordered sets	2004-08-10	Paper
The complexity of makespan minimization for pipeline transportation.	2004-03-14	Paper
https://portal.mardi4nfdi.de/entity/Q4411398	2003-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4411291	2003-07-07	Paper
Bounding the inefficiency of length-restricted prefix codes	2003-06-10	Paper
Bounding the Compression Loss of the FGK Algorithm	2003-06-09	Paper
Improved bounds for asymmetric communication protocols.	2003-01-21	Paper
A strategy for searching with different access costs.	2003-01-21	Paper
Three space-economical algorithms for calculating minimum-redundancy prefix codes	2002-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q2768391	2002-06-18	Paper
On Binary Searching with Nonuniform Costs	2002-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q4508379	2002-04-22	Paper
https://portal.mardi4nfdi.de/entity/Q2741453	2001-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q2741474	2001-10-24	Paper
The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes	2001-03-19	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Eduardo Sany Laber