G. Andersson

How We Cracked the Code Book Ciphers

Staffan Ulfberg, Torbjörn Granlund, Lars Ivansson, 2000 .

Some new randomized approximation algorithms

G. Andersson, Gunnar Andersson, 2000 .

A proof engine approach to solving combinational design automation problems

Z. Hanna, B. Cook, P. Bjesse, 2002, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).

AGGREGATION METHOD EXPERIMENTATION FOR LARGE-SCALE NETWORK LOCATION PROBLEMS

Richard L. Francis, Gunnar Andersson, M. Brenda Rayco, 1998 .

A new way to use semidefinite programming with applications to linear equations mod p

Johan Håstad, Lars Engebretsen, Gunnar Andersson, 2001, SODA '99.

An Approximation Algorithm for Max p-Section

Gunnar Andersson, G. Andersson, 1999, STACS.

Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT

Lars Engebretsen, Gunnar Andersson, Lars Engebretsen, 1998, Inf. Process. Lett..

Design automation with mixtures of proof strategies for propositional logic

Per Bjesse, Byron Cook, Ziyad Hanna, 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems

Lars Engebretsen, Gunnar Andersson, Lars Engebretsen, 1998, RANDOM.