Pages that link to "Item:Q5659062"
From MaRDI portal
The following pages link to On the Optimality of Some Set Algorithms (Q5659062):
Displaying 15 items.
- A probabilistic lower bound for checking disjointness of sets (Q794167) (← links)
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane (Q1007585) (← links)
- Lower bounds on probabilistic linear decision trees (Q1067786) (← links)
- A probabilistic distributed algorithm for set intersection and its analysis (Q1088406) (← links)
- Geometric complexity of some location problems (Q1099951) (← links)
- A lower bound for the edit-distance problem under an arbitrary cost function (Q1107330) (← links)
- A time-space tradeoff for sorting on non-oblivious machines (Q1152950) (← links)
- Stable set and multiset operations in optimal time and space (Q1182083) (← links)
- On the complexity of inferring functional dependencies (Q1202891) (← links)
- Finding modes with equality comparisons (Q1680532) (← links)
- Simulating probabilistic by deterministic algebraic computation trees (Q1821560) (← links)
- Decision trees: Old and new results. (Q1854291) (← links)
- Finding Mode Using Equality Comparisons (Q2803838) (← links)
- Checking similarity of planar figures (Q3219798) (← links)
- On genuinely time bounded computations (Q5096139) (← links)
