logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
BackJournal Details
I

Information Processing Letters

IF0.6
Papers17
Citations3437
Journal Papers 17
Publication Date
delete
Exponential-size circuit complexity is comeager in symmetric exponential time
deleteInformation Processing Letters
IF0.6
delete2026-08-01
delete0
PREAI
deleteHitchcock, John M.
deleteShare
deleteSave
Bowties and hourglasses: Intersections of double-wedges or: Stabbing and avoiding line segments
deleteInformation Processing Letters
IF0.6
delete2026-08-01
delete0
deleteOAAI
deleteBertschinger, Daniel; Forster, Henry; Klute, Fabian; Parada, Irene; Schnider, Patrick; Vogtenhuber, Birgit
deleteShare
deleteSave
A simple algorithm for near-Vizing edge-coloring in near-linear time
deleteInformation Processing Letters
IF0.6
delete2026-08-01
delete0
deleteOAAI
deleteDhawan, Abhishek
deleteShare
deleteSave
Output bounds for conjunctions of path queries
deleteInformation Processing Letters
IF0.6
delete2026-04-01
delete0
PREAI
deleteCucumides, Tamara; Reutter, Juan; Vrgoc, Domagoj
deleteShare
deleteSave
I/O complexity and pebble games with partial computations
deleteInformation Processing Letters
IF0.6
delete2026-04-01
delete0
PREAI
deleteSobczyk, Aleksandros
deleteShare
deleteSave
The complexity of HyperQPTL
deleteInformation Processing Letters
IF0.6
delete2026-04-01
delete0
PREAI
deleteRegaud, Gaetan; Zimmermann, Martin
deleteShare
deleteSave
LR parsing for strings with placeholders
deleteInformation Processing Letters
IF0.6
delete2026-04-01
delete0
PREAI
deleteNakamichi, Kohei; Morihata, Akimasa; Nakamaru, Tomoki
deleteShare
deleteSave
Faster and simpler online computation of string net frequency
deleteInformation Processing Letters
IF0.6
delete2026-01-01
delete0
PREAI
deleteInenaga, Shunsuke
deleteShare
deleteSave
A linear-time algorithm for the two-color one-dimensional buttons & scissors
deleteInformation Processing Letters
IF0.6
delete2026-01-01
delete0
PREAI
deleteHayata, Suguru; Ito, Hiro
deleteShare
deleteSave
The k-center problem of uncertain points on graphs
deleteInformation Processing Letters
IF0.6
delete2026-01-01
delete0
PREAI
deleteXu, Haitao; Zhang, Jingru
deleteShare
deleteSave
Universal approximation theorem for neural networks with inputs from a topological vector space
deleteInformation Processing Letters
IF0.6
delete2026-01-01
delete1
PREAI
deleteIsmailov, Vugar E.
deleteShare
deleteSave
EvenPath in directed single-crossing graphs
deleteINFORMATION PROCESSING LETTERS
IF0.6
delete2025-12-01
delete0
PREAI
deleteChauhan, Archit; Gupta, Chetan; Sharma, Vimal Raj
deleteShare
deleteSave
Reachability in graphs having linear 2-arboricity two is NL-hard
deleteINFORMATION PROCESSING LETTERS
IF0.6
delete2025-10-01
delete0
deleteOAAI
deleteBhadra, Ronak; Tewari, Raghunath
deleteShare
deleteSave
The harmonious coloring game
deleteINFORMATION PROCESSING LETTERS
IF0.6
delete2025-09-01
delete0
deleteOAAI
deleteSales, Claudia Linhares; Marcilon, Thiago; Martins, Nicolas; Nisse, Nicolas; Sampaio, Rudini
deleteShare
deleteSave
On the complexity of co-secure dominating set problem (vol 185, 106463, 2024)
deleteINFORMATION PROCESSING LETTERS
IF0.6
delete2025-09-01
delete0
PREAI
deletePanda, Bhawani Sankar; Rana, Soumyashree; Mishra, Sounaka
deleteShare
deleteSave
Adaptive general perfectly periodic scheduling
deleteINFORMATION PROCESSING LETTERS
IF0.6
delete2006-05-01
delete9
PREAI
deletePatil, S; Garg, VK
deleteShare
deleteSave
Finding optimal paths in MREP routing
deleteINFORMATION PROCESSING LETTERS
IF0.6
delete2004-01-01
delete0
deleteOAAI
deleteFleischer, R; Golin, M; Lea, CT; Wong, S
deleteShare
deleteSave