Downloads: 188

Files in This Item:
File Description SizeFormat 
978-3-642-45030-3_21.pdf125.62 kBAdobe PDFView/Open
Title: Better Bounds for Online k-Frame Throughput Maximization in Network Switches
Authors: Kawahara, Jun  kyouindb  KAKEN_id  orcid https://orcid.org/0000-0001-7208-044X (unconfirmed)
Kobayashi, Koji M.
Miyazaki, Shuichi  KAKEN_id  orcid https://orcid.org/0000-0003-0369-1970 (unconfirmed)
Author's alias: 川原, 純
小林, 浩二
宮崎, 修一
Issue Date: 2013
Publisher: Springer Berlin Heidelberg
Journal title: Lecture Notes in Computer Science
Volume: 8283
Start page: 218
End page: 228
Description: 'Algorithms and Computation' 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings
Rights: The final publication is available at Springer via https://doi.org/10.1007/978-3-642-45030-3_21
この論文は出版社版でありません。引用の際には出版社版をご確認ご利用ください。
This is not the published version. Please cite only the published version.
URI: http://hdl.handle.net/2433/226954
DOI(Published Version): 10.1007/978-3-642-45030-3_21
Appears in Collections:Journal Articles

Show full item record

Export to RefWorks


Export Format: 


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.