![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 991
Volume 991, 2024
- Xiaoyu Wu, Lili Mei
, Guochuan Zhang:
Two homogeneous facility location games with a minimum distance requirement on a circle. 114398 - Lusheng Wang, Boting Yang:
Edge searching and fast searching with constraints. 114416 - Michele Contente, Maria Emilia Maietti
:
The compatibility of the minimalist foundation with homotopy type theory. 114421 - Arnab Maiti, Palash Dey
:
Query complexity of tournament solutions. 114422 - Jiao Du
, Lin Li, Shaojing Fu, Longjiang Qu, Chao Li:
Constructions of 2-resilient rotation symmetric Boolean functions with odd number of variables. 114429 - Mathieu Hemery, François Fages
:
On a model of online analog computation in the cell with absolute functional robustness: Algebraic characterization, function compiler and error control. 114432 - Tianhang Lu, Han Xiao
, Qizhi Fang:
Approximate core allocations for edge cover games. 114433 - Arnaud Casteigts
, Timothée Corsini, Writika Sarkar:
Simple, strict, proper, happy: A study of reachability in temporal graphs. 114434 - Saswata Jana, Partha Sarathi Mandal
:
Approximation algorithms for drone delivery scheduling with a fixed number of drones. 114442 - Yizhao Zhu
, Lanxiang Chen
, Yi Mu:
Practical and malicious private set intersection with improved efficiency. 114443 - Ivan Bliznets, Anton Bukov, Danil Sagunov:
Fair division with minimal withheld information in social networks. 114446
![](https://dblp.org/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.