首页 | 本学科首页   官方微博 | 高级检索  
     


Covering and packing in linear space
Authors:Andreas Björklund  Thore Husfeldt  Petteri Kaski  Mikko Koivisto
Affiliation:1. Lund University, Department of Computer Science, P.O. Box 118, SE-22100 Lund, Sweden;2. IT University of Copenhagen, Rued Langgaards Vej 7, 2300, København S, Denmark;3. Helsinki Institute for Information Technology HIIT, Aalto University, Department of Information and Computer Science, P.O. Box 15400, FI-00076 Aalto, Finland;4. Helsinki Institute for Information Technology HIIT, University of Helsinki, Department of Computer Science, P.O. Box 68, FI-00014 University of Helsinki, Finland;1. Saarland University, 66123 Saarbrucken, Germany;2. École Centrale de Nantes, IRCCyN UMR CNRS 6597 (Institut de Recherche en Communications et Cybernétique de Nantes), Nantes, France;3. National Institute of Informatics, 2-1-2, Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan;4. Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8552, Japan;1. Computer Science Department, ENS Paris-Saclay, Cachan, 5 rue Blaise Pascal, 92220 Bagneux, France;2. Department of Computer Science, Bar Ilan University, 5290002 Ramat Gan, Israel;3. Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland;4. Department of Algebra and Fundamental Informatics, Ural Federal University, pr. Lenina 51, 620000 Ekaterinburg, Russia
Abstract:
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号