When distributed computation is communication expensive (Q1689746): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
When Distributed Computation Is Communication Expensive
description / endescription / en
scientific article
scientific article; zbMATH DE number 6349282
Property / title
 
When Distributed Computation Is Communication Expensive (English)
Property / title: When Distributed Computation Is Communication Expensive (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1423.68077 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-41527-2_2 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
29 September 2014
Timestamp+2014-09-29T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 29 September 2014 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6349282 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2156396224 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.4636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Monitoring without Monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Steps for Parallel Query Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic counting algorithms for data base applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for distributed functional monitoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Protocols for Distributed Classification and Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting, Searching, and Simulation in the MapReduce Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity of approximate matching in distributed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Lower Bound for Distinct Elements in the Message Passing Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for distributed functional monitoring / rank
 
Normal rank

Latest revision as of 23:11, 14 July 2024

scientific article; zbMATH DE number 6349282
  • When Distributed Computation Is Communication Expensive
Language Label Description Also known as
English
When distributed computation is communication expensive
scientific article; zbMATH DE number 6349282
  • When Distributed Computation Is Communication Expensive

Statements

When distributed computation is communication expensive (English)
0 references
When Distributed Computation Is Communication Expensive (English)
0 references
0 references
0 references
17 January 2018
0 references
29 September 2014
0 references
multi-party communication complexity
0 references
messpage-passing
0 references
statistical and graph problems
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references