Information Processing Letters

Article	Citations
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method	23
Editorial Board	13
Polynomial invariants for cactuses	12
A note on the satisfactory partition problem: Constant size requirement	12
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm	9
Density of distinct squares in non-primitive words	8
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees	7
Geometric separability using orthogonal objects	7
Embedded edge connectivity of k-ary n-cubes	7
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions	7
A note on the method of equal shares	7
Recognizing well-dominated graphs is coNP-complete	6
Faster deterministic algorithm for Cactus Vertex Deletion	6
The longest common subsequence problem for small alphabets in the word RAM model	6
Metric distortion of obnoxious distributed voting	5
Tight inapproximability of Nash equilibria in public goods games	5
Heavy and light paths and Hamilton cycles	4
Editorial Board	4
Recursion-free modular arithmetic in the lambda-calculus	4
Editorial Board	4
A short note on “A note on single-machine scheduling with job-dependent learning effects”	4
Editorial Board	4
Notes about the linear complexity of quaternary cyclotomic sequences of order four	4
Bounds and algorithms for generalized superimposed codes	4
Online delay management on a single train line with predictions	4

Exact PPS sampling with bounded sample size	4
Logical characterization of branching bisimilarity over random processes	4
Long directed detours: Reduction to 2-Disjoint Paths	3
Analyzing Residual Random Greedy for monotone submodular maximization	3
The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs	3
A constant-time sampling algorithm for binary Gaussian distribution over the integers	3
Long paths in heterogeneous random subgraphs of graphs with large minimum degree	3
String searching with mismatches using AVX2 and AVX-512 instructions	3
The group factorization problem in finite groups of Lie type	3
On public-coin zero-error randomized communication complexity	3
Strong edge-colorings of sparse graphs with 3Δ − 1 colors	3
Instability results for cosine-dissimilarity-based nearest neighbor search on high dimensional Gaussian data	3
On Voronoi visibility maps of 1.5D terrains with multiple viewpoints	3
Smoothness of Schatten norms and sliding-window matrix streams	3
Simplicity in Eulerian circuits: Uniqueness and safety	3
On-line exploration of rectangular cellular environments with a rectangular hole	3
On conflict-free cuts: Algorithms and complexity	3
On size-independent sample complexity of ReLU networks	3
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher	3
Luby's MIS algorithms made self-stabilizing	3
A new class of generalized almost perfect nonlinear monomial functions	3
Order-preserving pattern matching with scaling	3
Inapproximability of counting independent sets in linear hypergraphs	3
A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees	3
A real polynomial for bipartite graph minimum weight perfect matchings	3
Weighted fair division of indivisible items: A review	3
A 22k-approximation	3
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine	3
Public-key encryption scheme with optimal continuous leakage resilience	3
Thou shalt covet the average of thy neighbors' cakes	3
The complexity of HyperQPTL	3
On some decidability questions concerning supports of rational series	2
Friends-and-strangers is PSPACE-complete	2
Editorial Board	2
Tight FPT Approximation for Socially Fair Clustering	2
A refined approximation for Euclidean k-means	2
A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality	2
Computing the k densest subgraphs of a graph	2
Static type checking without downcast operator	2
Comparing approximate and probabilistic differential privacy parameters	2
Corrigendum to “On the complexity of co-secure dominating set problem” [Inf. Process. Lett. 185 (2024) 106463]	2
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance	2
Synchronizing words under LTL constraints	2
Relating planar graph drawings to planar satisfiability problems	2
Security weakness of a certificate-based proxy signature scheme for IIoT environments	2
Packing batches of cubes into a single bin	2
An algorithm for reconstructing level-2 phylogenetic networks from trinets	2
Improved kernels for tracking paths	2
LR parsing for strings with placeholders	2
Algorithmic results in Roman dominating functions on graphs	2

