We are working to restore the Unionpedia app on the Google Play Store
OutgoingIncoming
🌟We've simplified our design for better navigation!
Instagram Facebook X LinkedIn
Your own Unionpedia with your logo and domain, from 9.99 USD/month
Create my Unionpedia

Pagh's problem

Index Pagh's problem

Pagh's problem is a datastructure problem often used when studying lower bounds in computer science named after Rasmus Pagh. [1]

Table of Contents

  1. 4 relations: Data structure, Mihai Pătrașcu (computer scientist), Rasmus Pagh, Upper and lower bounds.

  2. Problems in computer science

Data structure

In computer science, a data structure is a data organization, and storage format that is usually chosen for efficient access to data.

See Pagh's problem and Data structure

Mihai Pătrașcu (computer scientist)

Mihai PătraÈ™cu (17 July 1982 – 5 June 2012) was a Romanian-American computer scientist at AT&T Labs in Florham Park, New Jersey, USA.

See Pagh's problem and Mihai Pătrașcu (computer scientist)

Rasmus Pagh

Rasmus Pagh is a Danish computer scientist and a professor of computer science at the University of Copenhagen.

See Pagh's problem and Rasmus Pagh

Upper and lower bounds

In mathematics, particularly in order theory, an upper bound or majorant of a subset of some preordered set is an element of that is every element of.

See Pagh's problem and Upper and lower bounds

See also

Problems in computer science

References

[1] https://en.wikipedia.org/wiki/Pagh's_problem