BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
regular (3)
languag (2)
algorithm (2)
approxim (2)
formula (2)

Stem smallest$ (all stems)

11 papers:

LATALATA-2010-CarrascosaCGL #problem #word
Choosing Word Occurrences for the Smallest Grammar Problem (RC, FC, MG, GGIL), pp. 154–165.
STOCSTOC-2009-Trevisan
Max cut and the smallest eigenvalue (LT), pp. 263–272.
ICALPICALP-v1-2006-VassilevskaWY #graph #problem
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems (VV, RW, RY), pp. 262–273.
SIGMODSIGMOD-2005-XuP #database #keyword #performance #xml
Efficient Keyword Search for Smallest LCAs in XML Databases (YX, YP), pp. 537–538.
ICSTSAT-2005-MneimnehLASS #algorithm #bound #satisfiability
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas (MNM, IL, ZSA, JPMS, KAS), pp. 467–474.
CIAACIAA-2004-DelgadoM #approximate #regular expression
Approximation to the Smallest Regular Expression for a Given Regular Language (MD, JM), pp. 312–314.
STOCSTOC-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.
ICLPCL-2000-MoinardR #finite #set
Smallest Equivalent Sets for Finite Propositional Formula Circumscription (YM, RR), pp. 897–911.
ICALPICALP-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.
ICMLML-1991-Nedellec
A Smallest Generalization Step Strategy (CN), pp. 529–533.
ASPLOSASPLOS-1987-Massalin #named
Superoptimizer — A Look at the Smallest Program (HM), pp. 122–126.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.