Gør som tusindvis af andre bogelskere
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.Du kan altid afmelde dig igen.
Research in the field of parallel computer architectures andparallel algorithms has been very successful in recentyears, and further progress isto be expected. On the otherhand, the question of basic principles of the architectureof universal parallel computers and their realizations isstill wide open. The answer to this question must beregarded as mostimportant for the further development ofparallel computing and especially for user acceptance.The First Heinz Nixdorf Symposium brought together leadingexperts in the field of parallel computing and itsapplications to discuss the state of the art, promisingdirections of research, and future perspectives. It was thefirst in a series of Heinz Nixdorf Symposia,intended tocover varying subjects from the research spectrum of theHeinz Nixdorf Institute of the University of Paderborn.This volume presents the proceedings of the symposium, whichwas held in Paderborn in November1992. The contributionsare grouped into four parts: parallel computation models andsimulations, existing parallel machines, communication andprogramming paradigms, and parallel algorithms.
This book constitutes the refereed proceedings of the 9th Annual European Symposium on Algorithms, ESA 2001, held in Aarhus, Denmark, in August 2001.The 41 revised full papers presented together with three invited contributions were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on caching and prefetching, online algorithms, data structures, optimization and approximation, sequences, scheduling, shortest paths, geometry, distributed algorithms, graph algorithms, pricing, broadcasting and multicasting, graph labeling and graph drawing, and graphs.
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.