The following pages link to Haim Kaplan (Q243604):
Displaying 50 items.
- Union of random Minkowski sums and network vulnerability analysis (Q471144) (← links)
- On lines and joints (Q603871) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- A kinetic triangulation scheme for moving points in the plane (Q632719) (← links)
- The overlay of minimization diagrams in a randomized incremental construction (Q633216) (← links)
- Maximum flow in directed planar graphs with vertex capacities (Q634675) (← links)
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- Nearest common ancestors: a survey and a new algorithm for a distributed environment (Q706323) (← links)
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
- Output sensitive algorithms for approximate incidences and their applications (Q827295) (← links)
- Linear data structures for fast ray-shooting amidst convex polyhedra (Q834599) (← links)
- The greedy algorithm for shortest superstrings (Q834977) (← links)
- Kinetic and dynamic data structures for convex hulls and upper envelopes (Q857064) (← links)
- Compact labeling scheme for XML ancestor queries (Q866913) (← links)
- Associative search in peer to peer networks: Harnessing latent semantics (Q878694) (← links)
- Spatially-decaying aggregation over a network (Q878748) (← links)
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions (Q908209) (← links)
- Processing top-\(k\) queries from samples (Q948026) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- The greedy algorithm for edit distance with moves (Q1045883) (← links)
- (Q1293874) (redirect page) (← links)
- Bounded degree interval sandwich problems (Q1293876) (← links)
- The domatic number problem on some perfect graph families (Q1313715) (← links)
- On the complexity of DNA physical mapping (Q1338883) (← links)
- Caching documents with variable sizes and fetching costs: an LP-based approach (Q1348944) (← links)
- Proactive caching of DNS records: Addressing a performance bottleneck. (Q1400391) (← links)
- Connection caching: Model and algorithms. (Q1401982) (← links)
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (Q1600093) (← links)
- Exploiting regularities in web traffic patterns for cache replacement (Q1600991) (← links)
- Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
- Routing in unit disk graphs (Q1742368) (← links)
- Performance aspects of distributed caches using TTL-based consistency (Q1770426) (← links)
- Sorting signed permutations by reversals, revisited (Q1775771) (← links)
- Competitive analysis of the LRFU paging algorithm (Q1849588) (← links)
- Scalable secure storage when half the system is faulty (Q1854529) (← links)
- I/O efficient dynamic data structures for longest prefix queries (Q1939656) (← links)
- Union of hypercubes and 3D Minkowski sums with random sizes (Q2022617) (← links)
- Stabbing pairwise intersecting disks by five points (Q2032723) (← links)
- Separating adaptive streaming from oblivious streaming using the bounded storage model (Q2128990) (← links)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- The CB tree: a practical concurrent self-adjusting search tree (Q2256968) (← links)
- Reachability oracles for directed transmission graphs (Q2309470) (← links)
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points (Q2331206) (← links)
- Addendum to ``Scalable secure storage when half the system is faulty'' [inform. comput. 174 (2)(2002) 203-213] (Q2373880) (← links)
- On lines, joints, and incidences in three dimensions (Q2431258) (← links)
- Algorithms and estimators for summarization of unaggregated data streams (Q2453543) (← links)
- A simpler analysis of Burrows-Wheeler-based compression (Q2465054) (← links)
- On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (Q2484367) (← links)
- Minimal indices for predecessor search (Q2514143) (← links)
