9 papers:
ICALP-v1-2012-LaplanteLR #bound #detection #quantum- Classical and Quantum Partition Bound and Detector Inefficiency (SL, VL, JR), pp. 617–628.
CGO-2012-ChabbiM #named- DeadSpy: a tool to pinpoint program inefficiencies (MC, JMMC), pp. 124–134.
ECOOP-2011-ChisMSSOPM #memory management- Patterns of Memory Inefficiency (AEC, NM, ES, GS, PO, TP, JM), pp. 383–407.
PLDI-2010-XuR #detection- Detecting inefficiently-used containers to avoid bloat (G(X, AR), pp. 160–173.
ICFP-2010-BradyH #domain-specific language #implementation #partial evaluation #using- Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation (EB, KH), pp. 297–308.
OOPSLA-2008-KawachiyaOO #analysis #java #memory management #reduction #string- Analysis and reduction of memory inefficiencies in Java strings (KK, KO, TO), pp. 385–402.
- CGO-2003-MaratheMMSMY #memory management #metric #named
- METRIC: Tracking Down Inefficiencies in the Memory Hierarchy via Binary Rewriting (JM, FM, TM, BRdS, SAM, AY), pp. 289–300.
- ICFP-1996-LawallM #cost analysis #question #what #λ-calculus
- Optimality and Inefficiency: What Isn’t a Cost Model of the λ Calculus? (JLL, HGM), pp. 92–101.
STOC-1973-WeinerSB #algorithm- Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient (PW, SLS, AB), pp. 207–213.
