The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Oriented chromatic number of grids is greater than 7 (Q413252) (← links)
- Optimal online pricing with network externalities (Q413256) (← links)
- Group path covering and \(L(j,k)\)-labelings of diameter two graphs (Q413258) (← links)
- Optimal broadcasting for locally twisted cubes (Q413259) (← links)
- A note on disjoint cycles (Q413261) (← links)
- On edge colorings of 1-planar graphs without adjacent triangles (Q413262) (← links)
- On the average sensitivity of the weighted sum function (Q413263) (← links)
- Complexity of universal access structures (Q413265) (← links)
- Series-parallel orientations preserving the cycle-radius (Q413267) (← links)
- Visibility-preserving convexifications using single-vertex moves (Q413272) (← links)
- An analytic criterion for CSAT (Q413274) (← links)
- On an optimal randomized acceptor for graph nonisomorphism (Q413276) (← links)
- On the performance of the approximate parametrization algorithm for curves (Q413277) (← links)
- Speeding up CRC32C computations with intel CRC32 instruction (Q413278) (← links)
- Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules (Q413279) (← links)
- Multiplicative vertex-colouring weightings of graphs (Q413281) (← links)
- Probabilistic single obnoxious facility location with fixed budget (Q413284) (← links)
- Brooks' theorem for generalized dart graphs (Q413285) (← links)
- Möbius-deBruijn: the product of Möbius cube and deBruijn digraph (Q413291) (← links)
- A note on randomized streaming space bounds for the longest increasing subsequence problem (Q413292) (← links)
- Automorphism groups of the Pancake graphs (Q413293) (← links)
- Exponential lower bound for bounded depth circuits with few threshold gates (Q413295) (← links)
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- Colorful triangle counting and a \textsc{MapReduce} implementation (Q413300) (← links)
- An improved security-aware packet scheduling algorithm in real-time wireless networks (Q413304) (← links)
- Superiority of exact quantum automata for promise problems (Q413305) (← links)
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead (Q413308) (← links)
- Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs (Q413312) (← links)
- TrCBC: another look at CBC-MAC (Q413314) (← links)
- Randomized load balancing by joining and splitting bins (Q436309) (← links)
- Cores of random \(r\)-partite hypergraphs (Q436312) (← links)
- Model checking probabilistic systems against pushdown specifications (Q436316) (← links)
- Bicolored independent sets and bicliques (Q436317) (← links)
- Squeeziness: an information theoretic measure for avoiding fault masking (Q436319) (← links)
- Fast equality test for straight-line compressed strings (Q436321) (← links)
- Universal point sets for 2-coloured trees (Q436323) (← links)
- The tensor product of two good codes is not necessarily robustly testable (Q436324) (← links)
- Highly connected molecular graphs are rigid in three dimensions (Q436325) (← links)
- Improved approximation algorithms for the robust fault-tolerant facility location problem (Q436327) (← links)
- Optimal distortion embedding of complete binary trees into lines (Q436329) (← links)
- Finite satisfiability for guarded fixpoint logic (Q436331) (← links)
- On-line scheduling of equal-length intervals on parallel machines (Q436333) (← links)
- Hash challenges: stretching the limits of compare-by-hash in distributed data deduplication (Q436334) (← links)
- On the applicability of Post's lattice (Q436335) (← links)
- Proximity and average eccentricity of a graph (Q436337) (← links)
- Fault tolerance analysis of mesh networks with uniform versus nonuniform node failure probability (Q436341) (← links)
- On the super connectivity of Kronecker products of graphs (Q436343) (← links)
- On rainbow-\(k\)-connectivity of random graphs (Q436344) (← links)
- Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
- Drawing trees in a streaming model (Q436551) (← links)
