Many problems in interprocedural program analysis can be modeled as the context-free language (CFL) reachability problem on graphs and solved cubic time. Despite years of efforts, there are no known truly sub-cubic algorithms for this problem. We study related certification task: given an instance CFL reachability, small efficiently checkable certificates existence non-existence a path? show th...

Letter to the Editor

This study aims to explore the application of sharia contracts used by Islamic fintech peer-to-peer (P2P) lending in Indonesia. uses a literature and content analysis observing firms’ websites, providing P2P Eight firms registered with OJK per October 2021 that disclose information regarding are analysed. finds all Indonesia applies con-tracts according Fatwa DSN-MUI No. 117/DSN-MUI/II/2018, in...

With this construction we show that MD5 collisions can be crafted easily in such a way that the principles underlying the trust in Public Key Infrastructure are violated. In particular we find it worrying that from one certificate alone it cannot be determined whether another, different certificate may exist with the same signature. For the second certificate the issuing Certification Authority...

An isomorphism certificate of a labeled tournament T is a labeled subdigraph of T which together with an unlabeled copy of T allows the errorless reconstruction of T . It is shown that any tournament on n vertices contains an isomorphism certificate with at most n log2 n edges. This answers a question of Fishburn, Kim and Tetali. A score certificate of T is a labeled subdigraph of T which toget...