uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Random records and cuttings in complete binary trees
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics, Mathematics I -V.
2004 (English)In: Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities (Vienna 2004), 2004Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
2004.
Identifiers
URN: urn:nbn:se:uu:diva-70842ISBN: 3-7643-7128-5 (print)OAI: oai:DiVA.org:uu-70842DiVA: diva2:98753
Available from: 2007-03-23 Created: 2007-03-23

Open Access in DiVA

No full text

Authority records BETA

Janson, Svante

Search in DiVA

By author/editor
Janson, Svante
By organisation
Department of MathematicsMathematics I -V

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 305 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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