The following pages link to Eduardo Sany Laber (Q935153):
Displaying 50 items.
- (Q476451) (redirect page) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Searching in random partially ordered sets (Q596140) (← links)
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- (Q845984) (redirect page) (← links)
- A note on the size of minimal covers (Q845985) (← links)
- A randomized competitive algorithm for evaluating priced AND/OR trees (Q935154) (← links)
- The complexity of makespan minimization for pipeline transportation. (Q1426458) (← links)
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
- Trading off worst and expected cost in decision tree problems (Q1679235) (← links)
- Correction to: ``Trading off worst and expected cost in decision tree problems'' (Q1755752) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- Improved bounds for asymmetric communication protocols. (Q1853071) (← links)
- A strategy for searching with different access costs. (Q1853499) (← links)
- On the hardness of the minimum height decision tree problem (Q1885823) (← links)
- Minimization of Gini impurity: NP-completeness and approximation algorithm via connections with the \(k\)-means problem (Q2132392) (← links)
- On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem (Q2217500) (← links)
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
- Approximating decision trees with value dependent testing costs (Q2345858) (← links)
- Decision tree classification with bounded number of errors (Q2398501) (← links)
- Approximating the maximum consecutive subsums of a sequence (Q2437755) (← links)
- Nearly tight bounds on the price of explainability for the \(k\)-center and the maximum-spacing clustering problems (Q2686110) (← links)
- The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes (Q2706116) (← links)
- (Q2741453) (← links)
- (Q2741474) (← links)
- (Q2768391) (← links)
- On Binary Searching with Nonuniform Costs (Q2784491) (← links)
- Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence (Q2904488) (← links)
- Querying priced information in databases (Q2944545) (← links)
- (Q3044331) (← links)
- (Q3044333) (← links)
- On Greedy Algorithms for Decision Trees (Q3060774) (← links)
- Improved approximations for the hotlink assignment problem (Q3189023) (← links)
- (Q3439676) (← links)
- Trading off Worst and Expected Cost in Decision Tree Problems (Q3459863) (← links)
- Function Evaluation Via Linear Programming in the Priced Information Model (Q3521917) (← links)
- An Approximation Algorithm for Binary Searching in Trees (Q3521940) (← links)
- On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions (Q3525761) (← links)
- A new strategy for querying priced information (Q3581410) (← links)
- On the Complexity of Searching in Trees: Average-Case Minimization (Q3587405) (← links)
- Bounding the Compression Loss of the FGK Algorithm (Q4264494) (← links)
- (Q4411291) (← links)
- (Q4411398) (← links)
- (Q4508379) (← links)
- Three space-economical algorithms for calculating minimum-redundancy prefix codes (Q4544663) (← links)
- Information Theoretical Clustering Is Hard to Approximate (Q5151733) (← links)
- Binary Identification Problems for Weighted Trees (Q5199247) (← links)
- STACS 2004 (Q5309726) (← links)
- (Q5466041) (← links)
