default search action
Andreas Fröhlich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j2]Andreas Meißner, Andreas Fröhlich, Michaela Geierhos
:
Keep It Simple: Evaluating Local Search-Based Latent Space Editing. SN Comput. Sci. 4(6): 820 (2023) - 2022
- [c14]Andreas Meißner, Andreas Fröhlich, Michaela Geierhos:
Keep It Simple: Local Search-based Latent Space Editing. IJCCI 2022: 273-283 - 2021
- [c13]Peter Toth, Marco Tiesing, Lukas Naumann, Andreas Fröhlich, Thomas Wirths, Peter Knott:
Ultra Wideband 43 GHz Preamplifier with up to 60 dB adjustable Gain for accurate Noise Figure Measurement of Cryogenic LNAs. ICECS 2021: 1-2 - [c12]Wojciech Nawrocki
XOR Local Search for Boolean Brent Equations. SAT 2021: 417-435
2010 – 2019
- 2018
- [c11]Armin Biere, Andreas Fröhlich:
Evaluating CDCL Restart Schemes. POS@SAT 2018: 1-17 - 2016
- [j1]Gergely Kovásznai, Andreas Fröhlich, Armin Biere
Complexity of Fixed-Size Bit-Vector Logics. Theory Comput. Syst. 59(2): 323-376 (2016) - 2015
- [c10]Andreas Fröhlich, Armin Biere, Christoph M. Wintersteiger, Youssef Hamadi:
Stochastic Local Search for Satisfiability Modulo Theories. AAAI 2015: 1136-1143 - [c9]Armin Biere
Evaluating CDCL Variable Scoring Schemes. SAT 2015: 405-422 - 2014
- [c8]Gergely Kovásznai, Helmut Veith, Andreas Fröhlich, Armin Biere
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic. MFCS (2) 2014: 481-492 - [c7]Andreas Fröhlich, Gergely Kovásznai, Armin Biere, Helmut Veith:
iDQ: Instantiation-Based DQBF Solving. POS@SAT 2014: 103-116 - [c6]Adrian Balint, Armin Biere
Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses. SAT 2014: 302-316 - [c5]Tomás Balyo, Andreas Fröhlich, Marijn Heule, Armin Biere
Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask). SAT 2014: 317-332 - 2013
- [c4]Gergely Kovásznai, Andreas Fröhlich, Armin Biere
: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into. CADE 2013: 443-449 - [c3]Andreas Fröhlich, Gergely Kovásznai, Armin Biere:
More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding. CSR 2013: 378-390 - 2012
- [c2]Gergely Kovásznai, Andreas Fröhlich, Armin Biere:
On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width. SMT@IJCAR 2012: 44-56 - 2010
- [c1]Adrian Balint, Andreas Fröhlich:
Improving Stochastic Local Search for SAT with a New Probability Distribution. SAT 2010: 10-15
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: