Andreas Fröhlich

According to our database, Andreas Fröhlich authored at least 16 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Keep It Simple: Evaluating Local Search-Based Latent Space Editing.

Andreas Meißner, Andreas Fröhlich, Michaela Geierhos

SN Comput. Sci., November, 2023

2022

Keep It Simple: Local Search-based Latent Space Editing.

Andreas Meißner, Andreas Fröhlich, Michaela Geierhos

Proceedings of the 14th International Joint Conference on Computational Intelligence, 2022

2021

XOR Local Search for Boolean Brent Equations.

Wojciech Nawrocki, Zhenjun Liu, Andreas Fröhlich, Marijn J. H. Heule, Armin Biere

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Ultra Wideband 43 GHz Preamplifier with up to 60 dB adjustable Gain for accurate Noise Figure Measurement of Cryogenic LNAs.

Peter Toth, Marco Tiesing, Lukas Naumann, Andreas Fröhlich, Thomas Wirths, Peter Knott

Proceedings of the 28th IEEE International Conference on Electronics, 2021

2018

Evaluating CDCL Restart Schemes.

Armin Biere, Andreas Fröhlich

Proceedings of Pragmatics of SAT 2015, 2018

2016

Complexity of Fixed-Size Bit-Vector Logics.

Gergely Kovásznai, Andreas Fröhlich, Armin Biere

Theory Comput. Syst., 2016

2015

Evaluating CDCL Variable Scoring Schemes.

Armin Biere, Andreas Fröhlich

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Stochastic Local Search for Satisfiability Modulo Theories.

Andreas Fröhlich, Armin Biere, Christoph M. Wintersteiger, Youssef Hamadi

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

iDQ: Instantiation-Based DQBF Solving.

Andreas Fröhlich, Gergely Kovásznai, Armin Biere, Helmut Veith

Proceedings of the POS-14. Fifth Pragmatics of SAT workshop, 2014

Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask).

Tomás Balyo, Andreas Fröhlich, Marijn Heule, Armin Biere

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses.

Adrian Balint, Armin Biere, Andreas Fröhlich, Uwe Schöning

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic.

Gergely Kovásznai, Helmut Veith, Andreas Fröhlich, Armin Biere

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding.

Andreas Fröhlich, Gergely Kovásznai, Armin Biere

Proceedings of the Computer Science - Theory and Applications, 2013

: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into.

Gergely Kovásznai, Andreas Fröhlich, Armin Biere

Proceedings of the Automated Deduction - CADE-24, 2013

2012

On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width.

Gergely Kovásznai, Andreas Fröhlich, Armin Biere

Proceedings of the 10th International Workshop on Satisfiability Modulo Theories, 2012

2010

Improving Stochastic Local Search for SAT with a New Probability Distribution.

Adrian Balint, Andreas Fröhlich

Proceedings of the Theory and Applications of Satisfiability Testing, 2010