Matches in SemOpenAlex for { <https://semopenalex.org/work/W2052871647> ?p ?o ?g. }
Showing items 1 to 54 of
54
with 100 items per page.
- W2052871647 endingPage "86" @default.
- W2052871647 startingPage "75" @default.
- W2052871647 abstract "We consider the problem of complete information dissemination among n autonomous processors in a fully connected distributed system. Initially, each processor possesses information not held by any other processor; it is required that all the processors obtain all the information in the shortest possible time. Messages are exchanged in discrete, synchronized rounds; message size is unlimited, but during a round, each processor may transmit messages to, or receive messages from, at most k other processors. We show that ⌈log λ ( k ) n ⌉ rounds are necessary for such an information exchange and that ⌈log λ ( k ) n ⌉+3 are sufficient, where λ(k)= (k+ k 2 +4 ) 2 . This settles in the affirmative a 10-year-old conjecture of Entringer and Slater; our lower bound is new even for the case k = 1." @default.
- W2052871647 created "2016-06-24" @default.
- W2052871647 creator A5048515738 @default.
- W2052871647 creator A5056680757 @default.
- W2052871647 date "1993-02-01" @default.
- W2052871647 modified "2023-09-30" @default.
- W2052871647 title "Fast information sharing in a complete network" @default.
- W2052871647 cites W1964729314 @default.
- W2052871647 cites W1978723556 @default.
- W2052871647 cites W2003214215 @default.
- W2052871647 cites W2035362408 @default.
- W2052871647 cites W2052648207 @default.
- W2052871647 cites W2058322021 @default.
- W2052871647 cites W2069843743 @default.
- W2052871647 cites W2094965318 @default.
- W2052871647 doi "https://doi.org/10.1016/0166-218x(93)90180-v" @default.
- W2052871647 hasPublicationYear "1993" @default.
- W2052871647 type Work @default.
- W2052871647 sameAs 2052871647 @default.
- W2052871647 citedByCount "21" @default.
- W2052871647 countsByYear W20528716472014 @default.
- W2052871647 crossrefType "journal-article" @default.
- W2052871647 hasAuthorship W2052871647A5048515738 @default.
- W2052871647 hasAuthorship W2052871647A5056680757 @default.
- W2052871647 hasBestOaLocation W20528716471 @default.
- W2052871647 hasConcept C114614502 @default.
- W2052871647 hasConcept C33923547 @default.
- W2052871647 hasConcept C41008148 @default.
- W2052871647 hasConcept C80444323 @default.
- W2052871647 hasConceptScore W2052871647C114614502 @default.
- W2052871647 hasConceptScore W2052871647C33923547 @default.
- W2052871647 hasConceptScore W2052871647C41008148 @default.
- W2052871647 hasConceptScore W2052871647C80444323 @default.
- W2052871647 hasIssue "1" @default.
- W2052871647 hasLocation W20528716471 @default.
- W2052871647 hasOpenAccess W2052871647 @default.
- W2052871647 hasPrimaryLocation W20528716471 @default.
- W2052871647 hasRelatedWork W1974891317 @default.
- W2052871647 hasRelatedWork W1978042415 @default.
- W2052871647 hasRelatedWork W2017331178 @default.
- W2052871647 hasRelatedWork W2044189972 @default.
- W2052871647 hasRelatedWork W2069964982 @default.
- W2052871647 hasRelatedWork W2313400459 @default.
- W2052871647 hasRelatedWork W2976797620 @default.
- W2052871647 hasRelatedWork W3086542228 @default.
- W2052871647 hasRelatedWork W4225152035 @default.
- W2052871647 hasRelatedWork W4245490552 @default.
- W2052871647 hasVolume "42" @default.
- W2052871647 isParatext "false" @default.
- W2052871647 isRetracted "false" @default.
- W2052871647 magId "2052871647" @default.
- W2052871647 workType "article" @default.