default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 183
Volume 183, January 2024
- Lluís Alemany-Puig
, Juan Luis Esteban, Ramon Ferrer-i-Cancho:
The maximum linear arrangement problem for trees under projectivity and planarity. 106400 - Jean Liénardy, Frédéric Lafitte:
A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality. 106404 - Majid Mirzanezhad:
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions. 106405 - Je Hong Park, Woo-Hwan Kim:
Security weakness of a certificate-based proxy signature scheme for IIoT environments. 106406 - Bhisham Dev Verma, Rameshwar Pratap, Manoj Thakur:
Unbiased estimation of inner product via higher order count sketch. 106407 - Maximilien Mackie:
Recursion-free modular arithmetic in the lambda-calculus. 106408 - Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah:
Linear threshold functions in decision lists, decision trees, and depth-2 circuits. 106418 - Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza:
Recognizing well-dominated graphs is coNP-complete. 106419 - Júlio Araújo, Victor A. Campos, Darlan Girão, João Nogueira, António Salgueiro, Ana Silva:
On the hull number on cycle convexity of graphs. 106420 - Nidia Obscura Acosta, Alexandru I. Tomescu:
Simplicity in Eulerian circuits: Uniqueness and safety. 106421 - Chik How Tan, Theo Fanuela Prabowo:
A new key recovery attack on a code-based signature from the Lyubashevsky framework. 106422 - Dar-Li Yang, Yung-Tsung Hou, Wen-Hung Kuo:
A short note on "A note on single-machine scheduling with job-dependent learning effects". 106423 - Takuto Mitsunobu, Reiji Suda, Vorapong Suppakitpaisarn:
Worst-case analysis of LPT scheduling on a small number of non-identical processors. 106424 - Shanshan Wang, Chenglong Xiao, Emmanuel Casseau:
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality. 106425 - André Nies, Frank Stephan:
Word automatic groups of nilpotency class 2. 106426 - Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf:
Learning from positive and negative examples: New proof for binary alphabets. 106427 - Florian Hörsch, Zoltán Szigeti:
Steiner connectivity problems in hypergraphs. 106428 - Pasin Manurangsi:
A note on hardness of computing recursive teaching dimension. 106429 - Arka Ray:
There is no APTAS for 2-dimensional vector bin packing: Revisited. 106430 - Balder ten Cate, Maurice Funk, Jean Christoph Jung, Carsten Lutz:
On the non-efficient PAC learnability of conjunctive queries. 106431 - Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi, Yu Yokoi:
Fast primal-dual update against local weight update in linear assignment problem and its application. 106432
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-12-13 19:00 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:
