default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 191
Volume 191, 2026
- Sam Buss, Neil Thapen
:
A simple supercritical tradeoff between size and height in resolution. 106589 - Stefan Kiefer, Andrew Ryzhikov:
The complexity of computing the period and the exponent of a digraph. 106590 - Zihui Liu:
On some families of binary codes. 106591 - Manoj Gyawali:
Rank-2 module-LIP with special matrices. 106593 - Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba:
Finding the cyclic covers of a string. 106594 - Vladimir Edemskiy, Zeyu Cao:
Notes about the linear complexity of quaternary cyclotomic sequences of order four. 106595 - Xian Xu, Wenbo Zhang:
Logical characterization of branching bisimilarity over random processes. 106596 - Marcin Peczarski:
Note on pancake sorting. 106597 - Tianqi Chen, Zhiyi Tan:
Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan. 106598 - Bhawani Sankar Panda, Soumyashree Rana, Sounaka Mishra:
Corrigendum to "On the complexity of co-secure dominating set problem" [Inf. Process. Lett. 185 (2024) 106463]. 106592
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 2026-06-15 23:07 CEST 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:
