Skip to main content
SpringerLink
Log in

Efficient algorithmic construction of designs

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 278))

Included in the following conference series:

  • 135 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Burosch, Über die Anzahl elementarer BUB der vollständigen (6,3)-Familie, Rostock. Math. Kolloq. 11 (1979), 5–11.

    Google Scholar 

  2. C.J.Colbourn & M.J.Colbourn, Algorithms in combinatorial design theory (Annals of Discrete Mathematics 26), North-Holland, 1985.

    Google Scholar 

  3. P.B.Gibbons, Computing techniques for the construction and analysis of block designs, Ph.D. thesis, Department of Computer Science, University of Toronto, 1976.

    Google Scholar 

  4. H.-D.O.F. Gronau, A survey of results on the number of t-(v,k,λ) designs, Annals of Discrete Mathematics 26 (1985), 209–220.

    Google Scholar 

  5. H.-D.O.F. Gronau, Über nichtisomorphe elementare blockwiederholungsfreie 2-(8,4,λ)-Blockpläne I, Rostock. Math. Kolloq. 11 (1979), 59–66.

    Google Scholar 

  6. H.-D.O.F. Gronau & R. Reimer, Über nichtisomorphe elementare blockwiederholungsfreie 2-(8,4,λ)-Blockpläne II, Rostock. Math. Kolloq. 17 (1981), 27–35.

    Google Scholar 

  7. H.-D.O.F. Gronau & R. Reimer, Über nichtismorphe elementare block-wiederholungsfreie 2-(8,4,λ)-Blockpläne III, Rostock. Math. Kolloq. 17 (1981), 37–47.

    Google Scholar 

  8. A.V. Ivanov, Konstruktivnoje perečislenie sistem incidentnosti III, Rostock. Math. Kolloq. 24 (1983), 43–62.

    Google Scholar 

  9. D.Rasch & G.Herrendörfer, Statistische Versuchsplanung, Deutscher Verlag der Wissenschaften, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik, Ernst-Moritz-Arndt-Universität, F.-L.-Jahn-Str. 15 a, 2200, Greifswald, GDR

    Hans-Dietrich O. F. Gronau

Authors
  1. Hans-Dietrich O. F. Gronau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gronau, HD.O.F. (1987). Efficient algorithmic construction of designs. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation