Olof Barr


Olof Barr


Mathematics LTH
Centre for Mathematical Sciences
Lund Institute of Technology / Lund University
Box 118
SE-221 00 LUND

Room: 438
Direct Phone: +46 46 22 298 80
Dept. Phone: +46 46 22 285 37
Fax: +46 46 22 240 10
e-mail: barr@maths.lth.se



Home Address: Axelvold 3129, SE-260 23 KÅGERÖD
Home Phone: +46 418 44 20 29
Cell Phone: +46 731 50 17 11
Home e-mail Address: barr@svalov2.net






Thesis

My Thesis can be downloaded from the link above.

List of other mathematical articles:


Barr (2005): A Deterministic and Polynomial Modified Perceptron Algorithm, in Computer Science Journal of Moldova, Vol. 13 Nr 3(39), 254-267.


Barr & Wigelius (2004): Rescaling in the Perceptron Algorithm for Solving Linear Programs in Polynomial time. Technical Report, LTH, Sweden.

Barr & Wigelius (2004): New Estimates Correcting an Earlier Proof of the Perceptron Algorithm to be Polynomial, Preprint 2004:08, LTH, Sweden


Barr & Johansson (1997): Another Note on the Loebl-Komlós-Sos Conjecture, Preprint no. 22 (1997), Umeå University, Sweden.


Barr (1997): A Note on the Loebl-Komlós-Sos Conjecture, Preprint no. 14 (1997), Umeå University, Sweden.


Barr (1996): Erdös-Sós Conjecture for Graphs with High Minimum Degree, Preprint no. 7 (1996), Umeå University, Sweden.

Barr(1995): Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles, Ars Combinatorica, Vol. 50, (1998).


Barr (1994): Large 2-regular Subgraphs with Few Components in 3-regular Hamiltonian Graphs, Preprint no. 10, 1995, Umeå University, Sweden.


Barr (1994): On Extremal Graphs without Compatible Triangles or Quadrilaterals, Discrete Mathematics 125 (1994) 31-43.