Nagy-György Judit:
Randomized algorithm for the k-server problem on decomposable spaces.
JOURNAL OF DISCRETE ALGORITHMS, 7 (4).
pp. 411-419.
ISSN 1570-8667
(2009)
Preview |
Text
ext_09.pdf - Accepted Version Download (326kB) | Preview |
![[thumbnail of decomp.pdf]](http://publicatio.bibl.u-szeged.hu/style/images/fileicons/text.png) |
Text
decomp.pdf - Published Version Restricted access: Logged in users only Download (200kB) | Request a copy |
| Creators: |
|
|
|---|---|---|
| Item Type: | Journal Article | |
| Journal or Publication Title: | JOURNAL OF DISCRETE ALGORITHMS | |
| Date: | 2009 | |
| Volume: | 7 | |
| Number: | 4 | |
| Page Range: | pp. 411-419 | |
| ISSN: | 1570-8667 | |
| Faculty/Unit: | Faculty of Science and Informatics | |
| Institution: | University of Szeged (2000-) | |
| Language: | English | |
| MTMT rekordazonosító: | 1930872 | |
| DOI azonosító: | https://doi.org/10.1016/j.jda.2009.02.005 | |
| Date Deposited: | 2016. Oct. 18. 10:17 | |
| Last Modified: | 2019. Apr. 03. 14:40 | |
| URI: | http://publicatio.bibl.u-szeged.hu/id/eprint/8097 |
| Web of Science® Times Cited: 1 | View citing articles in Web of Science® |
Actions (login required)
 |
View Item |
Download Statistics
Download Statistics
