### 8 papers:

- STOC-2011-KawarabayashiW #algorithm #composition #graph #proving
- A simpler algorithm and shorter proof for the graph minor decomposition (KiK, PW), pp. 451–458.
- CHI-2011-HuotCD #named
- TorusDesktop: pointing via the backdoor is sometimes shorter (SH, OC, PD), pp. 829–838.
- STOC-2010-KawarabayashiW #algorithm #graph #proving #theorem
- A shorter proof of the graph minor algorithm: the unique linkage theorem (KiK, PW), pp. 687–694.
- DLT-2008-GruberH #automaton #finite #regular expression
- Provably Shorter Regular Expressions from Deterministic Finite Automata (HG, MH), pp. 383–395.
- DATE-2006-OgrasMLC #architecture #communication #optimisation
- Communication architecture optimization: making the shortest path shorter in regular networks-on-chip (ÜYO, RM, HGL, NC), pp. 712–717.
- CIAA-2005-HanW #automaton #finite #regular expression
- Shorter Regular Expressions from Finite-State Automata (YSH, DW), pp. 141–152.
- STOC-2004-Ben-SassonGHSV #proximity #robust
- Robust pcps of proximity, shorter pcps and applications to coding (EBS, OG, PH, MS, SPV), pp. 1–10.
- DATE-1999-Junkkari #challenge #complexity #design #development #testing
- Higher Product Complexity and Shorter Development Time — Continuous Challenge to Design and Test Environment (JJ), pp. 2–3.