Information and Systems-Theoretical Foundations of Computing(Date:2020/05/09)

Presentation
Another time-complexity analysis for the maximal clique enumeration algorithm CLIQUES

Etsuji Tomita(Univ. Electro-Comm.),  Alessio Conte(Univ. of Pisa),  

[Date]2020-05-09
[Paper #]COMP2020-1
On Power and limitation of adversarial example attacks

Kouichi Sakurai(Kyushu Univ.),  

[Date]2020-05-09
[Paper #]COMP2020-5
On Memory, Communication, and Synchronous Schedulers for Autonomous Mobile Robots

Paola Flocchini(UoO),  Nicola Santoro(CU),  Koichi Wada(HU),  

[Date]2020-05-09
[Paper #]COMP2020-3
A Packet Classification Algorithm via Decision Diagram Based on Run-Based Trie with Pointers

Takashi Harada(Kochi Univ. Tech.),  Shogo Takeuchi(Kochi Univ. Tech.),  Ken Tanaka(Kanagawa Univ.),  Kenji Mikawa(Niigata Univ.),  

[Date]2020-05-09
[Paper #]COMP2020-4
Gathering for mobile agents with a strong team in weakly Byzantine environments

Jion Hirose(NAIST),  Masashi Tsuchida(NAIST),  Junya Nakamura(TUT),  Fukuhito Ooshita(NAIST),  Michiko Inoue(NAIST),  

[Date]2020-05-09
[Paper #]COMP2020-2