Claire Mathieu

Victor Verdugo

Math. Program., January, 2024

2023

Errata for \.

[BibT_eX]

[DOI]

Proc. VLDB Endow., December, 2023

Approximating Maximum Integral Multiflows on Bounded Genus Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., December, 2023

Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, October, 2023

A simple algorithm for graph reconstruction.

[BibT_eX]

[DOI]

Random Struct. Algorithms, September, 2023

A PTAS for Capacitated Vehicle Routing on Trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, April, 2023

A Detailed Analysis of the SpaceSaving± Family of Algorithms with Bounded Deletions.

[BibT_eX]

[DOI]

CoRR, 2023

Testing frequency distributions in a stream.

[BibT_eX]

[DOI]

Michel de Rougemont

CoRR, 2023

An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees.

[BibT_eX]

[DOI]

Marc Dufay

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

Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm.

[BibT_eX]

[DOI]

Fabrizio Grandoni

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

A Tight 3/2+ε-Approximation for Unsplittable Capacitated Vehicle Routing on Trees.

[BibT_eX]

[DOI]

CoRR, 2022

2021

An Approximation Algorithm for Fully Planar Edge-Disjoint Paths.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2021

Large very dense subgraphs in a stream of edges.

[BibT_eX]

[DOI]

Michel de Rougemont

Netw. Sci., 2021

Constrained School Choice with Incomplete Information.

[BibT_eX]

[DOI]

Hugo Gimbert

CoRR, 2021

Competitive Data-Structure Dynamization.

[BibT_eX]

[DOI]

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

Probabilistic Analysis of Euclidean Capacitated Vehicle Routing.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Two-Sided Matching Markets with Strongly Correlated Preferences.

[BibT_eX]

[DOI]

Hugo Gimbert

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

Dynamic Clustering to Minimize the Sum of Radii.

[BibT_eX]

[DOI]

Monika Henzinger

Dariusz Leniowski

Algorithmica, 2020

How to aggregate Top-lists: Approximation algorithms via scores and average ranks.

[BibT_eX]

[DOI]

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

Instance-Optimality in the Noisy Value-and Comparison-Model.

[BibT_eX]

[DOI]

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

Skyline Computation with Noisy Comparisons.

[BibT_eX]

[DOI]

Benoît Groz

Victor Verdugo

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019

Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Hierarchical Clustering: Objective Functions and Algorithms.

[BibT_eX]

[DOI]

Varun Kanade

J. ACM, 2019

On popularity-based random matching markets.

[BibT_eX]

[DOI]

Hugo Gimbert

CoRR, 2019

Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint.

[BibT_eX]

[DOI]

Chien-Chung Huang

Mathieu Mari

Joseph S. B. Mitchell

Nabil H. Mustafa

Proceedings of the Approximation, 2019

2018

Graph Reconstruction and Verification.

[BibT_eX]

[DOI]

Sampath Kannan

ACM Trans. Algorithms, 2018

Semidefinite and linear programming integrality gaps for scheduling identical machines.

[BibT_eX]

[DOI]

Math. Program., 2018

How to aggregate Top-lists: Score based approximation schemes.

[BibT_eX]

[DOI]

CoRR, 2018

Instance-Optimality in the Noisy Value-and Comparison-Model - Accept, Accept, Strong Accept: Which Papers get in?

[BibT_eX]

[DOI]

CoRR, 2018

Covering Clients with Types and Budgets.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2017

Skyline Computation with Noisy Comparisons.

[BibT_eX]

[DOI]

Victor Verdugo

CoRR, 2017

Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs.

[BibT_eX]

[DOI]

Daniel Antunes

Nabil H. Mustafa

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Optimization of Bootstrapping in Circuits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2016

The power of local search for clustering.

[BibT_eX]

[DOI]

CoRR, 2016

Approximating connectivity domination in weighted bounded-genus graphs.

[BibT_eX]

[DOI]

Éric Colin de Verdière

