Dr. Adrian Balint

probSAT Stochastic Local Search SAT Solver(code at github)

EDACC - Experiment Design and Administration for Computer Cluster

Captain Jack - SLS SAT Solver

Sparrow - SLS SAT Solver

hybridGM - SLS SAT Solver

Uniform Random k-SAT Generator

• Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning.
  Adrian Balint, Norbert Manthey
  in Proceedings of POS2013. Slides available here.
• Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions
  Adrian Balint, Anton Belov, Marijn J.H. Heule, and Matti Järvisalo (editors)
  volume B-2013-1 of Department of Computer Science Series of Publications B, University of Helsinki, 2013. ISBN 978-952-10-8991-6. [handle:10138/40026]
• probsat
  Adrian Balint, Uwe Schöning
  In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions., page 70. [handle:10138/40026]
• Sparrow+CP3 and SparrowToRiss
  Adrian Balint, Norbert Manthey
  In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions., pages 87-88. [handle:10138/40026]
• Generating the Uniform Random Benchmarks for SAT Competition 2013
  Adrian Balint, Anton Belov, Marijn J.H. Heule, and Matti Järvisalo
  In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions., pages 97-98. [handle:10138/40026]
• The Application and the Hard Combinatorial Benchmarks in SAT Competition 2013
  Adrian Balint, Anton Belov, Marijn J.H. Heule, and Matti Järvisalo
  In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions., pages 97-98. [handle:10138/40026]
• SAT encoded Graph Isomorphism (GI) Benchmark Description
  Frank Mugrauer, Adrian Balint
  In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions., pages 115-116. [handle:10138/40026]
• SAT encoded Low Autocorrelation Binary Sequence (LABS) Benchmark Description
  Frank Mugrauer, Adrian Balint
  In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions., pages 117-118. [handle:10138/40026]
• SAT Challenge 2012 Random SAT Track:Description of Benchmark Generation
  Adrian Balint, Anton Belov, Matti Järvisalo, Carsten Sinz
  Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions, pages 72-73 [handle:10138/34218]
• Application and Hard Combinatorial Benchmarks in SAT Challenge 2012
  Adrian Balint, Anton Belov, Matti Järvisalo, Carsten Sinz
  Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions, pages 69-71 [handle:10138/34218]
• Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break
  Adrian Balint, Uwe Schöning
  Lecture Notes in Computer Science, 2012, Volume 7317, Theory and Applications of Satisfiability Testing - SAT 2012, pages 16-29
• Captain Jack: New Variable Selection Heuristics in Local Search for SAT
  Dave A. D. Tompkins, Adrian Balint, Holger H. Hoos
  Lecture Notes in Computer Science, 2011, Volume 6695, Theory and Applications of Satisfiability Testing - SAT 2011, pages 302-316
• EDACC - An advanced Platform for the Experiment Design, Administration and Analysis of Empirical Algorithms
  Adrian Balint, Daniel Gall, Gregor Kapler, Robert Retz, Daniel Diepold and Simon Gerber
  In proceedings of LION5
• Experiment Design and Administration for Computer Cluster for SAT-solvers (EDACC), System Description
  Adrian Balint, Daniel Gall, Gregor Kapler, Robert Retz
  in JSAT Volume 7
  the slides can be downloaded here
• Improving Stochastic Local Search for SAT with a New Probability Distribution
  Adrian Balint, Andreas Fröhlich
  in the proceedings of SAT2010 Springer LNCS 6175 p.10
  the slides can be downloaded here
• A novel approach to combine a SLS- and a DPLL-solver for the satisfiability problem
  Adrian Balint, Michael Henn, Oliver Gableske
  in the proceedings of SAT2009 Springer LNCS 5584 p.284
  the slides can be downloaded here (you will need the XviD codec)
• Algorithmus von Beigel und Eppstein für das (4,2)-CSP
  Adrian Balint
  Diplomarbeit, Universität Ulm (Mai 2006

• Proseminar Algorithmen (WS10/11)
• Übungen Algorithmen und Datenstrukturen (WS10/11)
• Project SAT-Solving (SS10)
• Proseminar Algorithmen (SS10)
• Übungen Formale Grundlagen der Informatik (WS09/10)
• Project SAT-Solving (WS09/10)
• Proseminar Algorithmen (WS09/10)
• Project SAT-Solving + CSP (SS 09)
• Project "Effiziente Algorithmen für SAT und CSP" (WS 08/09)
• Übungen zur Vorlesung Formale Methoden der Informatik (WS 07/08)
• Übungen Theoretische Informatik II (SS 07)
• Praktikum "Effiziente Algorithmen für SAT und CSP" (SS 07)
• Proseminar "Algorithmen" (SS07)http://theorie.informatik.uni-ulm.de/Lehre/SS7/ProseminarAlgorithmen/index.html
• Übungen zur Vorlesung Formale Methoden der Informatik (WS 06/07)
• Praktikum "Effiziente Algorithmen für SAT und CSP" (WS2006/07)

Diploma Theses

• Oliver Gableske: "Towards the development of a Hybrid SAT Solver"
• Andreas Fröhlich: "Verbesserung stochastischer lokaler Suchalgorithmen für das Erfüllbarkeitsproblem der Aussagenlogik"
• Melanie Handel: "Visualisierung und Data Mining eines hochdimensionalen Raums"

Master Theses:

• Daniel Diepold: "Model-based Parallel Automatic Algorithm Configuration"
• Simon Gerber: "Massive Parallel Algorithm Configuration"
• Juri Schulte: "Analyse von Parallelen Automatischen Algorithm-Konfiguratoren"

Bachelor Theses