![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Information and Computation, Volume 297
Volume 297, 2024
- Ilaria Chillotti, Emmanuela Orsini
, Peter Scholl, Barry Van Leeuwen:
Scooby: Improved multi-party homomorphic secret sharing based on FHE. 105133 - Wenjie Bai
, Jeremiah Blocki, Mohammad Hassan Ameri:
Cost-asymmetric memory hard password hashing. 105134 - George Barmpalias
, Xiaoyan Zhang:
Growth and irreducibility in path-incompressible trees. 105136 - Neil Lutz, Donald M. Stull:
Projection theorems using effective dimension. 105137 - Stian Lybech
:
The reflective higher-order calculus: Encodability, typability and separation. 105138 - Alen Arslanagic, Jorge A. Pérez, Anda-Amelia Palamariuc:
Minimal session types for the π-calculus. 105148 - Fengrong Zhang
, Enes Pasalic, Amar Bapic
, Baocang Wang:
Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class. 105149 - Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin
, Yao Xu, An Zhang:
Approximating the directed path partition problem. 105150 - Massimo Benerecetti, Daniele Dell'Erba
, Fabio Mogavero
:
Solving mean-payoff games via quasi dominions. 105151 - Jinjie Gao
, Haibin Kan
, Yuan Li
, Jiahua Xu, Qichun Wang:
Monomial Boolean functions with large high-order nonlinearities. 105152 - Hideo Bannai, Juha Kärkkäinen, Dominik Köppl
, Marcin Piatkowski:
Constructing and indexing the bijective and extended Burrows-Wheeler transform. 105153
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.