The following pages link to A. Bijlsma (Q685523):
Displayed 23 items.
- Calculating with procedure calls (Q685524) (← links)
- Equivalence of the Gries and Martin proof rules for procedure calls (Q1065535) (← links)
- A sharp proof rule for procedures in WP semantics (Q1104730) (← links)
- Derivation of logic programs by functional methods (Q1183419) (← links)
- (Q1336050) (redirect page) (← links)
- Two fast parallel prime number sieves (Q1336051) (← links)
- Efficient computation of addition chains (Q1340674) (← links)
- Template method test pattern (Q1799560) (← links)
- Calculating with pointers (Q1822921) (← links)
- Process scheduling in DSC and the large sparse linear systems challenge (Q1895417) (← links)
- Efficient checkers for number-theoretic computations (Q1898116) (← links)
- Dynamic evaluation and algebraic closure in Axiom (Q1906927) (← links)
- Point-free substitution (Q1924634) (← links)
- Quasi-boolean equivalence (Q2366071) (← links)
- (Q3048907) (← links)
- An elliptic analogue of the Franklin-Schneider theorem (Q3892309) (← links)
- (Q3943038) (← links)
- A note on elliptic functions and approximation by algebraic numbers of bounded degree (Q3946241) (← links)
- Algebraic points of abelian functions in two variables (Q3946242) (← links)
- (Q4071307) (← links)
- (Q4126411) (← links)
- (Q4213377) (← links)
- (Q4748214) (← links)