David Meierfrankenfeld

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Distance in the Forest Fire Model How far are you from Eve?

[BibT_eX]

[DOI]

Varun Kanade

Reut Levi

Zvi Lotker

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Carpooling in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2015

The Presburger Award 2016 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2015

A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing.

[BibT_eX]

[DOI]

Algorithmica, 2015

Homophily and the Glass Ceiling Effect in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Near-Linear Query Complexity for Graph Inference.

[BibT_eX]

[DOI]

Sampath Kannan

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Effectiveness of Local Search for Geometric Optimization.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Convergence of Position Auctions under Myopic Best-Response Dynamics.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2014

K-Slot SSTable Stack Compaction.

[BibT_eX]

[DOI]

Carl Staelin

CoRR, 2014

Graph Verification and Reconstruction via Distance Oracles.

[BibT_eX]

[DOI]

Sampath Kannan

CoRR, 2014

The Unreasonable Success of Local Search: Geometric Optimization.

[BibT_eX]

[DOI]

CoRR, 2014

Lower bounds for testing digraph connectivity with one-pass streaming algorithms.

[BibT_eX]

[DOI]

Theresa Migler

CoRR, 2014

Energy-Efficient Algorithms for Non-preemptive Speed-Scaling.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

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

[BibT_eX]

[DOI]

Monik Khare

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

Approximating k-center in planar graphs.

[BibT_eX]

[DOI]

David Eisenstat

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

Facility Location in Evolving Metrics.

[BibT_eX]

[DOI]

David Eisenstat

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Online constrained optimization with recourse.

[BibT_eX]

[DOI]

Tess Avitabile

Laura H. Parkinson

Inf. Process. Lett., 2013

Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2013

The Min Mean-Weight Cycle in a Random Network.

[BibT_eX]

[DOI]

David B. Wilson

Comb. Probab. Comput., 2013

Graph Reconstruction via Distance Oracles.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

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

[BibT_eX]

[DOI]

Mordecai J. Golin

SIAM J. Comput., 2012

Lower bounds for randomized algorithms for online chain partitioning.

[BibT_eX]

[DOI]

Olga Ohrimenko

Inf. Process. Lett., 2012

On the Number of Indecomposable Permutations with a Given Number of Cycles.

[BibT_eX]

[DOI]

Robert Cori

John Michael Robson

Electron. J. Comb., 2012

An efficient polynomial-time approximation scheme for Steiner forest in planar graphs.

[BibT_eX]

[DOI]

David Eisenstat

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

A polynomial-time approximation scheme for planar multiway cut.

[BibT_eX]

[DOI]

MohammadHossein Bateni

MohammadTaghi Hajiaghayi

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Maximum Matching in Semi-streaming with Few Passes.

[BibT_eX]

[DOI]

Christian Konrad

Frédéric Magniez

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2011

Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack.

[BibT_eX]

[DOI]

Anna R. Karlin

C. Thach Nguyen

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010

Foreword to special issue SODA 2009.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Online Ranking for Tournament Graphs.

[BibT_eX]

[DOI]

Adrian Vladu

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

The Train Delivery Problem - Vehicle Routing Meets Bin Packing.

[BibT_eX]

[DOI]

Shay Mozes

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Online Correlation Clustering.

[BibT_eX]

[DOI]

Ocan Sankur

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Correlation Clustering with Noisy Input.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

An O(n log n) approximation scheme for Steiner tree in planar graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Low Distortion Maps Between Point Sets.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

On Hierarchical Diameter-Clustering and the Supplier Problem.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Recognizing well-parenthesized expressions in the streaming model.

[BibT_eX]

[DOI]

Frédéric Magniez

Ashwin Nayak

Electron. Colloquium Comput. Complex., 2009

Maximizing profit using recommender systems

[BibT_eX]

[DOI]

Daniel Ricketts

CoRR, 2009

Sherali-adams relaxations of the matching polytope.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