Anti Tai mapping for unordered labeled trees	2
Finding partite hypergraphs efficiently	2
On some families of binary codes	2
Determining rate monotonic schedulability of real-time periodic tasks using continued fractions	2
On optimization problems in acyclic hypergraphs	2
Bowties and Hourglasses: Intersections of Double-Wedges Or: Stabbing and Avoiding Line Segments	2
The facility location problem with maximum distance constraint	2
On the parameterized complexity of the Maximum Exposure Problem	2
A nearly tight lower bound for the d-dimensional cow-path problem	2
The loss of serving in the dark	2
Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks	2
Efficient linear-time ranking and unranking of derangements	2
A note on matching-cut in P-free graphs	2
On regularity of Max-CSPs and Min-CSPs	2
An improved uniform convergence bound with fat-shattering dimension	2
Worst-case analysis of LPT scheduling on a small number of non-identical processors	1
On product decomposition	1
Robust probabilistic temporal logics	1
The effect of iterativity on adversarial opinion forming	1
Faster algorithms and a smaller kernel for Cliques or Trees Vertex Deletion	1
Spectral independence, coupling, and the spectral gap of the Glauber dynamics	1
Improved hardness of approximation for Geometric Bin Packing	1
Comment on “An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)”	1
On the security of TrCBC	1
Simplified Chernoff bounds with powers-of-two probabilities	1
Smaller kernels for two vertex deletion problems	1
Monochromatic partitioning of colored points by lines	1
There is no APTAS for 2-dimensional vector bin packing: Revisited	1
A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities	1
On the preferred extensions of argumentation frameworks: Bijections with naive sets	1
Editorial Board	1
New results on pairwise compatibility graphs	1
Efficient Implementations of Square-root Vélu's Formulas	1
Online search for a hyperplane in high-dimensional Euclidean space	1
Effective data reduction for strongly stable matching in very sparse graphs	1
Discrete and mixed two-center problems for line segments	1
The harmonious coloring game	1
Steiner connectivity problems in hypergraphs	1
Insertion depth in power-weight trees	1
Lower bound proof for the size of BDDs representing a shifted addition	1
Revisiting lower dimension lattice attacks on NTRU	1
Fair and truthful allocations under leveled valuations	1
Escaping Braess's paradox through approximate Caratheodory's theorem	1
A note on the complexity of one-sided crossing minimization of trees	1
Reachability in graphs having linear 2-arboricity two is 1
New sharp lower bound for the quorum coloring number of trees	1
Approximating the minimal lookahead needed to win infinite games	1
A simple supercritical tradeoff between size and height in resolution	1
Editorial Board	1
Special issue on Economics and Computation	1
An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets	1
Learning from positive and negative examples: New proof for binary alphabets	1
Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan	1
A class of cubic polynomial semi-bent functions over	1
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times	1
Reducing the space used by the sieve of Eratosthenes when factoring	1
On radio k-labeling of the power of the infinite path	1
On approximate reconfigurability of label cover	1
On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times	1
On the k-means/median cost function	1
Spanners under the Hausdorff and Fréchet distances	1
Branching bisimulation semantics for quantum processes	1
Hamiltonian cycles of balanced hypercube with disjoint faulty edges	0
A lower bound for the Quickhull convex hull algorithm that disproves the Quickhull precision conjecture	0
A generalization of the Blind Rotating Table game	0
Maximal elements with minimal logic	0
Globally minimal defensive alliances	0
Generalized cuckoo hashing with a stash, revisited	0
Deterministic treasure hunt and rendezvous in arbitrary connected graphs	0
All-pairs suffix/prefix in optimal time using Aho-Corasick space	0
The complexity of comparing optimal solutions	0
Editorial Board	0
The complexity of computing the period and the exponent of a digraph	0
Corrigendum to “Mutual exclusion in fully anonymous shared memory systems” [Inf. Process. Lett. 158 (2020) 105938]	0
Ranking and unranking bordered and unbordered words	0
On the hardness of inclusion-wise minimal separators enumeration	0
A note on the class of languages generated by F-systems over regular languages	0
Skolem and positivity completeness of ergodic Markov chains	0
A simple division-free algorithm for computing Pfaffians	0
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints	0

