Pages that link to "Item:Q2889732"
From MaRDI portal
The following pages link to Average complexity of searching for identical objects in random nonuniform databases (Q2889732):
Displaying 5 items.
- The algorithm for identical object searching with bounded worst-case complexity and linear memory (Q341823) (← links)
- Information storage and search complexity theory (Q2453382) (← links)
- VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM (Q3509799) (← links)
- Average-Case Lower Bounds for Searching (Q3813304) (← links)
- A constant, in the worst case, algorithm to search for identical objects (Q4522853) (← links)