A general technique for searching in implicit sets via function inversion

Cites work

A general technique for searching in implicit sets via function inversion
A strong and easily computable separation bound for arithmetic expressions involving radicals
An Expander-Based Approach to Geometric Optimization
An Optimal-Time Algorithm for Slope Selection
Conditional lower bounds for space/time tradeoffs
Constructing suffix arrays in linear time
Data Structures Lower Bounds and Popular Conjectures
Data structures meet cryptography: 3SUM with preprocessing
Gapped string indexing in subquadratic space and sublinear query time
Improved algebraic degeneracy testing
Log-logarithmic worst-case range queries are possible in space theta(N)
Near-optimal linear decision trees for \(k\)-SUM and related problems
On a class of O(n^2) problems in computational geometry
On the sorting-complexity of suffix tree construction
Optimal slope selection via cuttings
Optimal slope selection via expanders
Randomized optimal algorithm for slope selection
Revisiting time-space tradeoffs for function inversion
Rigorous Time/Space Trade-offs for Inverting Functions
Selecting distances in arrangements of hyperplanes spanned by points.
Selecting distances in the plane
Some techniques for geometric searching with implicit set representations
Space efficient linear time construction of suffix arrays
Subquadratic algorithms for algebraic 3SUM
Suffix Arrays: A New Method for On-Line String Searches
The function-inversion problem: barriers and opportunities
The non-uniform perebor conjecture for time-bounded Kolmogorov complexity is false
Threesomes, degenerates, and love triangles
Time and space efficient collinearity indexing
Time space tradeoffs for attacks against one-way functions and PRGs

This page was built for publication: A general technique for searching in implicit sets via function inversion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7239685)