The following pages link to describes a project that uses (P1463):
Displaying 50 items.
- Emergency path restoration problems (Q435733) (← links)
- Lanczos-Chebyshev pseudospectral methods for wave-propagation problems (Q435817) (← links)
- Representations of rank two affine Hecke algebras at roots of unity. (Q435929) (← links)
- Real radical initial ideals (Q435959) (← links)
- Algorithms for checking rational roots of \(b\)-functions and their applications (Q435961) (← links)
- An effective version of the Lazard correspondence. (Q435965) (← links)
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Applying abstract acceleration to (co-)reachability analysis of reactive programs (Q435977) (← links)
- Discovering invariants via simple component analysis (Q435979) (← links)
- A structure preserving approximation method for Hamiltonian exponential matrices (Q436000) (← links)
- FEM multigrid techniques for fluid-structure interaction with application to hemodynamics (Q436006) (← links)
- On the generation of Krylov subspace bases (Q436007) (← links)
- Tikhonov regularization based on generalized Krylov subspace methods (Q436015) (← links)
- Efficient determination of the hyperparameter in regularized total least squares problems (Q436016) (← links)
- A simple yet effective a posteriori estimator for classical mixed approximation of Stokes equations (Q436018) (← links)
- Rack module enhancements of counting invariants (Q436057) (← links)
- Counting numerical semigroups by genus and some cases of a question of Wilf. (Q436083) (← links)
- On the classification of non-normal complete intersections of two quadrics (Q436111) (← links)
- A geometric deletion-restriction formula (Q436135) (← links)
- The convex Positivstellensatz in a free algebra (Q436182) (← links)
- PMIRKDC: a parallel mono-implicit Runge-Kutta code with defect control for boundary value ODEs (Q436200) (← links)
- CPU scheduling and memory management for interactive real-time applications (Q436214) (← links)
- Qoc elastic scheduling for real-time control systems (Q436218) (← links)
- On special elements in higher algebraic \(K\)-theory and the Lichtenbaum-Gross conjecture (Q436245) (← links)
- Dynamics of the Manakov-typed bound vector solitons with random initial perturbations (Q436278) (← links)
- On the super connectivity of Kronecker products of graphs (Q436343) (← links)
- Remodularizing Java programs for improved locality of feature implementations in source code (Q436348) (← links)
- Correct transformation: from object-based graph grammars to PROMELA (Q436353) (← links)
- Model evolution and refinement (Q436356) (← links)
- Transforming web services choreographies with priorities and time constraints into prioritized-time colored Petri nets (Q436361) (← links)
- Aspects preserving properties (Q436364) (← links)
- Mechanised wire-wise verification of Handel-C synthesis (Q436367) (← links)
- Mechanical reasoning about families of UTP theories (Q436368) (← links)
- Verification of graph grammars using a logical approach (Q436370) (← links)
- Function extraction (Q436372) (← links)
- Combining decision procedures by (model-)equality propagation (Q436376) (← links)
- JCML: A specification language for the runtime verification of Java card programs (Q436381) (← links)
- A formal model for service-oriented interactions (Q436383) (← links)
- Pattern matching for the masses using custom notations (Q436385) (← links)
- A model of context-dependent component connectors (Q436387) (← links)
- Dependence analysis for safe futures (Q436391) (← links)
- Mining quantified temporal rules: formalism, algorithms, and evaluation (Q436396) (← links)
- Automated verification of shape, size and bag properties via user-defined predicates in separation logic (Q436400) (← links)
- Provably correct conflict prevention bands algorithms (Q436402) (← links)
- Certifying assembly with formal security proofs: the case of BBS (Q436406) (← links)
- Sequential and distributed on-the-fly computation of weak tau-confluence (Q436408) (← links)
- Exploiting step semantics for efficient bounded model checking of asynchronous systems (Q436411) (← links)
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418) (← links)
- Refinement-oriented models of Stateflow charts (Q436420) (← links)
