Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Message and time efficient distributed algorithms for sparse k-connectivity certificates
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
1996 (English)In: Fifteenth ACM Symposium on Principles of Distributed Computing: PODC '96, 1996Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
1996.
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-27906Local ID: 17c68970-7ed6-11db-8824-000ea68e967bOAI: oai:DiVA.org:ltu-27906DiVA, id: diva2:1001097
Conference
ACM Symposium on Principles of Distributed Computing (PODC '96) : 23/05/1996 - 26/05/1996
Note

Godkänd; 1996; 20061128 (ysko)

Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-01-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

http://www.podc.org/podc96/

Authority records

Carr-Motyckova, Lenka

Search in DiVA

By author/editor
Carr-Motyckova, Lenka
By organisation
Computer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 52 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf