SIS PUT | Sekwencyjne i współbieżne algorytmy dla problemu rozkroju

Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Menu

Scientific Information System of the Poznań University of Technology

PL EN

Main page / Dissertations / Sekwencyjne i współbieżne algorytmy dla problemu rozkroju

Submit a comment

Dissertation

Download BibTeX

Title

Sekwencyjne i współbieżne algorytmy dla problemu rozkroju

Authors

Rafał Walkowiak ^{[ 1 ][ P ]}

^{[ 1 ]} Instytut Informatyki, Wydział Elektryczny, Politechnika Poznańska | ^{[ P ]} employee

Promoter

Jacek Błażewicz ^{[ 1 ][ P ]}

^{[ 1 ]} Instytut Informatyki, Wydział Elektryczny, Politechnika Poznańska | ^{[ P ]} employee

Reviewers

Marek Kubale
Jan Węglarz ^{[ 1 ][ P ]}

^{[ 1 ]} Instytut Informatyki, Wydział Elektryczny, Politechnika Poznańska | ^{[ P ]} employee

Language

polish

Number of pages

134

Signature of printed version

DrOIN 203

On-line catalog

Full text of dissertation

no permission to download file

Access level to full text

archive

First review

Marek Kubale

Place

Gdańsk, Polska

Date

11.02.1997

Language

polish

Review text

no permission to download file

Access level to review text

archive

Second review

Jan Węglarz

Place

Poznań, Polska

Date

03.03.1997

Language

polish

Review text

no permission to download file

Access level to review text

archive

Dissertation status

dissertation

Place of defense

Poznań, Polska

Date of defense

15.04.1997

System created by Poznań University of Technology and Poznan Supercomputing and Networking Center

Log in through eKonto to add to SIS

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.