Number of the records: 1
Tight lower bounds for the online labeling problem
- 1.0386313 - MÚ 2013 RIV US eng C - Conference Paper (international conference)
Bulánek, Jan - Koucký, Michal - Saks, M.
Tight lower bounds for the online labeling problem.
Proceedings of the 44th Symposium on Theory of Computing, STOC'2012. New York: ACM, 2012 - (Karloff, H.; Pitassi, T.), s. 1185-1198. ISBN 978-1-4503-1245-5.
[STOC'12 Symposium on Theory of Computing Conference /44./. New York (US), 19.05.2012-22.05.2012]
R&D Projects: GA ČR GAP202/10/0854
Institutional support: RVO:67985840
Keywords : online labeling * file maintenance problem * lower bounds
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?id=2213977.2214083&coll=DL&dl=GUIDE&CFID=245194486&CFTOKEN=14126751
Permanent Link: http://hdl.handle.net/11104/0219391File Download Size Commentary Version Access Koucky2.pdf 10 315.4 KB Author’s postprint require
Number of the records: 1