Gunnar Andersson, Publications
Google Scholar profile
Thesis
G. Andersson
,
Some New Randomized Approximation Algorithms
, Doctoral Dissertation, Department of Numerical Analysis and Computer Science, Royal Institute of Technology, May 2000.
[Postscript]
[PDF]
Thesis advisor was
Viggo Kann
.
Journal articles
G. Andersson
,
P. Bjesse
,
B. Cook
, Z. Hanna ,
Design automation with mixtures of proof strategies for propositional logic
, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 22, 8, 2003
G. Andersson
,
L. Engebretsen
,
Property testers for dense constraint satisfaction problems on finite domans
,
Random Structures and Algorithms
, Vol. 21, 1, 2002.
G. Andersson
,
L. Engebretsen
,
J. Håstad
,
A New Way of Using Semidefinite Programming With Applications to Linear Equations mod p
, Journal of Algorithms, Vol. 39, 2:162-204, 2001
G. Andersson
,
R.L. Francis
, T. Normark , M.B. Rayco ,
Experimentation With Aggregation Methods for Large-Scale Network Location Problems
,
Location Science
6:25-39, 1998
G. Andersson
,
L. Engebretsen
,
Better Approximation Algorithms for Set Splitting and Not-All-Equal Sat
, Information Processing Letters, 65(6):305-311, March 1998
Conference presentations
Henrik von Schenk,
G. Andersson
,
Jasper M. van Baten
, Ed Fontes,
A COMSOL Interface to CAPE-OPEN Compliant Physical and Thermodynamic Property Packages
,
AIChE Annual Meeting
, 2008
G. Andersson
, Per Bjesse, Byron Cook, Ziyad Hanna,
A Proof Engine Approach to Solving Combinational Design Automation Problems
, Proceedings of 39th
Design Automation Conference
, 2002
G. Andersson
,
An Approximation Algorithm for Max p-Section
, Proceedings of
16th International Symposium on Theoretical Aspects of Computer Science
, volume 1563 of Lecture Notes in Computer Science, pages 237-247. Springer-Verlag, Berlin, March 1999.
G. Andersson
,
L. Engebretsen
,
J. Håstad
,
A New Way to Use Semidefinite Programming With Applications to Linear Equations mod p
, Proceedings of
The Tenth Annual ACM-SIAM Symposium on Discrete Algorithms
, pages 41-50, January 1999.
G. Andersson
,
L. Engebretsen
,
Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems
, Proceedings of
2nd International Workshop on Randomization and Approximation Techniques in Computer Science
, volume 1518 of Lecture Notes in Computer Science, pages 357-368. Springer-Verlag, Berlin, October 1998.
G. Andersson
,
R.L. Francis
, T. Normark , M.B. Rayco ,
Aggregation Methods for Large-Scale Network Location Problems
, 7th International Symposium on Location Decisions, 1996
Others
G. Andersson
, Per Bjesse, Byron Cook,
A Proof Engine Approach to Solving Combinational Design Automation Problems
,
Designing Correct Circuits 2002
workshop
F. Almgren,
G. Andersson
,
Torbjörn Granlund
,
L. Ivansson
,
S. Ulfberg
,
How We Cracked the Code Book Ciphers
, 2000
G. Andersson
,
L. Engebretsen
,
Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-All-Equal Sat
, Technical report TR97-022,
Electronic Colloqium on Computational Complexity
G. Andersson
, Tomas Normark,
Aggregation methods for large-scale location problems on networks
, Master's Thesis, Department of Mathematics, Royal Institute of Technology, September 1995
Last modified: September 7, 2015