(Probabilistic) recurrence relations revisited (Q5096333): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-59175-3_90 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2647681439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal, distributed edge colouring via the nibble method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities: theory of majorization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of parallel search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast randomized algorithms for distributed edge coloring / rank
 
Normal rank

Latest revision as of 22:18, 29 July 2024

scientific article; zbMATH DE number 7572144
Language Label Description Also known as
English
(Probabilistic) recurrence relations revisited
scientific article; zbMATH DE number 7572144

    Statements

    Identifiers