Concurrent counting is harder than queuing (Q604464): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2010.07.002 / rank
Normal rank
 
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.1016/j.tcs.2010.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978890639 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60148586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cost of concurrent, low-contention Read \& Modify \& Write / rank
 
Normal rank
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: Q4436061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive concurrent distributed queuing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inherent bottleneck in distributed counting / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2010.07.002 / rank
 
Normal rank

Latest revision as of 22:03, 9 December 2024

scientific article
Language Label Description Also known as
English
Concurrent counting is harder than queuing
scientific article

    Statements

    Concurrent counting is harder than queuing (English)
    0 references
    0 references
    0 references
    11 November 2010
    0 references
    distributed algorithms
    0 references
    distributed data structures
    0 references
    distributed counting
    0 references
    distributed queuing
    0 references

    Identifiers