DOI,IST REx ID,Research Group,Title of publication
null,10672,"GradSch,ToHe",Learning representations for binary-classification without backpropagation
null,10673,"GradSch,ToHe",A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits
10.1007/978-3-030-45237-7_5,7808,ToHe,How many bits does it take to quantize your neural network?
10.1145/3385412.3385980,8012,ToHe,Inductive sequentialization of asynchronous programs
10.1007/978-3-030-51074-9_2,8194,ToHe,An SMT theory of fixed-point arithmetic
10.1007/978-3-030-53288-8_14,8195,ToHe,Refinement for structured concurrent programs
null,8287,ToHe,Reachability analysis of linear hybrid systems via block decomposition
10.15479/AT:ISTA:8332,8332,ToHe,"Verifying concurrent programs: Refinement, synchronization, sequentialization"
10.29007/zkf6,8571,ToHe,ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics
10.29007/7dt2,8572,ToHe,ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics
10.4230/LIPIcs.CONCUR.2020.2,8599,ToHe,A survey of bidding games on graphs
10.4230/LIPIcs.CONCUR.2020.23,8600,"KrCh,ToHe",Multi-dimensional long-run average problems for vector addition systems with states
10.1007/978-3-030-60508-7_1,8623,ToHe,Monitorability under assumptions
10.1038/s42256-020-00237-3,8679,ToHe,Neural circuit policies enabling auditable autonomy
10.1109/ICRA40945.2020.9196608,8704,ToHe,Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme
10.1109/MEMOCODE51338.2020.9314994,8750,ToHe,Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions
10.1109/TCAD.2020.3012859,8790,ToHe,Reachability analysis of linear hybrid systems via block decomposition
10.34727/2020/isbn.978-3-85448-042-6_21,9040,ToHe,Formal methods with a touch of magic
10.1109/CDC42340.2020.9304042,9103,ToHe,Lagrangian reachtubes: The next generation
10.1609/aaai.v34i02.5546,9197,"ToHe,KrCh",All-pay bidding games on graphs