Все публикации

0:50:48

[PADL'24] Automated Interactive Domain-Specific Conversational Agents that Understand Huma...

0:28:50

[PADL'24] Marketplace Logistic via Answer Set Programming

0:20:09

[PLanQC'24] Optimal compilation of parametrised quantum circuits

0:21:41

[PLanQC'24] GUPPY: Pythonic Quantum-Classical Programming

0:25:36

[PLanQC'24] Circuit Width Estimation via Effect Typing and Linear Dependency (Extended Abs...

0:18:16

[DRAGSTERS] Scaling Decision--Theoretic Probabilistic Programming Through Factorization

0:19:25

[LCTES'23] reUpNix: Reconfigurable and Updateable Embedded Systems

0:21:29

[ISMM'23] NUMAlloc: A Faster NUMA Memory Allocator

0:17:04

[LCTES'23] Sequential Scheduling of Dataflow Graphs for Memory Peak Minimization

0:23:43

[ARRAY'23] U-Net CNN in APL: Exploring Zero-Framework, Zero-Library Machine Learning

0:12:19

[LCTES'23] (WIP) Tiling for DMA-Based Hardware Accelerators

0:21:03

[CoqPL'24] Well-founded recursion done right

0:23:30

[PLDI'23] Cakes That Bake Cakes: Dynamic Computation in CakeML

0:20:10

[PLDI'23] Probabilistic Programming with Stochastic Probabilities

0:31:05

[WITS'24] Yaffle: A New Core for Idris 2

0:35:47

[WITS'24] Retrofitting Null-Safety into Java

0:20:49

[POPL'24] Programming-by-Demonstration for Long-Horizon Robot Tasks

0:19:42

[POPL'24] Disentanglement with Futures, State, and Interaction

0:19:43

[POPL'24] Asynchronous Probabilistic Couplings in Higher-Order Separation Logic

0:19:22

[POPL'24] Internal parametricity, without an interval

0:20:04

[POPL'24] Optimal Program Synthesis via Abstract Interpretation

0:18:17

[POPL'24] Parikh's Theorem Made Symbolic

1:22:53

[POPL'24] SIGPLAN Awards, PC Chair's Report, and Business Meeting

0:22:21

[POPL'24] Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants f...