Travelled to:1 × Canada
1 × France
1 × Germany
1 × USA
2 × United Kingdom
Collaborated with:B.Becker M.D.T.Lewis S.Reimer M.Sauer J.Burchard I.Polian P.Marin M.Narizzano E.Giunchiglia
Talks about:sat (4) solv (3) base (2) distribut (1) techniqu (1) sensitiz (1) parallel (1) knowledg (1) conflict (1) speedup (1)
Person: Tobias Schubert
DBLP: Schubert:Tobias
Contributed to:
2015
20142013200920052004Wrote 6 papers:
- SAT-2015-BurchardSB #parallel #satisfiability
- Laissez-Faire Caching for Parallel #SAT Solving (JB, TS, BB), pp. 46–61.
- DATE-2014-ReimerSSB #using
- Using MaxBMC for Pareto-optimal circuit initialization (SR, MS, TS, BB), pp. 1–6.
- DATE-2013-SauerRSPB #performance #satisfiability
- Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths (MS, SR, TS, IP, BB), pp. 448–453.
- SAT-2009-LewisMSNBG #distributed #named
- PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing (MDTL, PM, TS, MN, BB, EG), pp. 509–523.
- SAT-2005-LewisSB #satisfiability
- Speedup Techniques Utilized in Modern SAT Solvers (MDTL, TS, BB), pp. 437–443.
- SAT-2004-LewisSB #detection #satisfiability
- Early Conflict Detection Based BCP for SAT Solving (MDTL, TS, BB), pp. 29–36.