Haim Kaplan

Haim Kaplan's AcademicInfluence.com Rankings

Haim Kaplan

Computer Science

#9837

World Rank

#10320

Historical Rank

Database

#6789

World Rank

#7028

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Haim Kaplan's Degrees

PhD Computer Science Tel Aviv University
Masters Computer Science Tel Aviv University
Bachelors Computer Science Tel Aviv University

Similar Degrees You Can Earn

Why Is Haim Kaplan Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Haim Kaplan's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Reachability and distance queries via 2-hop labels (2002) (607)
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms (2006) (293)
Labeling dynamic XML trees (2002) (275)
Associative search in peer to peer networks: harnessing latent semantics (2003) (250)
Faster and simpler algorithm for sorting signed permutations by reversals (1997) (237)
Optimal oblivious routing in polynomial time (2003) (208)
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs (2003) (203)
Four Strikes Against Physical Mapping of DNA (1995) (190)
Compact labeling schemes for ancestor queries (2001) (169)
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (1996) (155)
Prefetching the means for document transfer: a new approach for reducing Web latency (2000) (149)
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs (1999) (147)
Computing the Discrete Fréchet Distance in Subquadratic Time (2012) (146)
On the Complexity of DNA Physical Mapping (1994) (129)
Summarizing data using bottom-k sketches (2007) (129)
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals (1999) (126)
Proactive caching of DNS records: addressing a performance bottleneck (2001) (115)
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques (1996) (108)
A comparison of labeling schemes for ancestor queries (2002) (105)
Nearest common ancestors: a survey and a new distributed algorithm (2002) (104)
Private coresets (2009) (104)
Non-price equilibria in markets of discrete goods (2011) (102)
Maximum Flows by Incremental Breadth-First Search (2011) (92)
Simple Proofs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique (2011) (87)
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (2006) (79)
Better Landmarks Within Reach (2007) (78)
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment (2004) (77)
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems (2008) (74)
Refreshment policies for Web content caches (2001) (73)
Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping (1994) (69)
A new, simpler linear-time dominators algorithm (1998) (68)
Tighter estimation using bottom k sketches (2008) (68)
Reach for A*: Shortest Path Algorithms with Preprocessing (2006) (67)
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums (2008) (67)
Unit Distances in Three Dimensions (2011) (66)
Scalable Secure Storage When Half the System Is Faulty (2000) (65)
Unique maximum matching algorithms (1999) (64)
Learning with attribute costs (2005) (61)
Prophet Secretary: Surpassing the 1-1/e Barrier (2017) (61)
On lines, joints, and incidences in three dimensions (2009) (61)
On Lines and Joints (2009) (60)
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications (2016) (58)
Strong Price of Anarchy for Machine Load Balancing (2007) (58)
The greedy algorithm for shortest superstrings (2005) (58)
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators (1998) (57)
Compact Labeling Scheme for Ancestor Queries (2006) (55)
Spatially-decaying aggregation over a network: model and algorithms (2004) (54)
Persistent Data Structures (2004) (54)
CBTree: A Practical Concurrent Self-Adjusting Search Tree (2012) (54)
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions (2007) (53)
Short and Simple Labels for Small Distances and Other Functions (2001) (52)
Adjacency Labeling Schemes and Induced-Universal Graphs (2014) (51)
How to split a flow? (2012) (50)
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search (2015) (48)
Colored intersection searching via sparse rectangular matrix multiplication (2006) (47)
Min-Cost Bipartite Perfect Matching with Delays (2017) (46)
Aging through cascaded caches: performance issues in the distribution of web content (2001) (46)
Adversarially Robust Streaming Algorithms via Differential Privacy (2020) (45)
Purely functional representations of catenable sorted lists (1996) (45)
Persistent lists with catenation via recursive slow-down (1995) (45)
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications (2012) (45)
Answering Planning Queries with the Crowd (2013) (45)
Efficient Colored Orthogonal Range Counting (2008) (45)
A case for associative peer to peer overlays (2003) (44)
Managing TCP Connections Under Persistent HTTP (1999) (44)
Near-optimal Regret Bounds for Stochastic Shortest Path (2020) (43)
Making data structures confluently persistent (2001) (40)
Exploiting regularities in Web traffic patterns for cache replacement (1999) (40)
Upward Max Min Fairness (2012) (40)
Privately Learning Thresholds: Closing the Exponential Gap (2019) (39)
Dynamic rectangular intersection with priorities (2003) (39)
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time (2017) (39)
Meldable heaps and boolean union-find (2002) (39)
On finding an optimal TCAM encoding scheme for packet classification (2013) (39)
Differentially Private k-Means with Constant Multiplicative Error (2018) (38)
Kinetic and dynamic data structures for closest pair and all nearest neighbors (2008) (37)
Spatially-decaying aggregation over a network (2007) (36)
Optimal In/Out TCAM Encodings of Ranges (2016) (35)
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles (2009) (35)
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays (2017) (35)
Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals (2003) (34)
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (2006) (34)
Weak ε-nets and interval chains (2008) (32)
Competitive Analysis with a Sample and the Secretary Problem (2019) (32)
Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments (2009) (32)
The greedy algorithm for edit distance with moves (2006) (32)
Union of Random Minkowski Sums and Network Vulnerability Analysis (2013) (32)
Counting colors in boxes (2007) (31)
A Simpler Linear-Time Recognition of Circular-Arc Graphs (2006) (31)
Faster k-SAT algorithms using biased-PPSZ (2019) (31)
A simpler analysis of Burrows-Wheeler-based compression (2007) (30)
Bounded Degree Interval Sandwich Problems (1999) (30)
The Domatic Number Problem on Some Perfect Graph Families (1994) (30)
Leveraging discarded samples for tighter estimation of multiple-set aggregates (2009) (30)
Algorithms and estimators for accurate summarization of internet traffic (2007) (29)
Union-find with deletions (2002) (29)
Restoration by path concatenation: fast recovery of MPLS paths (2001) (28)
Purely functional, real-time deques with catenation (1999) (28)
What You Can Do with Coordinated Samples (2012) (28)
The Age Penalty and Its Effect on Cache Performance (2001) (28)
Thin heaps, thick heaps (2008) (27)
Kinetic and dynamic data structures for convex hulls and upper envelopes (2005) (27)
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting (2006) (26)
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees (2015) (25)
Faster kinetic heaps and their use in broadcast scheduling (2001) (25)
Efficient sequences of trials (2003) (25)
Kinetic stable Delaunay graphs (2010) (24)
Maximum Flow in Directed Planar Graphs with Vertex Capacities (2009) (24)
Truth, Envy, and Truthful Market Clearing Bundle Pricing (2011) (24)
Predicting and bypassing end-to-end internet service degradations (2002) (24)
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications (2017) (24)
Bottom-k sketches: better and more efficient estimation of aggregates (2007) (23)
Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings (2010) (23)
Sorting signed permutations by reversals, revisited (2005) (22)
Selection from heaps, row-sorted matrices and X+Y using soft heaps (2018) (22)
Routing in Unit Disk Graphs (2015) (22)
Sketching unaggregated data streams for subpopulation-size queries (2007) (22)
Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model (2021) (21)
Simple Confluently Persistent Catenable Lists (2000) (20)
(1 + ∊)-Approximate f-Sensitive Distance Oracles (2017) (20)
Computing the volume of the union of cubes (2007) (20)
The CB tree: a practical concurrent self-adjusting search tree (2014) (20)
Performance aspects of distributed caches using TTL-based consistency (2001) (20)
LP-based analysis of greedy-dual-size (1999) (18)
Connection caching (1999) (18)
Corrigendum: a new, simpler linear-time dominators algorithm (2005) (17)
Restoration by path concatenation: fast recovery of MPLS paths (2001) (17)
Guarding a Terrain by Two Watchtowers (2005) (17)
The Overlay of Minimization Diagrams in a Randomized Incremental Construction (2011) (16)
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection (2013) (16)
Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting (2011) (16)
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds (2021) (15)
Minimum s-t cut in undirected planar graphs when the source and the sink are close (2011) (15)
Optimal Cover of Points by Disks in a Simple Polygon (2010) (15)
Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213] (2007) (15)
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection (2013) (15)
Most Burrows-Wheeler Based Compressors Are Not Optimal (2007) (14)
The Temp Secretary Problem (2015) (14)
Spanners and Reachability Oracles for Directed Transmission Graphs (2015) (13)
Differentially Private Multi-Armed Bandits in the Shuffle Model (2021) (13)
Minimum-Cost Flows in Unit-Capacity Networks (2017) (13)
Reporting Neighbors in High-Dimensional Euclidean Space (2013) (13)
FriendlyCore: Practical Differentially Private Aggregation (2021) (12)
Connection caching under various models of communication (2000) (12)
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries (2012) (12)
Stabbing pairwise intersecting disks by five points (2018) (12)
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location (2017) (12)
Accurate Traffic Splitting on Commodity Switches (2018) (12)
Efficient estimation algorithms for neighborhood variance and other moments (2004) (12)
Algorithms and estimators for summarization of unaggregated data streams (2014) (12)
Hollow Heaps (2015) (12)
On the Complexity of Hub Labeling (2015) (12)
A kinetic triangulation scheme for moving points in the plane (2010) (11)
Finding the Maximal Empty Rectangle Containing a Query Point (2011) (11)
Envy-free makespan approximation: extended abstract (2009) (11)
A faster algorithm for the discrete Fréchet distance under translation (2015) (11)
Online Weighted Matching with a Sample (2021) (11)
Separating Adaptive Streaming from Oblivious Streaming (2021) (11)
Finding the maximal empty disk containing a query point (2012) (11)
Data structures for mergeable trees (2007) (11)
Apprenticeship Learning via Frank-Wolfe (2019) (11)
A simpler implementation and analysis of Chazelle's soft heaps (2009) (10)
Epsilon-Nets for Halfspaces Revisited (2014) (10)
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles (2014) (10)
Differentially-Private Clustering of Easy Instances (2021) (10)
Processing top k queries from samples (2006) (10)
Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity (2020) (10)
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions (2014) (10)
Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach (2002) (10)
Competitive Analysis of the LRFU Paging Algorithm (2001) (9)
The Sparse Vector Technique, Revisited (2020) (9)
How to Find a Point in the Convex Hull Privately (2020) (9)
Average reward reinforcement learning with unknown mixing times (2019) (9)
Minimum Cost Flows in Graphs with Unit Capacities (2015) (9)
Path Minima in Incremental Unrooted Trees (2008) (9)
Envy-Free Makespan Approximation (2009) (8)
Optimal Representations of a Traffic Distribution in Switch Memories (2019) (8)
Dynamic Representations of Sparse Distributed Networks: A Locality-Sensitive Approach (2018) (8)
Stable Delaunay Graphs (2015) (8)
Get the most out of your sample: optimal unbiased estimators using partial information (2011) (8)
Spanners for Directed Transmission Graphs (2016) (8)
Sample Complexity Bounds for Influence Maximization (2019) (8)
Identifying Nearest Common Ancestors in a Distributed Environment (2001) (8)
Differentially Private Approximate Quantiles (2021) (8)
Physical Maps and Interval Sandwich Problems: Bounded Degrees Help (1996) (8)
Just the fax—differentiating voice and fax phone lines using call billing data (1999) (8)
Fibonacci Heaps Revisited (2014) (7)
Variance optimal sampling based estimation of subset sums (2008) (7)
Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points (2019) (7)
A Simpler Analysis of Burrows-Wheeler Based Compression (2006) (7)
Purely functional lists (1997) (7)
A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games (2019) (7)
Compact Labeling Scheme for XML Ancestor Queries (2007) (7)
Improved recommendations via (more) collaboration (2010) (7)
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra (2009) (7)
Line Transversals of Convex Polyhedra in R3 (2009) (7)
On the Interplay between Incentive Compatibility and Envy Freeness (2010) (7)
Soft Heaps Simplified (2013) (7)
On Radial Isotropic Position: Theory and Algorithms (2020) (7)
Connection caching: model and algorithms (2003) (7)
A Labeling Approach to Incremental Cycle Detection (2013) (7)
Finding the Position of the k-Mismatch and Approximate Tandem Repeats (2006) (6)
Finding the Girth in Disk Graphs and a Directed Triangle in Transmission Graphs (2018) (6)
Accurate Traffic Splitting on SDN Switches (2018) (6)
Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS (2017) (6)
Improved Bounds for Geometric Permutations (2010) (6)
Unknown mixing times in apprenticeship and reinforcement learning (2019) (6)
On-line complexity of monotone set systems (1999) (5)
Sketch-Based Estimation of Subpopulation-Weight (2008) (5)
Balanced-Replication Algorithms for Distribution Trees (2002) (5)
Approximating the $k$-Level in Three-Dimensional Plane Arrangements (2016) (5)
Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies (2019) (5)
Processing top-k queries from samples (2008) (5)
Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets (2009) (5)
Truth and Envy in Capacitated Allocation Games (2010) (4)
How to Estimate Change from Samples (2012) (4)
Union of Hypercubes and 3D Minkowski Sums with Random Sizes (2021) (4)
A Case for Customizing Estimators: Coordinated Samples (2012) (4)
General techniques for approximate incidences and their application to the camera posing problem (2019) (4)
Reachability Oracles for Disk Transmission Graphs (2014) (4)
Simple Confluently Persistent Catenable Lists (Extended Abstract) (1998) (4)
Online Markov Decision Processes with Aggregate Bandit Feedback (2021) (4)
On the Complexity of Hub Labeling (Extended Abstract) (2015) (4)
Differentially Private Learning of Geometric Concepts (2019) (4)
A Faster Primal Network Simplex Algorithm (1996) (4)
Probe scheduling for efficient detection of silent failures (2013) (4)
Triangles and Girth in Disk Graphs and Transmission Graphs (2019) (4)
Clustering in Hypergraphs to Minimize Average Edge Service Time (2020) (4)
Partial alphabetic trees (2002) (4)
Efficient Spanner Construction for Directed Transmission Graphs ∗ (2015) (4)
Dynamic Connectivity for Unit Disk Graphs ∗ (2015) (3)
Approximate Minimum-Weight Matching with Outliers under Translation (2018) (3)
A Note on Sanitizing Streams with Differential Privacy (2021) (3)
Deletion only Dynamic Connectivity for Disk Graphs∗ (2021) (3)
How Much TCAM do we Need for Splitting Traffic? (2021) (3)
Optimal approximations for traffic distribution in bounded switch memories (2020) (3)
Voronoi diagrams on planar graphs , and computing the diameter in deterministic Õ ( n 5 / 3 ) time Pawe (2017) (3)
Bottleneck Paths and Trees and Deterministic Graphical Games (2016) (3)
Learning to Screen (2019) (3)
Joint Cache Partition and Job Assignment on Multi-core Processors (2012) (2)
Answering Planning Queries with the Crowd (Technical report) (2013) (2)
Coding Size of Traffic Partition in Switch Memories (2022) (2)
Output Sensitive Algorithms for Approximate Incidences and Their Applications (2020) (2)
The amortized cost of finding the minimum (2015) (2)
Improved bounds for multipass pairing heaps and path-balanced binary search trees (2018) (2)
Minimal Total Deviation in TCAM Load Balancing (2022) (2)
Dynamic Connectivity in Disk Graphs (2021) (2)
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player (2022) (2)
Locality Sensitive Hashing for Efficient Similar Polygon Retrieval (2021) (2)
Reachability Oracles for Directed Transmission Graphs (2016) (2)
Reporting neighbors in high-dimensional Euclidean spaces (2013) (2)
Almost Tight Bounds for Online Facility Location in the Random-Order Model (2022) (2)
Online Weighted Bipartite Matching with a Sample (2021) (2)
Estimating Aggregates over Multiple Sets (2008) (2)
Competitive Analysis of the LRFU Paging Algorithm (2002) (2)
The AND-OR Game: Equilibrium Characterization - (Working Paper) (2012) (2)
Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays (2016) (2)
Optimal Weighted Load Balancing in TCAMs (2021) (2)
Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract) (1993) (2)
Union--nd with Deletions (2002) (2)
Cell Flipping in Permutation Diagrams (1998) (1)
The Time-to-Live Based Consistency Mechanism: (2005) (1)
I/O Efficient Dynamic Data Structures for Longest Prefix Queries (2008) (1)
Hierarchical Reinforcement Learning: Approximating Optimal Discounted TSP Using Local Policies (2018) (1)
Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations (2020) (1)
The Discrete and Semi-continuous Fr\'echet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques (2013) (1)
Finding Triangles and Computing the Girth in Disk Graphs ∗ (2017) (1)
Optimal Representations of a Traffic Distribution in Switch Memories (2020) (1)
Clustering over Multi-Objective Samples: The one2all Sample (2017) (1)
Pairing heaps: the forward variant (2017) (1)
Min-Cost Flow Duality in Planar Networks (2013) (1)
Minimum-Cost Flows in Unit-Capacity Networks (2017) (1)
Union of Random Minkowski Sums and Network Vulnerability Analysis (2014) (1)
Exploiting Regularities in Web Traffic Patterns for Cache Replacement (2002) (1)
Scheduling Subset Tests: One-Time, Continuous, and How They Relate (2013) (1)
Duality-based approximation algorithms for depth queries and maximum depth (2020) (1)
Minimal indices for predecessor search (2015) (1)
Thompson Sampling for Adversarial Bit Prediction (2019) (1)
Linear-Time Pointer-Machine Algorithms for Path-Evaluation Problems on Trees and Graphs (2002) (1)
Finding the largest Empty Disk containing a Query Point (2013) (1)
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (2005) (1)
Sampling Hyperplanes and Revealing Disks∗ (2021) (1)
Simulating a stack using queues (2022) (1)
ε-Nets for Halfspaces Revisited ∗ (2014) (1)
Monotone Learning (2022) (1)
Finding Path Minima in Incremental Unrooted Trees ∗ (2008) (0)
The CB tree: a practical concurrent self-adjusting search tree (2014) (0)
Learning and Generalization for Matching Problems (2019) (0)
Line Transversals of Convex Polyhedra in $\reals^3$ (2008) (0)
Duality-based approximation algorithms for maximum depth (2020) (0)
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm (2023) (0)
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions (2015) (0)
Minimal Indices for Successor Search - (Extended Abstract) (2013) (0)
Seminar on Advanced topics in data structures (2007) (0)
The AND-OR Game (2016) (0)
Insertion-Only Dynamic Connectivity in General Disk Graphs (2023) (0)
Proceeding of the Annual ACM-SIAM Symposium on Discrete Algorithms: Preface (2005) (0)
A sort of an adversary (2019) (0)
Differentially-Private Bayes Consistency (2022) (0)
Metric Spaces: High Scalability with Tight Statistical Gua rantees (2015) (0)
C G ] 1 2 O ct 2 01 4 ε-Nets for Halfspaces Revisited ∗ (2014) (0)
D S ] 2 2 O ct 2 01 5 Hollow Heaps ∗ (2015) (0)
Codes for Load Balancing in TCAMs: Size Analysis (2022) (0)
Efficient Construction of Spanners and BFS Trees for Disk Transmission Graphs (システム数理と応用) (2014) (0)
Fast approximation of search trees on trees with centroid trees (2022) (0)
Secure Exchange of Modifiable Data and Queries (2005) (0)
Concurrent Shuffle Differential Privacy Under Continual Observation (2023) (0)
Minimal Indices for Successor Search [ Full Version ] (2018) (0)
Routing in Unit Disk Graphs (2017) (0)
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location (2019) (0)
Influence Maximization with Few Simulations (2019) (0)
Reachability Oracles for Directed Transmission Graphs (2019) (0)
Proceedings of the 12th Scandinavian conference on Algorithm Theory (2010) (0)
Stable Delaunay Graphs (2015) (0)
Estimation from Coordinated Samples: Competitiveness and Customization (2012) (0)
Bottleneck paths and trees and deterministic graphical (2018) (0)
Dynamic Representations of Sparse Distributed Networks (2021) (0)
Talk titles and abstracts for the 2nd FILOFOCS workshop (2013) (0)
On Differentially Private Online Predictions (2023) (0)
Coordinated Weighted Sampling: Estimation of Multiple-Assignment Aggregates (2021) (0)
I/O Efficient Dynamic Data Structures for Longest Prefix Queries (2011) (0)
Simple Proofs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique (2012) (0)
Testing Transmission Graphs for Acyclicity ∗ (2019) (0)
Restoration by Path Con atenation : Fast Re overy of MPLS Paths (2001) (0)
Minimal Indices for Successor Search (2013) (0)