11 papers:
LATA-2010-CarrascosaCGL #problem #word- Choosing Word Occurrences for the Smallest Grammar Problem (RC, FC, MG, GGIL), pp. 154–165.
STOC-2009-Trevisan- Max cut and the smallest eigenvalue (LT), pp. 263–272.
ICALP-v1-2006-VassilevskaWY #graph #problem- Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems (VV, RW, RY), pp. 262–273.
SIGMOD-2005-XuP #database #keyword #performance #xml- Efficient Keyword Search for Smallest LCAs in XML Databases (YX, YP), pp. 537–538.
SAT-2005-MneimnehLASS #algorithm #bound #satisfiability- A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas (MNM, IL, ZSA, JPMS, KAS), pp. 467–474.
CIAA-2004-DelgadoM #approximate #regular expression- Approximation to the Smallest Regular Expression for a Given Regular Language (MD, JM), pp. 312–314.
- STOC-2002-CharikarLLPPRSS #approximate #complexity #modelling
- Approximating the smallest grammar: Kolmogorov complexity in natural models (MC, EL, DL, RP, MP, AR, AS, AS), pp. 792–801.
CL-2000-MoinardR #finite #set- Smallest Equivalent Sets for Finite Propositional Formula Circumscription (YM, RR), pp. 897–911.
- ICALP-1991-Hashiguchi #algorithm #generative #regular expression
- Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language (KH), pp. 641–648.
ML-1991-Nedellec- A Smallest Generalization Step Strategy (CN), pp. 529–533.
ASPLOS-1987-Massalin #named- Superoptimizer — A Look at the Smallest Program (HM), pp. 122–126.
