7 papers:
LATA-2011-BareckaC #automaton #complexity #finite #problem- The Parameterized Complexity of Chosen Problems for Finite Automata on Trees (AB, WC), pp. 129–141.
TAP-2009-Gladisch #contract #invariant #question- Could We Have Chosen a Better Loop Invariant or Method Contract? (CG), pp. 74–89.
ICALP-2005-Hopper #on the #security- On Steganographic Chosen Covertext Security (NH), pp. 311–323.
ACIR-1998-SmeatonK #information retrieval #interactive #query- User-Chosen Phrases in Interactive Query Formulation for Information Retrieval (AFS, FK).
STOC-1990-NaorY- Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks (MN, MY), pp. 427–437.
SOSP-1989-LomasGSN #risk management- Reducing Risks from Poorly Chosen Keys (TMAL, LG, JHS, RMN), pp. 14–18.
- STOC-1978-Lueker #graph #problem
- Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract) (GSL), pp. 13–18.
