Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
856
search results - page 172 / 172
»
A New Approach to Modular Database Systems
Sort
relevance
views
votes
recent
update
View
thumb
title
119
click to vote
COCO
2003
Springer
118
views
Algorithms
»
more
COCO 2003
»
Lower bounds for predecessor searching in the cell probe model
15 years 8 months ago
Download
webhome.cs.uvic.ca
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
claim paper
Read More »
« Prev
« First
page 172 / 172
Last »
Next »