Xi Chen
where else to find them
no profile links on file
what they talk about
all 7 in the filters
where they keep going back
no series more than once — all 7 in the filters
on a stage with
- Anindya Deonce
- Asia Slowinskaonce
- Chin Ho Leeonce
all 31 in the filters
who talks about the same things
- Anindya De3 talks
- Theodoros Theodoridis5 talks
- Xipeng Shen5 talks
- Arne Laponin4 talks
- Jonathan Chan5 talks
- Aseem Rastogi7 talks
| title | conference | date |
|---|---|---|
| Open-Source Xiangshan Nanhu Processor Experience Day | RISC-V Summit Europe 2025 | 2025-05-12 |
Second-generation Nanhu boards boot Linux and run video playback, web browsing and even GPU-backed cloud game streaming; hardware is on GitHub with 6.4k stars… | ||
| Leaving ETLs Behind: Moving from a ‘Code Less’ Solution to a ‘Code Full’ Approach | DevFest Toulouse 2024 | 2024-11-07 |
Migration from an IBM DataStage GUI-based ETL to a code-first ELT stack using dbt and Snowflake, arguing that "code less" ETL tools struggle with modern… | ||
| Klonet: an Easy-to-Use and Scalable Platform for Computer Networks Education | 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI '24) | 2024-04-16 |
Klonet is a container‑based, distributed network emulation platform that uses Docker containers and veth pairs with a controller-plus-agents orchestrator and a… | ||
| Polynomial-time trace reconstruction in the low deletion rate regime | ITCS 2021 | 2021-01-06 |
Claim: a polynomial-time algorithm reconstructs any n-bit string with high probability using polynomially many traces when the deletion rate δ < n^{-1/3+ε}… | ||
| InfoNice: Easy Creation of Information Graphics | CHI 2018 | 2018-04-21 |
InfoNice is a Power BI plug-in that turns standard charts into data-driven infographics by replacing marks with images, icons or text and controlling inner and… | ||
| An In-Depth Analysis of Disassembly on Full-Scale x86/x64 Binaries | USENIX Security '16 | 2016-08-10 |
Measurement of nine disassemblers on 981 binaries uses DWARF/PDB plus an LLVM pass to create ground truth and finds IDA recovers 96–99% of instructions, linear… | ||
| Dichotomy Theorems for Counting Problems I | Counting Complexity and Phase Transitions Boot Camp | 2016-01-26 |
Classifies partition functions Z_A(G) for any complex symmetric matrix A as either polynomial-time computable or #P-hard, with tractable cases exactly the… | ||
| Dichotomy Theorems for Counting Problems II | Counting Complexity and Phase Transitions Boot Camp | 2016-01-26 |
Dichotomy: every counting CSP over a fixed finite language is either computable in polynomial time or #P-hard. The easy side is exactly those languages… | ||
| nothing matches | ||