- Sketching Unaggregated Data Streams for SubpopulationSize Queries
- Optimal Oblivious Routing in Polynomial Time Yossi Azar \Lambda Edith Cohen y Amos Fiat \Lambda Haim Kaplan \Lambda Harald Racke z
- Ecient Sequences of Trials Edith Cohen Amos Fiat y Haim Kaplan y
- A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph
- Randomized Incremental Constructions of ThreeDimensional Convex Hulls and Planar Voronoi Diagrams, and Approximate Range Counting #
- Reachability and distance queries via 2hop labels Edith Cohen \Lambda Eran Halperin y Haim Kaplan y Uri Zwick y
- Strong Price of Anarchy Machine Load Balancing
- Online Conflict Free Coloring for Halfplanes, Congruent Disks, and Axis-Parallel Rectangles
- Dynamic Rectangular Intersection with Priorities # Haim Kaplan
- A FASTER AND SIMPLER ALGORITHM FOR SORTING SIGNED PERMUTATIONS BY REVERSALS
- Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting
- Finding Path Minima in Incremental Unrooted Trees Haim Kaplan
- Haim Kaplan and Ron Shamir School of Mathematical Sciences
- Efficient Estimation Algorithms for Neighborhood Variance and Other Moments
- Scalable Secure Storage when Half the System is Faulty x Noga Alon Haim Kaplan Michael Krivelevich Dahlia Malkhi y Julien Stern z
- Four Strikes Against Physical Mapping of DNA Paul W. Goldberg
- The Greedy Algorithm for Edit Distance with Moves Haim Kaplan Nira Shafrir
- Online ConflictFree Coloring for Intervals 1 Ke Chen 2 Amos Fiat 3 Haim Kaplan 4 Meital Levy 5 Jir Matousek 6
- Sorting Signed Permutations by Reversals, Revisited Haim Kaplan Elad Verbin y
- Most BurrowsWheeler Based Compressors are Not Optimal
- Cell Flipping Problems on Permutation Diagrams Martin Charles Golumbic Haim Kaplan Elad Verbin
- The Greedy Algorithm for Shortest Superstrings Haim Kaplan Nira Shafrir
- Counting Colors in Boxes Haim Kaplan
- SpatiallyDecaying Aggregation Over a Network Edith Cohen \Lambda Haim Kaplan y
- Restoration by Path Concatenation: Fast Recovery of MPLS Paths
- Summarizing Data using Bottom-k Sketches Edith Cohen
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. Yoav Giyora
- Finding the position of the k-mismatch and approximate tandem repeats.
- A Simpler Linear-Time Recognition of Circular-Arc Graphs
- Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc
- Colored Intersection Searching via Sparse Rectangular Matrix Multiplication
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- Associative Search in Peer to Peer Networks: Harnessing Latent Semantics #
- Bounded Degree Interval Sandwich Problems \Lambda Haim Kaplan y Ron Shamir z
- Persistent data structures Haim Kaplan
- Tighter Estimation using Bottom-k Sketches Edith Cohen
- Counting Colors in Boxes Haim Kaplan
- Kinetic and Dynamic Data Structures for Closest Pairs and All Nearest Neighbors
- Thin Heaps, Thick Heaps Haim Kaplan
- Addendum to "Scalable Secure Storage when Half the System is Haim Kaplan
- Making Data Structures Confluently Persistent Haim Kaplan
- Aging Through Cascaded Caches: Performance Issues in the Distribution of Web Content
- Short and Simple Labels for Small Distances and Other Functions
- Exploiting Regularities in Web Trac Patterns for Cache Replacement
- Unique Maximum Matching Algorithms Harold N. Gabow y Haim Kaplan z Robert E. Tarjan x
- Balanced-Replication Algorithms for Distribution Trees Edith Cohen Haim Kaplan y
- Unionfind with deletions Haim Kaplan \Lambda Nira Shafrir y Robert E. Tarjan z
- TRACTABILITY OF PARAMETERIZED COMPLETION PROBLEMS ON CHORDAL, STRONGLY CHORDAL AND PROPER INTERVAL
- Partial alphabetic trees # Arye Barkan + Haim Kaplan +
- Kinetic and Dynamic Data Structures for Convex Hulls and Upper Giora Alexandron
- Algorithms and Estimators for Accurate Summarization of Internet Traffic
- Guarding a Terrain by Two Watchtowers # Pankaj K. Agarwal + Sergey Bereg # Ovidiu Daescu # Haim Kaplan
- Better Landmarks within Reach Andrew V. Goldberg1
- Performance Aspects Of Distributed Caches Using TTLbased Consistency #
- Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency
- Pathwidth, Bandwidth and Completion Problems to Proper Interval Graphs with Small Cliques \Lambda
- Processing Top-k Queries from Samples Edith Cohen
- Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra
- I/O Efficient Dynamic Data Structures for Longest Prefix Queries
- Linear Data Structures for Fast Ray-Shooting amidst Convex Haim Kaplan
- Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed
- Computing the Volume of the Union of Cubes Pankaj K. Agarwal
- Compact labeling scheme for XML ancestor queries Haim Kaplan y Tova Milo y Ronen Shabo y
- LinearTime PointerMachine Algorithms for Least Common Ancestors, MST Verification, and Dominators
- A Simpler Analysis of BurrowsWheeler Based Compression
- Learning with Attribute Costs Haim Kaplan # Eyal Kushilevitz + Yishay Mansour #
- Just the Fax--Differentiating Voice and Fax Phone Lines Using Call Billing Data
- A New, Simpler Linear-Time Dominators Algorithm ADAM L. BUCHSBAUM, HAIM KAPLAN, ANNE ROGERS, and JEFFERY R. WEST-
- Weak -nets and interval chains Noga Alon, Haim Kaplan, Gabriel Nivasch1
- SIMPLE CONFLUENTLY PERSISTENT CATENABLE LISTS. HAIM KAPLAN , CHRIS OKASAKI y , AND ROBERT E. TARJAN z
- Graph Sandwich Problems Martin Charles Golumbic
- Purely Functional, RealTime Deques with Catenation Haim Kaplan \Lambda Robert E. Tarjan y
- Managing TCP Connections under Persistent HTTP Edith Cohen Haim Kaplan Jeffrey D. Oldham \Lambda
- Purely Functional Representations of Catenable Sorted Lists. Haim Kaplan 1 Robert E. Tarjan 2
- Refreshment Policies for Web Content Caches Edith Cohen
- Meldable Heaps and Boolean UnionFind (extended abstract)
- Processing Topk Queries from Samples Edith Cohen
- Connection Caching: Model and Algorithms Edith Cohen Haim Kaplan Uri Zwick
- Reach for A Efficient Point-to-Point Shortest Path Algorithms
- On the Complexity of DNA Physical Mapping Martin Charles Golumbic
- Caching Documents with Variable Sizes and Fetching Costs: An LPBased Approach \Lambda
- Reach for A Efficient Point-to-Point Shortest Path Algorithms
- Faster Kinetic Heaps and Their Use in Broadcast Scheduling (Extended Abstract)
- Online Complexity of Monotone Set Systems (extended abstract)
- THE TIMETOLIVE BASED CONSISTENCY Understanding performance issues and their impact
- Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
- Guarding a Terrain by Two Watchtowers Pankaj K. Agarwal
