Neal E. Young

CoRR, 2023

Classification via Two-Way Comparisons (Extended Abstract).

[BibT_eX]

[DOI]

Virginia Vassilevska Williams

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Online Paging with Heterogeneous Cache Slots.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

A Simple Algorithm for Optimal Search Trees with Two-way Comparisons.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

On Huang and Wong's algorithm for generalized binary split trees.

[BibT_eX]

[DOI]

Acta Informatica, 2022

2021

Comparison and evaluation of state-of-the-art LSM merge policies.

[BibT_eX]

[DOI]

VLDB J., 2021

On the cost of unsuccessful searches in search trees with two-way comparisons.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Competitive Data-Structure Dynamization.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2019

Introduction to the Special Issue on SODA 2017.

[BibT_eX]

[DOI]

Dániel Marx

ACM Trans. Algorithms, 2019

Unsupervised Ontology- and Sentiment-Aware Review Summarization.

[BibT_eX]

[DOI]

Nhat X. T. Le

Vagelis Hristidis

Proceedings of the Web Information Systems Engineering - WISE 2019, 2019

Experimental Evaluation of Bounded-Depth LSM Merge Policies.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

2018

Balanced centroidal power diagrams for redistricting.

[BibT_eX]

[DOI]

Vincent Cohen-Addad

Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

Exploiting Transitivity for Learning Person Re-Identification Models on a Budget.

[BibT_eX]

[DOI]

Sourya Roy

Sujoy Paul

Amit K. Roy-Chowdhury

Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition, 2018

Greedy Methods.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Balanced power diagrams for redistricting.

[BibT_eX]

[DOI]

Vincent Cohen-Addad

CoRR, 2017

Ontology- and Sentiment-Aware Review Summarization.

[BibT_eX]

[DOI]

Nhat X. T. Le

Vagelis Hristidis

Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

2016

Online Paging and Caching.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Greedy Set-Cover Algorithms.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Accelerating the discovery of unsupervised-shapelets.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2016

2015

On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Approximation algorithms for the joint replenishment problem with deadlines.

[BibT_eX]

[DOI]

J. Sched., 2015

Optimal search trees with equality tests.

[BibT_eX]

[DOI]

CoRR, 2015

Optimal Search Trees with 2-Way Comparisons.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

On a Linear Program for Minimum-Weight Triangulation.

[BibT_eX]

[DOI]

Arman Yousefi

SIAM J. Comput., 2014

Nearly Linear-Time Approximation Schemes for Mixed Packing/Covering and Facility-Location Linear Programs.

[BibT_eX]

[DOI]

CoRR, 2014

K-Slot SSTable Stack Compaction.

[BibT_eX]

[DOI]

Claire Mathieu

Carl Staelin

CoRR, 2014

A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs.

[BibT_eX]

[DOI]

Algorithmica, 2014

First Come First Served for Online Slot Allocation and Huffman Coding.

[BibT_eX]

[DOI]

Monik Khare

Claire Mathieu

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Hamming Approximation of NP Witnesses.

[BibT_eX]

[DOI]

Daniel Sheldon

Theory Comput., 2013

Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons

[BibT_eX]

[DOI]

CoRR, 2013

Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost.

[BibT_eX]

[DOI]

Algorithmica, 2013

2012

Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme.

[BibT_eX]

[DOI]

Mordecai J. Golin

Claire Mathieu

SIAM J. Comput., 2012

Caching with rental cost and nuking

[BibT_eX]

[DOI]

Monik Khare

CoRR, 2012

2011

Distributed algorithms for covering, packing and maximum weighted matching.

[BibT_eX]

[DOI]

Distributed Comput., 2011

Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2011

Logical-shapelets: an expressive primitive for time series classification.

[BibT_eX]

[DOI]

Abdullah Mueen

Eamonn J. Keogh

Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

2010

A Bound on the Sum of Weighted Pairwise Distances of Points Constrained to Balls

[BibT_eX]

[DOI]

Srikanth V. Krishnamurthy

CoRR, 2010

2009

Topology Management in Directional Antenna-Equipped Ad Hoc Networks.

[BibT_eX]

[DOI]

Ece Gelal

Gentian Jakllari

IEEE Trans. Mob. Comput., 2009

Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Distributed and parallel algorithms for weighted vertex cover and other covering problems.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Online Paging and Caching.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Greedy Set-Cover Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Flooding Overcomes Small Covering Constraints

[BibT_eX]

[DOI]

CoRR, 2008

Incremental Medians via Online Bidding.

[BibT_eX]

[DOI]

Algorithmica, 2008

2007

Greedy Methods.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2007

Efficient and effective explanation of change in hierarchical summaries.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007

Parsimonious Explanations of Change in Hierarchical Data.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Data Engineering, 2007

Beating Simplex for Fractional Packing and Covering Linear Programs.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006

The reverse greedy algorithm for the metric k-median problem.

