default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 992
Volume 992, 2024
- Justin Dallant
, John Iacono:
How fast can we play Tetris greedily with rectangular pieces? 114405 - Meirun Chen, Cheng-Kuan Lin, Kung-Jui Pai:
A tree structure for local diagnosis in multiprocessor systems under the comparison model. 114444 - Hailun Wu, Lina Ba, Heping Zhang:
Integer k-matching preclusion of some interconnection networks. 114449 - Victor Mitrana, Andrei Paun, Mihaela Paun, José-Ramón Sánchez-Couso:
Jump complexity of finite automata with translucent letters. 114450 - Kusum, Arti Pandey:
Some new algorithmic results on co-secure domination in graphs. 114451 - Minati De, Satyam Singh:
Online hitting of unit balls and hypercubes in Rd using points from Zd. 114452 - Zhaoman Liu, Yanbo Chen, Jianting Ning, Yunlei Zhao:
Fully anonymous identity-based broadcast signcryption with public verification. 114464 - Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso, Riccardo Guidotti:
Quantum clustering with k-Means: A hybrid approach. 114466
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 2024-11-05 21:03 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:
