7 papers:
GaM-2015-KissingerZ #exclamation- !-graphs with trivial overlap are context-free (AK, VZ), pp. 16–31.
ICSE-v1-2015-PapadakisJHT #compilation #detection #effectiveness #empirical #equivalence #performance #scalability- Trivial Compiler Equivalence: A Large Scale Empirical Study of a Simple, Fast and Effective Equivalent Mutant Detection Technique (MP, YJ, MH, YLT), pp. 936–946.
FoSSaCS-2011-Kobayashi #algorithm #automaton #higher-order #linear #model checking #recursion- A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes (NK0), pp. 260–274.
PEPM-2000-Taha #formal method #ml #multi #reduction #semantics- A Sound Reduction Semantics for Untyped CBN Multi-stage Computation. Or, the Theory of MetaML is Non-trivial (Extended Abstract) (WT), pp. 34–43.
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.
WLC-2000-Carton #word- R-Trivial Languages of Words on Countable Ordinals (OC), pp. 88–102.
LICS-1989-Pitts #polymorphism #type system- Non-trivial Power Types Can’t Be Subtypes of Polymorphic Types (AMP), pp. 6–13.