[BibT_eX]

[DOI]

Srikanth V. Krishnamurthy

Inf. Process. Lett., 2006

Topology Control to Simultaneously Achieve Near-Optimal Node Degree and Low Path Stretch in Ad hoc Networks.

[BibT_eX]

[DOI]

Ece Gelal

Gentian Jakllari

Srikanth V. Krishnamurthy

Proceedings of the Third Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks, 2006

An Integrated Scheme for Fully-Directional Neighbor Discovery and Topology Management in Mobile Ad hoc Networks.

[BibT_eX]

[DOI]

Ece Gelal

Gentian Jakllari

Proceedings of the IEEE 3rd International Conference on Mobile Adhoc and Sensor Systems, 2006

Oblivious Medians Via Online Bidding.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Approximation algorithms for covering/packing integer programs.

[BibT_eX]

[DOI]

Stavros G. Kolliopoulos

J. Comput. Syst. Sci., 2005

The reverse greedy algorithm for the metric k-median problem

[BibT_eX]

[DOI]

CoRR, 2005

2004

Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut.

[BibT_eX]

[DOI]

Math. Oper. Res., 2004

2002

K-Medians, Facility Location, and the Chernoff-Wald Bound

[BibT_eX]

[DOI]

CoRR, 2002

Lecture Notes on Evasiveness of Graph Properties

[BibT_eX]

[DOI]

László Lovász

CoRR, 2002

On-Line File Caching.

[BibT_eX]

[DOI]

Algorithmica, 2002

Huffman coding with unequal letter costs.

[BibT_eX]

[DOI]

Mordecai J. Golin

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

On-Line End-to-End Congestion Control.

[BibT_eX]

[DOI]

Naveen Garg

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

Sequential and Parallel Algorithms for Mixed Packing and Covering.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Tight Approximation Results for General Covering Integer Programs.

[BibT_eX]

[DOI]

Stavros G. Kolliopoulos

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

On-Line Paging Against Adversarially Biased Random Inputs.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Polynomial-time approximation scheme for data broadcast.

[BibT_eX]

[DOI]

Nicolas Schabanel

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

K-medians, facility location, and the Chernoff-Wald bound.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Review of Online Computation and Competitive Analysis by Allan Borodin and Ran EI-Yaniv.

[BibT_eX]

[DOI]

SIGACT News, 1999

Improved Bicriteria Existence Theorems for Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic.

[BibT_eX]

[DOI]

Robert Lupton

F. Miller Maley

J. Algorithms, 1998

Bounding the Diffuse Adversary.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Orienting Graphs to Optimize Reachability.

[BibT_eX]

[DOI]

S. Louis Hakimi

Edward F. Schmeichel

Inf. Process. Lett., 1997

A Codebook Generation Algorithm for Document Image Compression.

[BibT_eX]

[DOI]

Qin Zhang

John M. Danskin

Proceedings of the 7th Data Compression Conference (DCC '97), 1997

1996

Low-Degree Spanning Trees of Small Weight.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

Prefix Codes: Equiprobable Words, Unequal Letter Costs.

[BibT_eX]

[DOI]

Mordecai J. Golin

SIAM J. Comput., 1996

A New Operation on Sequences: The Boustrophedon Transform.

[BibT_eX]

[DOI]

Jessica Millar

Neil J. A. Sloane

J. Comb. Theory, Ser. A, 1996

On Strongly Connected Digraphs with Bounded Cycle Length.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

1995

Approximating the Minimum Equivalent Digraph.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

Balancing Minimum Spanning Trees and Shortest-Path Trees.

[BibT_eX]

[DOI]

Algorithmica, 1995

Randomized Rounding Without Solving the Linear Program.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994

A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers.

[BibT_eX]

[DOI]

Uzi Vishkin

J. Algorithms, 1994

Designing Multi-Commodity Flow Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

The k-Server Dual and Loose Competitiveness for Paging.

[BibT_eX]

[DOI]

Algorithmica, 1994

Simple strategies for large zero-sum games with applications to complexity theory.

[BibT_eX]

[DOI]

Richard J. Lipton

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Approximate Data Structures with Applications.

[BibT_eX]

[DOI]

Yossi Matias

Jeffrey Scott Vitter

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Approximating the Minimum Equivalent Diagraph.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

Balancing Minimum Spanning and Shortest Path Trees.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

A primal-dual parallel approximation technique applied to weighted set and vertex cover.

[BibT_eX]

Uzi Vishkin

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1991

Faster parametric shortest path and minimum-balance algorithms.

[BibT_eX]

[DOI]

Robert Endre Tarjan

James B. Orlin

Networks, 1991

Competitive Paging Algorithms.

[BibT_eX]

[DOI]

Daniel Dominic Sleator

J. Algorithms, 1991

On-Line Caching as Cache Size Varies.

[BibT_eX]

[DOI]