Improved bounds for rectangular monotone Min-Plus Product and applications	0
Distributivity and residuation for lexicographic orders	0
Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes	0
Total variation distance for product distributions is	0
Quantitative controller synthesis for consumption Markov decision processes	0
On parallel time in population protocols	0
An undecidability result for Separation Logic with theory reasoning	0
An information theoretic proof of the Chernoff-Hoeffding inequality	0
Faster and simpler online computation of string net frequency	0
Editorial Board	0
A new key recovery attack on a code-based signature from the Lyubashevsky framework	0
Note on pancake sorting	0
The computational complexity of some explainable clustering problems	0
Editorial Board	0
Polynomial kernels for tracking shortest paths	0
A note on VNP-completeness and border complexity	0
Counter abstraction for regular open teams	0
Editorial Board	0
Guided blocks WOM codes	0
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality	0
New bounds for the number of lightest cycles in undirected graphs	0
On clustering with discounts	0
FPT approximation and subexponential algorithms for covering few or many edges	0
Cryptanalysis of multivariate threshold ring signature schemes	0
Strong hardness of approximation for tree transversals	0
Dispersion problem on a convex polygon	0
Mesosome avoidance	0
Approximation error of single hidden layer neural networks with fixed weights	0
A note on approximations of directed edge dominating set	0
Covering segments on a line with drones	0
A linear-time algorithm for the two-color one-dimensional buttons & scissors	0
Vertex-connectivity for node failure identification in Boolean Network Tomography	0
A polynomial algorithm for deciding the validity of an electrical distribution tree	0
The Steiner path aggregation problem	0
On reversing arcs to improve arc-connectivity	0
Fast primal-dual update against local weight update in linear assignment problem and its application	0
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard	0
Modifying an instance of the super-stable matching problem	0
Editorial Board	0
Prenex universal first-order safety properties	0
Editorial Board	0
On the complexity of some restricted variants of Quotient Pigeon and a weak variant of Kőnig	0
The maximum linear arrangement problem for trees under projectivity and planarity	0
Rank-2 module-LIP with special matrices	0
A note on improved results for one round distributed clique listing	0
The autocorrelation of a class of quaternary sequences of length pq with high complexity	0
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes	0
Editorial Board	0
Faster deterministic algorithm for Co-Path Set	0
An improved kernel for the flip distance problem on simple convex polygons	0
Geometric systems of unbiased representatives	0
Universal approximation theorem for neural networks with inputs from a topological vector space	0
Determining asynchronous test equivalence for probabilistic processes	0
On the “majority is least stable” conjecture	0
Improving compressed matrix multiplication using control variate method	0
Splitting NP-complete sets infinitely	0
A note on algebraic techniques for subgraph detection	0
Satisfying the restricted isometry property with the optimal number of rows and slightly less randomness	0
Word automatic groups of nilpotency class 2	0
Airports and railways with unsplittable demand	0
Editorial Board	0
Lower and upper bounds on graph communicabilities	0
Semantic flowers for good-for-games and deterministic automata	0
Optimal approximations made easy	0
Approximation algorithms for a virtual machine allocation problem with finite types	0
On the non-efficient PAC learnability of conjunctive queries	0
EvenPath in directed single-crossing graphs	0
Algorithms for subgraph complementation to some classes of graphs	0
Recognizing LBFS trees of bipartite graphs	0
Is this network proper forest-based?	0
Editorial Board	0
On maximum bipartite matching with separation	0
On the Tractability Landscape of the Conditional Minisum Approval Voting Rule	0
On semi-transitive orientability of split graphs	0
On the hull number on cycle convexity of graphs	0
Regular resolution effectively simulates resolution	0
Connected equitable cake division via Sperner's lemma	0
Output bounds for conjunctions of path queries	0
Space-efficient Huffman codes revisited	0
Further results on the second relative greedy weight of 3-dimensional codes	0
Weakest preconditioned goto axiom	0
Polynomial recognition of vulnerable multi-commodities	0
Unbiased estimation of inner product via higher order count sketch	0
Editorial Board	0
An improved spectral lower bound of treewidth	0
Red Blue Set Cover problem on axis-parallel hyperplanes and other objects	0
A sharper lower bound on Rankin's constant	0
Practical committing attacks against Rocca-S	0
Checking in polynomial time whether or not a regular tree language is deterministic top-down	0
Deciding origin equivalence of weakly self-nesting macro tree transducers	0
The upper and lower bounds of R-conditional diagnosability of networks	0
Linear threshold functions in decision lists, decision trees, and depth-2 circuits	0
Finding the cyclic covers of a string	0
Improved lower bound for differentially private facility location	0
4/3 rectangle tiling lower bound	0