


default search action
Information Processing Letters, Volume 194
Volume 194, 2026
- Aleksandros Sobczyk

:
I/O complexity and pebble games with partial computations. 106637 - Janne Fuchser

, Nikolas Mählmann
, Sebastian Siebertz
:
A note on constructive canonical splitter strategies in nowhere dense graph classes. 106638 - Gianfranco Bilardi, Lorenzo De Stefani

:
A universal bound on the space complexity of directed acyclic graph computations. 106639 - Roberto Bruno, Roberto De Prisco, Ugo Vaccaro

:
Optimal average-case binary search with outcome-dependent costs. 106640 - Jeffrey O. Shallit

, Élise Vandomme:
Running maximum of a k-regular sequence. 106641 - Daniel Bertschinger, Henry Förster, Fabian Klute, Irene Parada

, Patrick Schnider, Birgit Vogtenhuber:
Bowties and hourglasses: Intersections of double-wedges or: Stabbing and avoiding line segments. 106642 - Abhishek Dhawan

:
A simple algorithm for near-Vizing edge-coloring in near-linear time. 106643 - John M. Hitchcock

:
Exponential-size circuit complexity is comeager in symmetric exponential time. 106644 - Ferucio-Laurentiu Tiplea:

Cocks homomorphic encryption without ciphertext expansion or re-randomization. 106645 - Édouard Bonnet

:
Coloring hardness on low twin-width graphs. 106646

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID













