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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
826
search results - page 166 / 166
»
The Modernization of a Call Center
Sort
relevance
views
votes
recent
update
View
thumb
title
34
click to vote
STOC
2012
ACM
217
views
Algorithms
»
more
STOC 2012
»
Tight lower bounds for the online labeling problem
11 years 10 months ago
Download
www.cz.math.cas.cz
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
claim paper
Read More »
« Prev
« First
page 166 / 166
Last »
Next »