Abstract: this dissertation studies algorithms to solve linear and convex vector optimization problems a parametric simplex algorithm for solving linear vector optimization problems (lvops) and two approximation algorithms for solving convex vector optimization problems type of material: academic dissertations ( phd. Dissertation thesis heuristic ray shooting algorithms by vlastimil havran submitted to the faculty of electrical engineering, czech technical university, prague, in partial fulfillment of the requirements for the degree of doctor november 2000 prague. This is the english translation (by michael p abramson) of the phd thesis of bruno buchberger, in which he introduced the algorithmic theory of gröbner bases some comments by buchberger on the translation and the thesis are given in an additional short paper in this issue of the journal of symbolic computation. We show that the work-stealing tree scheduler outperforms other schedulers when parallelizing highly irregular workloads, and retains optimal performance when parallelizing more uniform workloads concurrent algorithms and data structure operations in this thesis are linearizable and lock-free we present pseudocode. Online algorithms for combinatorial problems phd thesis by judit nagy- györgy supervisor: péter hajnal associate professor doctoral school in mathematics and computer science university of szeged bolyai institute 2009.
Dissertation analysis and design of symmetric cryptographic algorithms submitted to the faculty of computer science and mathematics of the university of passau in partial fulfilment of the requirements for the degree doctor rerum naturalium philipp jovanovic may 2015. Variational algorithms for approximate bayesian inference by matthew j beal ma, msci, physics, university of cambridge, uk (1998) the gatsby computational neuroscience unit university college london 17 queen square london wc1n 3ar a thesis submitted for the degree of doctor of. Optimization of basic algorithms in commutative algebra phd thesis massimo caboara universit`a degli studi di pisa dipartimento di matematica viii ciclo 29 may 1998.
Feb 5, 2014 this is to certify that the thesis titled approximation algorithms for covering and packing problems on paths being submitted by arindam pal for the award of the degree of doctor of philosophy in computer science and engineering is a record of original bonafide research work carried out by him under our. Algorithms for sequential decision making michael lederman littman phd dissertation department of computer science brown university providence, rhode island 02912 cs-96-09 march 1996.
Efficient algorithms using the multiplicative weights update method satyen kale a dissertation presented to the faculty of princeton university in candidacy for the degree of doctor of philosophy recommended for acceptance by the department of computer science november 2007. Hellenic republic national and kapodistrian university of athens archontia c giannopoulou partial orderings and algorithms on graphs phd thesis advisor: dimitrios m thilikos department of mathematics october 2012.
Graph based algorithms for scene reconstruction from two or more views a dissertation presented to the faculty of the graduate school of cornell university in partial fulfillment of the requirements for the degree of doctor of philosophy by vladimir kolmogorov january 2004. Distributed graph algorithms provide efficient and theoretically sound methods for solving graph problems in this thesis addresses a number of the central problems of distributed graph algorithms this thesis presents a sampling of the author's results during the phd period [gsar,gkpar gks16.