Hungarian

Combinatorial algorithms for the PNS and online scheduling problems

Imreh Csanád
Combinatorial algorithms for the PNS and online scheduling problems.
[Thesis] (Unpublished)

[thumbnail of 2001_imreh_csanad.pdf]
Preview
 PDF (disszertáció)
Download (3MB) | Preview
[thumbnail of 2001_imreh_csanad_tezis.pdf]
Preview
 PDF (tézis)
Download (659kB) | Preview
[thumbnail of 2001_imreh_csanad_birl.pdf] PDF (bírálati lap)
Restricted to Repository staff only
Download (602kB)
Item Type: Thesis (Doktori értekezés)
Creators: Imreh Csanád
Divisions: Doctoral School of Mathematics
Tudományterület / tudományág: Natural Sciences > Mathematics and Computer Sciences
Nyelv: English
Date: 2001
Additional Information: PhD ; Terjedelem: 90 lev + Tézis 16 p. + 2 db opp. vélemény
Uncontrolled Keywords: Informatika
Item ID: 4640
A mű MTMT azonosítója: 31240973
Date Deposited: 2020. Mar. 13. 15:49
Last Modified: 2020. Mar. 13. 15:59
Depository no.: B 3727
URI: https://doktori.bibl.u-szeged.hu/id/eprint/4640
Defence/Citable status: Defended.

Actions (login required)

View Item View Item
EPrints item download statistics

Downloads

Downloads per month over past year

Technical information: contenta AT ek.szte.hu
Repository is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.