| On The Star Decomposition Of A Graph: Hardness Results And Approximation For The Max-Min Optimization Problem | 0 | 0.34 | 2021 |
| Teaching with Limited Information on the Learner's Behaviour | 0 | 0.34 | 2020 |
| New results on information theoretic clustering | 0 | 0.34 | 2019 |
| Approximation Algorithms for Clustering via Weighted Impurity Measures. | 0 | 0.34 | 2018 |
| Minimization of Gini impurity via connections with the k-means problem. | 0 | 0.34 | 2018 |
| Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems. | 0 | 0.34 | 2018 |
| Information Theoretical Clustering Is Hard to Approximate | 0 | 0.34 | 2018 |
| Decision Trees for Function Evaluation - Simultaneous Optimization of Worst and Expected Cost | 2 | 0.43 | 2017 |
| Trading off Worst and Expected Cost in Decision Tree Problems. | 1 | 0.63 | 2017 |
| LSHSIM: A Locality Sensitive Hashing based method for multiple-point geostatistics. | 0 | 0.34 | 2017 |
| On Compression Techniques for Computing Convolutions | 0 | 0.34 | 2016 |
| Approximating decision trees with value dependent testing costs. | 1 | 0.36 | 2015 |
| Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min,+)-convolution | 0 | 0.34 | 2015 |
| Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost. | 8 | 0.59 | 2014 |
| Improved Approximation Algorithms for the Average-Case Tree Searching Problem. | 1 | 0.35 | 2014 |
| Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost. | 0 | 0.34 | 2014 |
| Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model. | 2 | 0.39 | 2014 |
| On lower bounds for the Maximum Consecutive Subsums Problem and the (min,+)-convolution | 2 | 0.40 | 2014 |
| Decision Trees for the efficient evaluation of discrete functions: worst case and expected case analysis. | 0 | 0.34 | 2013 |
| Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs | 9 | 0.60 | 2013 |
| An Approximation Algorithm for Binary Searching in Trees | 8 | 0.50 | 2011 |
| On Greedy Algorithms for Decision Trees | 10 | 0.57 | 2010 |
| A fast and simple method for extracting relevant content from news webpages | 9 | 0.64 | 2009 |
| LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings | 50 | 3.12 | 2008 |
| Function Evaluation Via Linear Programming in the Priced Information Model | 3 | 0.41 | 2008 |
| A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees | 3 | 0.44 | 2008 |
| A Polite Policy for Revisiting Web Pages | 0 | 0.34 | 2007 |
| Reducing human interactions in Web directory searches | 7 | 0.50 | 2007 |
| On the competitive ratio of evaluating priced functions | 6 | 0.50 | 2006 |
| On behalf of the seller and society: bicriteria mechanisms for unit-demand auctions | 0 | 0.34 | 2006 |
| Randomized mechanisms for limited supply multi-item auctions | 0 | 0.34 | 2005 |
| A new strategy for querying priced information | 12 | 0.73 | 2005 |
| An optimal algorithm for querying priced information: monotone boolean functions and game trees | 5 | 0.48 | 2005 |
| Efficient Implementation of Hotlink Assignment Algorithm for Web Sites | 9 | 0.60 | 2004 |
| Efficient algorithms for the hotlink assignment problem: the worst case search | 13 | 0.69 | 2004 |
| Querying Priced Information in Databases: The Conjunctive Case | 2 | 0.43 | 2004 |
| A Note on multicolor bipartite Ramsey numbers for K_{2, n} | 0 | 0.34 | 2003 |
| Cherry Picking: A Semantic Query Processing Strategy for the Evaluation of Expensive Predicates | 0 | 0.34 | 2003 |
| The complexity of makespan minimization for pipeline transportation | 3 | 0.50 | 2003 |
| Pipeline Transportation of Petroleum Products with No Due Dates | 6 | 0.97 | 2002 |
| Improved bounds for asymmetric communication protocols | 9 | 0.79 | 2002 |
| A strategy for searching with different access costs | 1 | 0.34 | 2002 |
| Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products | 1 | 0.44 | 2002 |
| Bounding the Inefficiency of Length-Restricted Prefix Codes | 11 | 0.70 | 2001 |
| On asymmetric communication protocols | 0 | 0.34 | 2001 |
| Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract) | 0 | 0.34 | 2000 |
| The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes | 9 | 0.84 | 2000 |
| Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes | 6 | 0.74 | 1999 |
| Strategies for Searching with Different Access Costs | 4 | 0.54 | 1999 |
| Practical Constructions of L-Restricted Alphabetic Prefix Codes | 1 | 0.35 | 1999 |
