Removing Ramsey theory: Lower bounds with smaller domain size (Q1392014): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between Concurrent-Write Models of Parallel Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulations among concurrent-write PRAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Separating Systems and Families of Perfect Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation and conflicts in memory access / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processor-time tradeoffs in PRAM simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ / rank
 
Normal rank

Revision as of 13:22, 28 May 2024

scientific article
Language Label Description Also known as
English
Removing Ramsey theory: Lower bounds with smaller domain size
scientific article

    Statements