Commitment under uncertainty: Two-stage stochastic matching problems.

[BibT_eX]

[DOI]

Irit Katriel

Eli Upfal

Theor. Comput. Sci., 2008

Alternation and redundancy analysis of the intersection problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

On-line bipartite matching made simple.

[BibT_eX]

[DOI]

Benjamin E. Birnbaum

SIGACT News, 2008

Distortion lower bounds for line embeddings.

[BibT_eX]

[DOI]

Charalampos Papamanthou

Inf. Process. Lett., 2008

Incremental Medians via Online Bidding.

[BibT_eX]

[DOI]

Algorithmica, 2008

Online multicast with egalitarian cost sharing.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Yet another algorithm for dense max cut: go greedy.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Improved Approximation Algorithms for Budgeted Allocations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

How to rank with few errors.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Linear programming relaxations of maxcut.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

A polynomial-time approximation scheme for Steiner tree in planar graphs.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Greedy bidding strategies for keyword auctions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

2006

SIGACT news online algorithms column 10: competitiveness via doubling.

[BibT_eX]

[DOI]

Marek Chrobak

SIGACT News, 2006

Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes.

[BibT_eX]

[DOI]

Math. Oper. Res., 2006

On the Sum-of-Squares algorithm for bin packing.

[BibT_eX]

[DOI]

J. ACM, 2006

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

[BibT_eX]

[DOI]

Marek Chrobak

Inf. Process. Lett., 2006

How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Oblivious Medians Via Online Bidding.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming.

[BibT_eX]

[DOI]

Meinolf Sellmann

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2006

2005

On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing

[BibT_eX]

[DOI]

János Csirik

David S. Johnson

CoRR, 2005

The reverse greedy algorithm for the metric k-median problem

[BibT_eX]

[DOI]

Marek Chrobak

CoRR, 2005

On profit-maximizing envy-free pricing.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

OPT Versus LOAD in Dynamic Storage Allocation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Sensitivity, block sensitivity, and l-block sensitivity of boolean functions.

[BibT_eX]

[DOI]

Samuel Kutin

Inf. Comput., 2004

Approximation Schemes for Metric Clustering Problems.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

Approximation schemes for Metric Bisection and partitioning.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Approximation schemes for multidimensional packing.

[BibT_eX]

[DOI]

José R. Correa

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

The Data Broadcast Problem with Non-Uniform Transmission Times.

[BibT_eX]

[DOI]

Algorithmica, 2003

Dynamic TCP Acknowledgment and Other Stories about e/(e-1).

[BibT_eX]

Anna R. Karlin

Dana Randall

Algorithmica, 2003

Approximation schemes for clustering problems.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding.

[BibT_eX]

[DOI]

Richard M. Karp

Proceedings of the Approximation, 2003

Deterministic Algorithm for the t-Threshold Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Linear waste of best fit bin packing on skewed distributions.

[BibT_eX]

[DOI]

Michael Mitzenmacher

Random Struct. Algorithms, 2002

A Polynomial Time Approximation Scheme for Metric MIN-BISECTION

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2002

Polynomial Time Approximation Schemes for Metric Min-Sum Clustering

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2002

Scheduling Independent Multiprocessor Tasks.

