CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing.
Authors
Petr Salinger
Pavel Tvrdik
Praha (Czech Republic) CVUT Praha
Publication date
1 January 2000
Publisher
Praha (Czech Republic) : CVUT Praha
Doi
Cite
Abstract
Available from STL, Prague, CZ / NTK - National Technical LibrarySIGLECZCzech Republi
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
OpenGrey Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 14/06/2016
FigShare
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:figshare.com:article/34098...
Last time updated on 12/02/2018
E-LIS
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:eprints.rclis.org:29524
Last time updated on 03/08/2016
E-LIS repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:eprints.rclis.org:29524
Last time updated on 05/04/2020