The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\) (Q765490) (← links)
- A faster algorithm for the computation of string convolutions using LZ78 parsing (Q765493) (← links)
- \(\operatorname{Log}^{\prime}\) version vector: logging version vectors concisely in dynamic replication (Q765495) (← links)
- An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
- Cycles passing through a prescribed path in a hypercube with faulty edges (Q765497) (← links)
- An output sensitive algorithm for computing a maximum independent set of a circle graph (Q765500) (← links)
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
- Optimizing the region algebra is PSPACE-complete (Q765502) (← links)
- \textsc{Concise}: compressed `\(n\)' composable integer set (Q765505) (← links)
- A fan-type result on \(k\)-ordered graphs (Q765506) (← links)
- The longest almost-increasing subsequence (Q765507) (← links)
- Super connectivity of Kronecker products of graphs (Q765508) (← links)
- Upper signed \(k\)-domination in a general graph (Q765509) (← links)
- Refining abstract interpretations (Q765513) (← links)
- On exact solutions to the Euclidean bottleneck Steiner tree problem (Q765514) (← links)
- Optimal global alignment of signals by maximization of Pearson correlation (Q765515) (← links)
- A characterization of complete bipartite RAC graphs (Q765516) (← links)
- A visual word weighting scheme based on emerging itemsets for video annotation (Q765519) (← links)
- Normal Eulerian clique-covering and hamiltonicity (Q765520) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- Ranking numbers of graphs (Q765523) (← links)
- Armstrong axioms and Boyce-Codd-Heath normal form under bag semantics (Q765524) (← links)
- A note on robustness tolerances for combinatorial optimization problems (Q765526) (← links)
- Efficient indexing algorithms for one-dimensional discretely-scaled strings (Q765528) (← links)
- RAC drawings in subcubic area (Q783679) (← links)
- Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
- An Ore-type condition for the existence of two disjoint cycles (Q783683) (← links)
- Annotated regular expressions and input-driven languages (Q783684) (← links)
- Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture (Q783686) (← links)
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands (Q783689) (← links)
- Practical forgeries for ORANGE (Q783690) (← links)
- Sorting can exponentially speed up pure dynamic programming (Q783692) (← links)
- Remark on subcodes of linear complementary dual codes (Q783694) (← links)
- Maximum-area triangle in a convex polygon, revisited (Q783698) (← links)
- A characterization of König-Egerváry graphs with extendable vertex covers (Q783699) (← links)
- On cryptographic anonymity and unpredictability in secret sharing (Q783702) (← links)
- Randomized distributed online algorithms against adaptive offline adversaries (Q783703) (← links)
- An answer to an open problem of Mesnager on bent functions (Q783704) (← links)
- ``The simplest protocol for oblivious transfer'' revisited (Q783707) (← links)
- About blockchain interoperability (Q783709) (← links)
- Incremental distance products via faulty shortest paths (Q783710) (← links)
- Linear time distributed swap edge algorithms (Q783711) (← links)
- Where-oblivious is not sufficient (Q786531) (← links)
- A general program scheme for finding bridges (Q787676) (← links)
- Average time analyses of simplified Davis-Putnam procedures (Q787685) (← links)
- Folding of the plane and the design of systolic arrays (Q788490) (← links)
- A note on the complexity of a partition algorithm (Q788493) (← links)
- Strong equivalence of relational expressions under dependencies (Q788498) (← links)
- Some FP algebra with currying operation (Q789160) (← links)
