default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 997
Volume 997, 2024
- Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
:
Parameterized complexity of broadcasting in graphs. 114508 - Martín Ríos-Wilson, Guillaume Theyssier:
Intrinsic universality in automata networks I: Families and simulations. 114511 - Pamela E. Harris, Erik Insko, Florian Lehner:
Tipsy cop and tipsy robber: Collisions of biased random walks on graphs. 114512 - Tatsuya Matsuoka, Naoto Ohsaka:
Computational complexity of normalizing constants for the product of determinantal point processes. 114513 - Xiaoliang Wu, Qilong Feng, Jinhui Xu, Jian-xin Wang:
New algorithms for fair k-center problem with outliers and capacity constraints. 114515 - Keisuke Hara:
A logarithmic-sized accountable ring signature scheme in the standard model. 114516
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.
last updated on 2025-03-22 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
