The following pages link to David Rappaport (Q170487):
Displayed 12 items.
- Descriptional Complexity of Error Detection (Q4686648) (← links)
- MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS (Q4848831) (← links)
- On Representing Graphs by Touching Cuboids (Q4912201) (← links)
- Probing a set of hyperplanes by lines and related problems (Q5060099) (← links)
- An optimal algorithm to compute the inverse beacon attraction region (Q5115823) (← links)
- Maximum Rectilinear Convex Subsets (Q5149759) (← links)
- State Complexity of Suffix Distance (Q5205049) (← links)
- Compatible Geometric Matchings (Q5301007) (← links)
- Quasi-Distances and Weighted Finite Automata (Q5500694) (← links)
- Discrete and Computational Geometry (Q5897108) (← links)
- Minimum convex partition of a constrained point set (Q5929323) (← links)
- On the visibility graph of convex translates (Q5951963) (← links)