21 papers:
CHI-2014-LohseRPKE #gesture #performance- Robot gestures make difficult tasks easier: the impact of gestures on perceived workload and task performance (ML, RR, JGP, DEK, VE), pp. 1459–1466.
DAC-2012-LiANSVZ #design #physics #predict- Guiding a physical design closure system to produce easier-to-route designs with more predictable timing (ZL, CJA, GJN, CCNS, NV, NYZ), pp. 465–470.
ICPC-2012-FeigenspanBR #question- Is the derivation of a model easier to understand than the model itself? (JF, DSB, TLR), pp. 47–52.
ITiCSE-2011-Mirolo #recursion- Is iteration really easier to master than recursion: an investigation in a functional-first CS1 context (CM), p. 362.
LATA-2011-KowalukLL- Unique Small Subgraphs Are Not Easier to Find (MK, AL, EML), pp. 336–341.
DUXU-v2-2011-MasipOG #classification #component #evaluation #heuristic #interactive- Classification of Interactive System Components Enables Planning Heuristic Evaluation Easier (LM, MO, TG), pp. 478–486.
PPoPP-2010-RossbachHW #programming #question #transaction- Is transactional programming actually easier? (CJR, OSH, EW), pp. 47–56.
CIKM-2009-ZhangJZZ #bidirectional #detection- Exploiting bidirectional links: making spamming detection easier (YZ, QJ, LZ, YZ), pp. 1839–1842.
OOPSLA-2006-FairbanksGS #design #framework #using- Design fragments make using frameworks easier (GF, DG, WLS), pp. 75–88.
- CHI-2005-GarfinkelMSNM #email #how
- How to make secure email easier to use (SLG, DM, JIS, EN, RCM), pp. 701–710.
ICPR-v2-2002-Torkkola02a #feature model #learning #problem- Learning Feature Transforms Is an Easier Problem Than Feature Selection (KT), pp. 104–107.
VLDB-2000-GrumbachRS- Manipulating Interpolated Data is Easier than You Thought (SG, PR, LS), pp. 156–165.
ICALP-2000-FournierK #bound- Lower Bounds Are Not Easier over the Reals: Inside PH (HF, PK), pp. 832–843.
CSMR-1999-PonsignonMAM #maintenance #multi #re-engineering- Reengineering of Multitasking Applications for Easier Maintenance (JFP, MM, RA, YM), pp. 182–185.
STOC-1998-FournierK #bound #question- Are Lower Bounds Easier over the Reals? (HF, PK), pp. 507–513.
- STOC-1998-KargerL #graph
- Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching (DRK, MSL), pp. 69–78.
- CHI-1997-WordenWBH
- Making Computers Easier for Older Adults to Use: Area Cursors and Sticky Icons (AW, NW, KB, SEH), pp. 266–271.
- STOC-1996-Naor #evaluation #generative
- Evaluation May Be Easier Than Generation (Extended Abstract) (MN), pp. 74–83.
PODS-1992-AbiteboulCV #query- Queries Are Easier Than You Thought (Probably) (SA, KJC, VV), pp. 23–32.
- STOC-1984-Chazelle #sorting
- Intersecting Is Easier than Sorting (BC), pp. 125–134.
- STOC-1980-ChazelleD #detection
- Detection is Easier than Computation (Extended Abstract) (BC, DPD), pp. 146–153.
