Haim Kaplan

According to our database1, Haim Kaplan authored at least 251 papers between 1993 and 2020.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Optimal Representations of a Traffic Distribution in Switch Memories.
IEEE/ACM Trans. Netw., 2020

Clustering in Hypergraphs to Minimize Average Edge Service Time.
ACM Trans. Algorithms, 2020

Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location.
Discret. Comput. Geom., 2020

Duality-based approximation algorithms for depth queries and maximum depth.
CoRR, 2020

On Radial Isotropic Position: Theory and Algorithms.
CoRR, 2020

Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity.
CoRR, 2020

Adversarially Robust Streaming Algorithms via Differential Privacy.
CoRR, 2020

Near-optimal Regret Bounds for Stochastic Shortest Path.
CoRR, 2020

Output sensitive algorithms for approximate incidences and their applications.
Comput. Geom., 2020

Reachability Oracles for Directed Transmission Graphs.
Algorithmica, 2020

Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Competitive Analysis with a Sample and the Secretary Problem.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Sample Complexity Bounds for Influence Maximization.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

How to Find a Point in the Convex Hull Privately.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Privately Learning Thresholds: Closing the Exponential Gap.
Proceedings of the Conference on Learning Theory, 2020

Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies.
Proceedings of the Algorithmic Learning Theory, 2020

Thompson Sampling for Adversarial Bit Prediction.
Proceedings of the Algorithmic Learning Theory, 2020

Apprenticeship Learning via Frank-Wolfe.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Adjacency Labeling Schemes and Induced-Universal Graphs.
SIAM J. Discret. Math., 2019

Influence Maximization with Few Simulations.
CoRR, 2019

Average reward reinforcement learning with unknown mixing times.
CoRR, 2019

Learning and Generalization for Matching Problems.
CoRR, 2019

Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points.
Comput. Geom., 2019

Faster <i>k</i>-SAT algorithms using biased-PPSZ.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

A sort of an adversary.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Learning to Screen.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Differentially Private Learning of Geometric Concepts.
Proceedings of the 36th International Conference on Machine Learning, 2019

A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Triangles and Girth in Disk Graphs and Transmission Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Spanners for Directed Transmission Graphs.
SIAM J. Comput., 2018

Accurate Traffic Splitting on SDN Switches.
IEEE J. Sel. Areas Commun., 2018

Hierarchical Reinforcement Learning: Approximating Optimal Discounted TSP Using Local Policies.
CoRR, 2018

Representations of Sparse Distributed Networks: A Locality-Sensitive Approach.
CoRR, 2018

Routing in Unit Disk Graphs.
Algorithmica, 2018

Accurate Traffic Splitting on Commodity Switches.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Dynamic Representations of Sparse Distributed Networks: A Locality-Sensitive Approach.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic <i>Õ</i>(<i>n</i><sup>5/3</sup>) Time.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Prophet Secretary: Surpassing the 1-1/e Barrier.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Differentially Private k-Means with Constant Multiplicative Error.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Pairing heaps: the forward variant.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Stabbing Pairwise Intersecting Disks by Five Points.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Approximate Minimum-Weight Matching with Outliers Under Translation.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Union of Hypercubes and 3D Minkowski Sums with Random Sizes.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications.
ACM Trans. Algorithms, 2017

Hollow Heaps.
ACM Trans. Algorithms, 2017

Minimum-Cost Flows in Unit-Capacity Networks.
Theory Comput. Syst., 2017

Upward Max-Min Fairness.
J. ACM, 2017

Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n<sup>5/3</sup>) time.
CoRR, 2017

Clustering over Multi-Objective Samples: The one2all Sample.
CoRR, 2017

Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

(1 + ∊)-Approximate <i>f</i>-Sensitive Distance Oracles.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Min-Cost Bipartite Perfect Matching with Delays.
Proceedings of the Approximation, 2017

2016
Optimal In/Out TCAM Encodings of Ranges.
IEEE/ACM Trans. Netw., 2016

The AND-OR Game.
ACM Trans. Economics and Comput., 2016

Approximating the $k$-Level in Three-Dimensional Plane Arrangements.
CoRR, 2016

Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays.
CoRR, 2016

Bottleneck Paths and Trees and Deterministic Graphical Games.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Approximating the <i>k</i>-Level in Three-Dimensional Plane Arrangements.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection.
ACM Trans. Algorithms, 2015

