The following pages link to Mathematics Subject Classification ID (P226):
Displaying 50 items.
- A high-order compact limiter based on spatially weighted projections for the spectral volume and the spectral differences method (Q293127) (← links)
- K-M-P string matching revisited (Q293129) (← links)
- Constructing simply recursive programs from a finite set of good examples (Q293131) (← links)
- On methods for safe introduction of operations (Q293132) (← links)
- An observation on associative one-way functions in complexity theory (Q293135) (← links)
- Checker for data structures which sort elements (Q293137) (← links)
- Improved performance of the greedy algorithm for partial cover (Q293139) (← links)
- A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems (Q293142) (← links)
- A technique for adding range restrictions to generalized searching problems (Q293144) (← links)
- An efficient finite-state machine implementation of Huffman decoders (Q293146) (← links)
- Primitive morphisms (Q293147) (← links)
- A remark on matrix rigidity (Q293150) (← links)
- Sparse dominance queries for many points in optimal time and space (Q293151) (← links)
- There is no asymptotic PTAS for two-dimensional vector packing (Q293152) (← links)
- Minimal sense of direction and decision problems for Cayley graphs (Q293153) (← links)
- Uniform generation of a Schröder tree (Q293156) (← links)
- Separating and shattering long line segments (Q293158) (← links)
- Fast and compact dispatching for dynamic object-oriented languages (Q293160) (← links)
- A simplified NP-complete MAXSAT problem (Q293164) (← links)
- An attack on a recursive authentication protocol. A cautionary tale (Q293167) (← links)
- A polynomial algorithm for the extendability problem in bipartite graphs (Q293170) (← links)
- An improved upper bound on the non-3-colourability threshold (Q293171) (← links)
- On secret sharing schemes (Q293172) (← links)
- The time complexity of updating snapshot memories (Q293175) (← links)
- On rotations in fringe-balanced binary trees (Q293176) (← links)
- Secret sets and applications (Q293178) (← links)
- The full quotient and its closure property for regular languages (Q293180) (← links)
- An improved algorithm for retrieving fuzzy information from two systems (Q293183) (← links)
- Improved solutions to the Steiner triple covering problem (Q293185) (← links)
- An active attack on protocols for server-aided RSA signature computation (Q293187) (← links)
- The complexity of scheduling starting time dependent tasks with release times (Q293188) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication (Q293191) (← links)
- Enclosing \(k\) points in the smallest axis parallel rectangle (Q293194) (← links)
- Comparison of signature file models with superimposed coding (Q293195) (← links)
- A note on parallel complexity of maximum \(f\)-matching (Q293199) (← links)
- Relating bends and size in orthogonal graph drawings (Q293201) (← links)
- A 2.5-factor approximation algorithm for the \(k\)-MST problem (Q293204) (← links)
- The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
- Agreement under faulty interfaces (Q293206) (← links)
- The \(p\)-neighbor \(k\)-center problem (Q293209) (← links)
- ANSV problem on BSRs (Q293212) (← links)
- Global avalanche characteristics and nonlinearity of balanced Boolean functions (Q293216) (← links)
- Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
- Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222) (← links)
- Optimal 1-Hamiltonian graphs (Q293225) (← links)
- An improved fixed-parameter algorithm for vertex cover (Q293227) (← links)
- Regular expressions with nested levels of back referencing form a hierarchy (Q293228) (← links)
- Scheduling cyclic tasks with binary periods (Q293232) (← links)
- The Bandwidth Allocation Problem in the ATM network model is NP-complete (Q293234) (← links)
