### 19 papers:

- SIGMOD-2015-GuptaATKPSS
- Amazon Redshift and the Case for Simpler Data Warehouses (AG, DA, DT, JK, RP, SS, VS), pp. 1917–1923.
- PLDI-2015-LuciaR #execution #programming
- A simpler, safer programming and execution model for intermittent systems (BL, BR), pp. 575–585.
- VLDB-2014-YuLZCP13 #effectiveness
- More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks (WY, XL, WZ, LC, JP), pp. 13–24.
- ICALP-v1-2013-ChanLNS
- New Doubling Spanners: Better and Simpler (THHC, ML, LN, SS), pp. 315–327.
- MSR-2011-PosnettHD #readability
- A simpler model of software readability (DP, AH, PTD), pp. 73–82.
- STOC-2011-KawarabayashiW #algorithm #composition #graph #proving
- A simpler algorithm and shorter proof for the graph minor decomposition (KiK, PW), pp. 451–458.
- ICML-2011-LiP #clustering #exclamation
- Time Series Clustering: Complex is Simpler! (LL, BAP), pp. 185–192.
- ICML-2009-NeumannMP #learning
- Learning complex motions by sequencing simpler motion templates (GN, WM, JP), pp. 753–760.
- ICML-2009-Sutskever #analysis
- A simpler unified analysis of budget perceptrons (IS), pp. 985–992.
- ICALP-A-2008-TedderCHP #composition #linear #permutation #recursion
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations (MT, DGC, MH, CP), pp. 634–645.
- ICML-2007-TsangKK
- Simpler core vector machines with enclosing balls (IWT, AK, JTK), pp. 911–918.
- PODS-2006-LeeT #performance
- A simpler and more efficient deterministic scheme for finding frequent items over sliding windows (LKL, HFT), pp. 290–297.
- STOC-2006-Gurvits #algorithm #approach #bound #proving
- Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications (LG), pp. 417–426.
- ICML-2006-LeSG #knowledge-based
- Simpler knowledge-based support vector machines (QVL, AJS, TG), pp. 521–528.
- FoSSaCS-2005-Cheney #logic #proving
- A Simpler Proof Theory for Nominal Logic (JC), pp. 379–394.
- STOC-2003-GuptaKR #algorithm #approximate #design #network
- Simpler and better approximation algorithms for network design (AG, AK, TR), pp. 365–372.
- ESOP-1999-MoggiTBS #ml
- An Idealized MetaML: Simpler, and More Expressive (EM, WT, ZEAB, TS), pp. 193–207.
- ICALP-1998-Hagerup #performance #ram
- Simpler and Faster Dictionaries on the AC0 RAM (TH), pp. 79–90.
- KDD-1996-CherkauerS #information management
- Growing Simpler Decision Trees to Facilitate Knowledge Discovery (KJC, JWS), pp. 315–318.