


default search action
Theoretical Computer Science, Volume 885
Volume 885, September 2021
- Ran Ben Basat, Seungbum Jo, Srinivasa Rao Satti

, Shubham Ugare:
Approximate query processing over static sets and sliding windows. 1-14 - Alexandros Hollender

:
The classes PPA-k: Existence from arguments modulo k. 15-29 - Gaurav Sood

, K. Murali Krishnan
:
On the computational complexity of Data Flow Analysis over finite bounded meet semilattices. 30-40 - Zheng Zhang, Fangguo Zhang

:
Functional encryption for cubic polynomials and implementation. 41-54 - Alex Auvolat

, Davide Frey, Michel Raynal, François Taïani
:
Byzantine-tolerant causal broadcast. 55-68 - Ragnar Groot Koerkamp

, Stanislav Zivný:
On rainbow-free colourings of uniform hypergraphs. 69-76 - Yang Li

, Lloyd Allison
, Kevin B. Korb:
The difficulty of being moral. 77-90 - Shengfeng Xu, Xiangxue Li, Haifeng Qian, Kefei Chen:

CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN. 91-103 - B. S. Panda, Juhi Chaudhary

:
Dominating induced matching in some subclasses of bipartite graphs. 104-115 - Oren Friman, Gabriel Nivasch

:
Some i-Mark games. 116-124 - Willy Susilo

, Joseph Tonien
:
A Wiener-type attack on an RSA-like cryptosystem constructed from cubic Pell equations. 125-130 - Alamgir Rahaman Basunia, Satyabrata Das, Laxman Saha, Kalishankar Tiwary:

Antipodal number of full m-ary trees. 131-145 - Qian Liu

, Jianxin Liu, Min Li, Yang Zhou
:
Approximation algorithms for fuzzy C-means problem based on seeding method. 146-158

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














