Online edition: ISSN 2432-6380
[TOP] | [2017] | [2018] | [2019] | [2020] | [2021] | [2022] | [2023] | [Japanese] / [English]
COMP2020-1
Another time-complexity analysis for the maximal clique enumeration algorithm CLIQUES
Etsuji Tomita (Univ. Electro-Comm.), Alessio Conte (Univ. of Pisa)
pp. 1 - 8
COMP2020-2
Gathering for mobile agents with a strong team in weakly Byzantine environments
Jion Hirose, Masashi Tsuchida (NAIST), Junya Nakamura (TUT), Fukuhito Ooshita, Michiko Inoue (NAIST)
pp. 9 - 16
COMP2020-3
On Memory, Communication, and Synchronous Schedulers for Autonomous Mobile Robots
Paola Flocchini (UoO), Nicola Santoro (CU), Koichi Wada (HU)
pp. 17 - 24
COMP2020-4
A Packet Classification Algorithm via Decision Diagram Based on Run-Based Trie with Pointers
Takashi Harada, Shogo Takeuchi (Kochi Univ. Tech.), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.)
pp. 25 - 32
COMP2020-5
On Power and limitation of adversarial example attacks
Kouichi Sakurai (Kyushu Univ.)
pp. 33 - 36
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.