Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking.
- Published in:
- Acta Informatica, 2024, v. 61, n. 3, p. 199, doi. 10.1007/s00236-023-00452-6
- By:
- Publication type:
- Article
Works matching IS 00015903 AND DT 2024 AND VI 61 AND IP 3
Results: 4
1
2
Reachability analysis of linear systems.
- Published in:
- Acta Informatica, 2024, v. 61, n. 3, p. 231, doi. 10.1007/s00236-024-00458-8
- By:
- Publication type:
- Article
3
Invariant relations for affine loops.
- Published in:
- Acta Informatica, 2024, v. 61, n. 3, p. 261, doi. 10.1007/s00236-024-00457-9
- By:
- Publication type:
- Article
4
The longest letter-duplicated subsequence and related problems.
- Published in:
- Acta Informatica, 2024, v. 61, n. 3, p. 315, doi. 10.1007/s00236-024-00459-7
- By:
- Publication type:
- Article