[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

Adaptive intersection and t-threshold problems.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

A Randomized Approximation Scheme for Metric MAX-CUT.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

Dynamic TCP acknowledgement and other stories about e/(e-1).

[BibT_eX]

[DOI]

Anna R. Karlin

Dana Randall

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Better approximation algorithms for bin covering.

[BibT_eX]

[DOI]

János Csirik

David S. Johnson

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

On the discrete Bak-Sneppen model of self-organized criticality.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Glauber Dynamics on Trees and Hyperbolic Graphs.

[BibT_eX]

[DOI]

Elchanan Mossel

Yuval Peres

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

2000

A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem.

[BibT_eX]

[DOI]

Eric Rémila

Math. Oper. Res., 2000

Polynomial-time approximation scheme for data broadcast.

[BibT_eX]

[DOI]

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

Scheduling to Minimize the Average Completion Time of Dedicated Tasks.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999

Error-resilient DNA computation.

[BibT_eX]

[DOI]

Richard M. Karp

Orli Waarts

Random Struct. Algorithms, 1999

d-Dimensional Range Search on Multicomputers.

[BibT_eX]

[DOI]

Algorithmica, 1999

The Data Broadcast Problem with Non-Uniform Transmission Rimes.

[BibT_eX]

[DOI]

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

Scheduling on a Constant Number of Machines.

[BibT_eX]

[DOI]

Proceedings of the Randomization, 1999

Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

A Self Organizing Bin Packing Heuristic.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experimentation, 1999

1998

Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing.

[BibT_eX]

[DOI]

J. Algorithms, 1998

Multilayer Neural Networks and Polyhedral Dichotomies.

[BibT_eX]

[DOI]

Hélène Paugam-Moisy

Ann. Math. Artif. Intell., 1998

1997

Data Structures' Maxima.

[BibT_eX]

[DOI]

Guy Louchard

René Schott

SIAM J. Comput., 1997

d-Dimensional Range Search on Multicomputers.

[BibT_eX]

[DOI]

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996

Planar Cayley Graphs with Regular Dual.

[BibT_eX]

[DOI]

Thomas Chaboud

Int. J. Algebra Comput., 1996

Perfect matchings in the triangular lattice.

[BibT_eX]

[DOI]

Eric Rémila

Discret. Math., 1996

Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Best-Fit Bin-Packing with Random Order.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Multilayer Neural Networks: One or Two Hidden Layers?

[BibT_eX]

[DOI]

Graham R. Brightwell

Hélène Paugam-Moisy

Proceedings of the Advances in Neural Information Processing Systems 9, 1996

Approximate Strip Packing.

[BibT_eX]

[DOI]

Eric Rémila

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1994

On Boolean Decision Trees with Faulty Nodes.

[BibT_eX]

[DOI]

Valerie King

Random Struct. Algorithms, 1994

Scalable and architecture independent parallel geometric algorithms with high probability optimal time.

[BibT_eX]

[DOI]

Frank Dehne

Andreas Fabri

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Selection in the Presence of Noise: The Design of Playoff Systems.

[BibT_eX]

[DOI]

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

1993

Optimal Randomized Algorithms for Local Sorting and Set-Maxima.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Finding a Target Subnetwork in Sparse Networks with Random Faults.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Andrzej Pelc

Inf. Process. Lett., 1993

Matchings in lattice graphs.

[BibT_eX]

[DOI]

Dana Randall

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

How to Take Short Cuts.

[BibT_eX]

[DOI]

Richard W. Kenyon

Discret. Comput. Geom., 1992

Tiling a Polygon with Rectangles

[BibT_eX]

[DOI]

Richard W. Kenyon

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

The Maximum Size of Dynamic Data Structures.

[BibT_eX]

[DOI]

Jeffrey Scott Vitter

SIAM J. Comput., 1991

Maximum Queue Size and Hashing with Lazy Deletion.

[BibT_eX]

[DOI]

Jeffrey Scott Vitter

Algorithmica, 1991

1990

On Evaluating Boolean Functions with Unreliable Tests.

[BibT_eX]

[DOI]

Andrew Chi-Chih Yao

Int. J. Found. Comput. Sci., 1990

1989

Verifying Partial Orders

[BibT_eX]

[DOI]

Valerie King

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract).

[BibT_eX]

[DOI]

Jeffrey Scott Vitter

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1987

Average Efficiency of Data Structures for Binary Image Processing.

[BibT_eX]

[DOI]

Claude Puech

Hossein Yahia

Inf. Process. Lett., 1987

Some Problems in Computational Geometry.

[BibT_eX]

[DOI]