The following pages link to Theoretical Computer Science (Q123643):
Displaying 50 items.
- Algorithmes de calcul de la réduction de Hermite d'une matrice à coefficients polynomiaux (Q123647) (← links)
- Limit behaviour of \(\mu\)-equicontinuous cellular automata (Q264524) (← links)
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Small (purely) catalytic P systems simulating register machines (Q264529) (← links)
- Lower bounds on the size of semi-quantum finite automata (Q264532) (← links)
- Flat maximal parallelism in P systems with promoters (Q264535) (← links)
- Modelling and verification of weighted spiking neural systems (Q264538) (← links)
- Complexity of model checking for reaction systems (Q264544) (← links)
- Investigating dynamic causalities in reaction systems (Q264548) (← links)
- Computing with viruses (Q264553) (← links)
- Mutation strength control via meta evolution strategies on the ellipsoid model (Q264556) (← links)
- Cell-like spiking neural P systems (Q264559) (← links)
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- Approximate consistency for transformations on words and trees (Q264563) (← links)
- The expressive power of snap-stabilization (Q264569) (← links)
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- Tree-automatic scattered linear orders (Q264574) (← links)
- Direct solution of piecewise linear systems (Q264576) (← links)
- Competitive self-stabilizing \(k\)-clustering (Q264580) (← links)
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- \(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networks (Q264588) (← links)
- A complete refinement procedure for regular separability of context-free languages (Q264992) (← links)
- Reversibility in the higher-order \(\pi\)-calculus (Q264996) (← links)
- Timed recursive state machines: expressiveness and complexity (Q264999) (← links)
- On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem (Q265002) (← links)
- Sparse convolution-based digital derivatives, fast estimation for noisy signals and approximation results (Q265033) (← links)
- Preface: Advances in discrete geometry for computer imagery (Q265034) (← links)
- Reeb graph based segmentation of articulated components of 3D digital objects (Q265038) (← links)
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length (Q265042) (← links)
- From prima quadraginta octant to lattice sphere through primitive integer operations (Q265044) (← links)
- An output-sensitive algorithm to compute the normal vector of a digital plane (Q265048) (← links)
- On bounded additivity in discrete tomography (Q265050) (← links)
- Palindromic language of thin discrete planes (Q265052) (← links)
- Geometric properties of matrices induced by pattern avoidance (Q265055) (← links)
- Efficient operations on discrete paths (Q265059) (← links)
- Reconstruction of convex polyominoes with a blocking component (Q265062) (← links)
- The impact of dynamic events on the number of errors in networks (Q265066) (← links)
- Optimizing budget allocation for center and median points (Q265070) (← links)
- Approximate core allocations and integrality gap for the bin packing game (Q265072) (← links)
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs (Q265074) (← links)
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- The effect of end-markers on counter machines and commutativity (Q265080) (← links)
- Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges (Q265083) (← links)
- \(i\)-\textsc{Mark}: a new subtraction division game (Q265084) (← links)
- Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes (Q265087) (← links)
- To catch a falling robber (Q265090) (← links)
- Complexity and monotonicity results for domination games (Q266262) (← links)
- On a conjecture about Parikh matrices (Q266265) (← links)
- Comparison-based interactive collaborative filtering (Q266268) (← links)
- \textsc{Pull} and \textsc{PushPull} are PSPACE-complete (Q266272) (← links)