Minimal indices for predecessor search.
Inf. Comput., 2015

Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions.
Discret. Comput. Geom., 2015

Stable Delaunay Graphs.
Discret. Comput. Geom., 2015

On the Complexity of Hub Labeling.
CoRR, 2015

A faster algorithm for the discrete Fréchet distance under translation.
CoRR, 2015

Minimum Cost Flows in Graphs with Unit Capacities.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

The amortized cost of finding the minimum.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

On the Complexity of Hub Labeling (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search.
Proceedings of the Algorithms - ESA 2015, 2015

The Temp Secretary Problem.
Proceedings of the Algorithms - ESA 2015, 2015

Spanners and Reachability Oracles for Directed Transmission Graphs.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees.
Proceedings of the Approximation, 2015

2014
Reporting Neighbors in High-Dimensional Euclidean Space.
SIAM J. Comput., 2014

Computing the Discrete Fréchet Distance in Subquadratic Time.
SIAM J. Comput., 2014

Probe scheduling for efficient detection of silent failures.
Perform. Evaluation, 2014

Algorithms and estimators for summarization of unaggregated data streams.
J. Comput. Syst. Sci., 2014

Union of Random Minkowski Sums and Network Vulnerability Analysis.
Discret. Comput. Geom., 2014

The CB tree: a practical concurrent self-adjusting search tree.
Distributed Comput., 2014

Fibonacci Heaps Revisited.
CoRR, 2014

Epsilon-Nets for Halfspaces Revisited.
CoRR, 2014

Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Soft Heaps Simplified.
SIAM J. Comput., 2013

Answering Planning Queries with the Crowd.
Proc. VLDB Endow., 2013

Finding the largest Empty Disk containing a Query Point.
Int. J. Comput. Geom. Appl., 2013

Min-Cost Flow Duality in Planar Networks.
CoRR, 2013

A Labeling Approach to Incremental Cycle Detection.
CoRR, 2013

Minimal Indices for Successor Search.
CoRR, 2013

The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques.
CoRR, 2013

I/O Efficient Dynamic Data Structures for Longest Prefix Queries.
Algorithmica, 2013

Joint Cache Partition and Job Assignment on Multi-core Processors.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Reporting neighbors in high-dimensional Euclidean spaces.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Minimal Indices for Successor Search - (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On finding an optimal TCAM encoding scheme for packet classification.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Union of random minkowski sums and network vulnerability analysis.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

Scheduling Subset Tests: One-Time, Continuous, and How They Relate.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

What You Can Do with Coordinated Samples.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Improved Bounds for Geometric Permutations.
SIAM J. Comput., 2012

Envy-Free Makespan Approximation.
SIAM J. Comput., 2012

An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries.
SIAM J. Comput., 2012

Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique.
Discret. Comput. Geom., 2012

Unit Distances in Three Dimensions.
Comb. Probab. Comput., 2012

A Case for Customizing Estimators: Coordinated Samples
CoRR, 2012

How to Estimate Change from Samples
CoRR, 2012

The AND-OR Game: Equilibrium Characterization - (Working Paper).
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

CBTree: A Practical Concurrent Self-Adjusting Search Tree.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

How to split a flow?
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Finding the maximal empty disk containing a query point.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

2011
Data structures for mergeable trees.
ACM Trans. Algorithms, 2011

Optimal Cover of Points by Disks in a Simple Polygon.
SIAM J. Comput., 2011

Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums.
SIAM J. Comput., 2011

On lines, joints, and incidences in three dimensions.
J. Comb. Theory, Ser. A, 2011

The Overlay of Minimization Diagrams in a Randomized Incremental Construction.
Discret. Comput. Geom., 2011

Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting.
Discret. Comput. Geom., 2011

Foreword.
Discret. Appl. Math., 2011

Finding the Maximal Empty Rectangle Containing a Query Point
CoRR, 2011

A kinetic triangulation scheme for moving points in the plane.
Comput. Geom., 2011

A Simpler Linear-Time Recognition of Circular-Arc Graphs.
Algorithmica, 2011

Maximum Flow in Directed Planar Graphs with Vertex Capacities.
Algorithmica, 2011

Truth, Envy, and Truthful Market Clearing Bundle Pricing.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Minimum s-t cut in undirected planar graphs when the source and the sink are close.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Non-price equilibria in markets of discrete goods.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Get the most out of your sample: optimal unbiased estimators using partial information.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Maximum Flows by Incremental Breadth-First Search.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Line Transversals of Convex Polyhedra in R<sup>3</sup>.
SIAM J. Comput., 2010

Labeling Dynamic XML Trees.
SIAM J. Comput., 2010

On Lines and Joints.
Discret. Comput. Geom., 2010

On the Interplay between Incentive Compatibility and Envy Freeness
CoRR, 2010

Truth and Envy in Capacitated Allocation Games
CoRR, 2010

Guarding a Terrain by Two Watchtowers.
Algorithmica, 2010

Improved Recommendations via (More) Collaboration.
Proceedings of the 13th International Workshop on the Web and Databases 2010, 2010

Envy-free makespan approximation: extended abstract.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Kinetic stable Delaunay graphs.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions.
ACM Trans. Algorithms, 2009

Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles.
ACM Trans. Algorithms, 2009

Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments.
Proc. VLDB Endow., 2009

Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets.
Proc. VLDB Endow., 2009

Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs.
Discret. Appl. Math., 2009

Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra.
Algorithmica, 2009

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

A simpler implementation and analysis of Chazelle's soft heaps.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Line transversals of convex polyhedra in <i>R</i><sup>3</sup>.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Stream sampling for variance-optimal estimation of subset sums.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Leveraging discarded samples for tighter estimation of multiple-set aggregates.
Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009

2008
Thin heaps, thick heaps.
ACM Trans. Algorithms, 2008

Kinetic and dynamic data structures for closest pair and all nearest neighbors.
ACM Trans. Algorithms, 2008

Efficient Colored Orthogonal Range Counting.
SIAM J. Comput., 2008

Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems.
SIAM J. Comput., 2008

Tighter estimation using bottom k sketches.
Proc. VLDB Endow., 2008

Weak ε-nets and interval chains.
J. ACM, 2008

Variance optimal sampling based estimation of subset sums
CoRR, 2008

Sketch-Based Estimation of Subpopulation-Weight
CoRR, 2008

Processing top-k queries from samples.
Comput. Networks, 2008

Estimating Aggregates over Multiple Sets.
Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

Path Minima in Incremental Unrooted Trees.
Proceedings of the Algorithms, 2008

2007
A simpler analysis of Burrows-Wheeler-based compression.
Theor. Comput. Sci., 2007

Online Conflict-Free Coloring for Intervals.
SIAM J. Comput., 2007

Compact Labeling Scheme for XML Ancestor Queries.
Theory Comput. Syst., 2007

Spatially-decaying aggregation over a network.
J. Comput. Syst. Sci., 2007

Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213].
Inf. Comput., 2007

Kinetic and dynamic data structures for convex hulls and upper envelopes.
Comput. Geom., 2007

Associative search in peer to peer networks: Harnessing latent semantics.
Comput. Networks, 2007

Better Landmarks Within Reach.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Counting colors in boxes.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Bottom-k sketches: better and more efficient estimation of aggregates.
Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2007

Sketching unaggregated data streams for subpopulation-size queries.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Summarizing data using bottom-k sketches.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Algorithms and estimators for accurate summarization of internet traffic.
Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, 2007

Strong Price of Anarchy for Machine Load Balancing.
Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

Most Burrows-Wheeler Based Compressors Are Not Optimal.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Computing the volume of the union of cubes.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
Compact Labeling Scheme for Ancestor Queries.
SIAM J. Comput., 2006

Partial alphabetic trees.
J. Algorithms, 2006

The greedy algorithm for edit distance with moves.
Inf. Process. Lett., 2006

Finding the Position of the <i>k</i>-Mismatch and Approximate Tandem Repeats.
Proceedings of the Algorithm Theory, 2006

Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Reach for A*: Shortest Path Algorithms with Preprocessing.
Proceedings of the Shortest Path Problem, 2006

Colored intersection searching via sparse rectangular matrix multiplication.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Reach for A*: Efficient Point-to-Point Shortest Path Algorithms.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005
<i>Corrigendum: </i> a new, simpler linear-time dominators algorithm.
ACM Trans. Program. Lang. Syst., 2005

Performance aspects of distributed caches using TTL-based consistency.
Theor. Comput. Sci., 2005

Sorting signed permutations by reversals, revisited.
J. Comput. Syst. Sci., 2005

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.
J. ACM, 2005

The greedy algorithm for shortest superstrings.
Inf. Process. Lett., 2005

On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems.
Discret. Math., 2005

Learning with attribute costs.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Guarding a terrain by two watchtowers.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Secure Exchange of Modifiable Data and Queries.
Proceedings of the 21èmes Journées Bases de Données Avancées, 2005

2004
Persistent Data Structures.
Proceedings of the Handbook of Data Structures and Applications., 2004

Balanced-Replication Algorithms for Distribution Trees.
SIAM J. Comput., 2004

Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment.
Theory Comput. Syst., 2004

Optimal oblivious routing in polynomial time.
J. Comput. Syst. Sci., 2004

Efficient estimation algorithms for neighborhood variance and other moments.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Spatially-decaying aggregation over a network: model and algorithms.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

2003
Reachability and Distance Queries via 2-Hop Labels.
SIAM J. Comput., 2003

Predicting and bypassing end-to-end Internet service degradations.
IEEE J. Sel. Areas Commun., 2003

Connection caching: model and algorithms.
J. Comput. Syst. Sci., 2003

Making data structures confluently persistent.
J. Algorithms, 2003

Proactive caching of DNS records: addressing a performance bottleneck.
Comput. Networks, 2003

A case for associative peer to peer overlays.
Computer Communication Review, 2003

Dynamic rectangular intersection with priorities.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Efficient sequences of trials.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems.
Math. Program., 2002

Scalable Secure Storage When Half the System Is Faulty.
Inf. Comput., 2002

Restoration by path concatenation: fast recovery of MPLS paths.
Distributed Comput., 2002

Prefetching the means for document transfer: a new approach for reducing Web latency.
Comput. Networks, 2002

Refreshment policies for Web content caches.
Comput. Networks, 2002

Competitive Analysis of the LRFU Paging Algorithm.
Algorithmica, 2002

Exploiting Regularities in Web Traffic Patterns for Cache Replacement.
Algorithmica, 2002

Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach.
Algorithmica, 2002

Meldable heaps and boolean union-find.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Nearest common ancestors: a survey and a new distributed algorithm.
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Union-find with deletions.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

A comparison of labeling schemes for ancestor queries.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Unique Maximum Matching Algorithms.
J. Algorithms, 2001

Short and Simple Labels for Small Distances and Other Functions.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

The Age Penalty and Its Effect on Cache Performance.
Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems, 2001

Faster kinetic heaps and their use in broadcast scheduling.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Compact labeling schemes for ancestor queries.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Restoration path concatenation: fast recovery of MPLS paths.
Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001

Aging through cascaded caches: performance issues in the distribution of web content.
Proceedings of the ACM SIGCOMM 2001 Conference on Applications, 2001

2000
Simple Confluently Persistent Catenable Lists.
SIAM J. Comput., 2000

Connection caching under vaious models of communication.
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

1999
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs.
SIAM J. Comput., 1999

A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals.
SIAM J. Comput., 1999

Managing TCP Connections Under Persistent HTTP.
Comput. Networks, 1999

Bounded Degree Interval Sandwich Problems.
Algorithmica, 1999

Connection Caching.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

On-line Complexity of Monotone Set Systems.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

LP-based Analysis of Greedy-dual-size.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
A New, Simpler Linear-Time Dominators Algorithm.
ACM Trans. Program. Lang. Syst., 1998

Simple Confluently Persistent Catenable Lists (Extended Abstract).
Proceedings of the Algorithm Theory, 1998

Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Cell Flipping in Permutation Diagrams.
Proceedings of the STACS 98, 1998

1996
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques.
SIAM J. Comput., 1996

Purely Functional Representations of Catenable Sorted Lists.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Physical Maps and Interval Sandwich Problems: Bounded Degrees Help.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995
Four Strikes Against Physical Mapping of DNA.
J. Comput. Biol., 1995

Graph Sandwich Problems.
J. Algorithms, 1995

Persistent lists with catenation via recursive slow-down.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
The Domatic Number Problem on Some Perfect Graph Families.
Inf. Process. Lett., 1994

Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993


  Loading...