The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Bounds on locating total domination number of the Cartesian product of cycles and paths (Q495677) (← links)
- On security against the server in designated tester public key encryption with keyword search (Q495680) (← links)
- Planar lower envelope of monotone polygonal chains (Q495682) (← links)
- Google Scholar makes it hard -- the complexity of organizing one's publications (Q495683) (← links)
- A note on unbounded parallel-batch scheduling (Q495685) (← links)
- A new binary code of length 16 and minimum distance 3 (Q495687) (← links)
- The equitable vertex arboricity of complete tripartite graphs (Q495689) (← links)
- Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection (Q503599) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- A characterization of trees with equal independent domination and secure domination numbers (Q503603) (← links)
- A revised result on chasing tree patterns under schema graphs (Q503606) (← links)
- Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques (Q503609) (← links)
- On the two largest distance eigenvalues of graph powers (Q503610) (← links)
- On representing a simple polygon perceivable to a blind person (Q506157) (← links)
- Notes on a hierarchical scheduling problem on identical machines (Q506158) (← links)
- Approximation schemes for the parametric knapsack problem (Q506160) (← links)
- Monotone drawings of graphs with few directions (Q506161) (← links)
- Application of distributed semi-quantum computing model in phase estimation (Q506164) (← links)
- Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons (Q506166) (← links)
- Improved and simplified inapproximability for \(k\)-means (Q506167) (← links)
- Angle-constrained spanners with angle at least \(\pi/3\) (Q506169) (← links)
- A note on non-splitting \(\mathbb Z\)-bent functions (Q509876) (← links)
- Morpion solitaire 5D: a new upper bound of 121 on the maximum score (Q509879) (← links)
- Learning network structures from contagion (Q509882) (← links)
- Did the train reach its destination: the complexity of finding a witness (Q509884) (← links)
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) (Q509886) (← links)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- A note on path embedding in crossed cubes with faulty vertices (Q509890) (← links)
- On the parameterized complexity of the edge monitoring problem (Q509893) (← links)
- Integer codes correcting single errors and burst asymmetric errors within a byte (Q509896) (← links)
- New results on the coarseness of bicolored point sets (Q522958) (← links)
- Finite-state concurrent programs can be expressed succinctly in triple normal form (Q522959) (← links)
- Parametric runtime verification is NP-complete and coNP-complete (Q522961) (← links)
- On approximate pattern matching with thresholds (Q522963) (← links)
- Top-\(k\) Manhattan spatial skyline queries (Q522965) (← links)
- A cubic-time algorithm for computing the trinet distance between level-1 networks (Q522967) (← links)
- Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms (Q522969) (← links)
- Composing ordered sequential consistency (Q522973) (← links)
- Faster string matching based on hashing and bit-parallelism (Q522976) (← links)
- Prespecification in data refinement (Q578901) (← links)
- A linear algorithm for the cutting center of a tree (Q578919) (← links)
- On the complexity of some extended word problems defined by cancellation rules (Q578921) (← links)
- L-attributed LL(1)-grammars are LR-attributed (Q578922) (← links)
- Efficient computation of the locally least-cost insertion string for the LR error repair (Q578925) (← links)
- Some characterizations of finitely specifiable implicational dependency families (Q578937) (← links)
- The inaccessible set: A classification by query type of security risks in statistical databases (Q578944) (← links)
- Predicative specifications for functional programs describing communicating networks (Q579917) (← links)
- Sorting numbers using limited systolic coprocessors (Q579941) (← links)
- Towards an asymptotic analysis of Karmarkar's algorithm (Q580169) (← links)
- Turing complexity of the ordinals (Q580332) (← links)
