9 papers:
ICSME-2014-PotdarS #case study #self #technical debt- An Exploratory Study on Self-Admitted Technical Debt (AP, ES), pp. 91–100.
STOC-2007-PeikertR #worst-case- Lattices that admit logarithmic worst-case to average-case connection factors (CP, AR), pp. 478–487.
LICS-2007-Escardo #infinity #performance #set- Infinite sets that admit fast exhaustive search (MHE), pp. 443–452.
SOFTVIS-2003-Eichelberger #design #diagrams #question- Nice Class Diagrams Admit Good Design? (HE), pp. 159–167.
FoSSaCS-2002-Kurz #logic #semantics- Logics Admitting Final Semantics (AK), pp. 238–249.
KDD-2002-SequeiraZ #data mining #mining #named- ADMIT: anomaly-based data mining for intrusions (KS, MJZ), pp. 386–395.
ICALP-2000-Hastad #algorithm #approximate #np-hard #optimisation #performance #problem #question- Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? (JH), p. 235.
RTA-1991-Socher-Ambrosius #algebra #convergence #term rewriting- Boolean Algebra Admits No Convergent Term Rewriting System (RSA), pp. 264–274.
STOC-1980-Tompa80a #algorithm #implementation #polynomial #sublinear #transitive- Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations (MT), pp. 333–338.