Edsger Dijkstra

(5 articles)

1952

DP
Dynamic Programming

Method used in computer science and mathematics to solve complex problems by breaking them down into simpler subproblems and solving each of these subproblems just once, storing their solutions.

Generality: 830

1956

Algorithm

Step-by-step procedure or formula for solving a problem or performing a task.

Generality: 960

1960

Parallelism

Simultaneous execution of multiple processes or tasks to improve performance and efficiency.

Generality: 811

1965

Discrete System

A system characterized by distinct, separate states or events, typically used in computing and AI to describe processes or algorithms that operate over finite or countable sets.

Generality: 625

1980

Transition System

A formal model used to represent and analyze the dynamic behavior of systems by defining states and transitions between them based on actions or events.