The following pages link to Bruno Codenotti (Q918126):
Displayed 25 items.
- A Note on Quadrant Interlocking Factorization (Q3833496) (← links)
- (Q4023834) (← links)
- A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices (Q4337389) (← links)
- (Q4503943) (← links)
- (Q4519381) (← links)
- (Q4536926) (← links)
- A characterization of bent functions in terms of strongly regular graphs (Q4571343) (← links)
- Spectral analysis of Boolean functions as a graph eigenvalue problem (Q4571396) (← links)
- Checking properties of polynomials (Q4571953) (← links)
- Self-correcting for function fields of finite transcendental degree (Q4645210) (← links)
- Transitive Cellular Automata are Sensitive (Q4891809) (← links)
- (Q4955547) (← links)
- (Q4955548) (← links)
- Global strategies for augmenting the efficiency of TSP heuristics (Q5060118) (← links)
- Checking approximate computations over the reals (Q5248550) (← links)
- An experimental study of different approaches to solve the market equilibrium problem (Q5269284) (← links)
- Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP (Q5284220) (← links)
- Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games (Q5449531) (← links)
- (Q5466063) (← links)
- Automata, Languages and Programming (Q5466477) (← links)
- Algorithms – ESA 2005 (Q5475821) (← links)
- (Q5748802) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897795) (← links)
- The role of arithmetic in fast parallel matrix inversion (Q5940607) (← links)
- Average circuit depth and average communication complexity (Q6102294) (← links)