## Stem imposs$ (all stems)

### 22 papers:

- CSL-2015-Williams
- Thinking Algorithmically About Impossibility (Invited Talk) (RRW), pp. 14–23.
- VLDB-2014-FanWWD #distributed #graph #simulation
- Distributed Graph Simulation: Impossibility and Possibility (WF, XW, YW, DD), pp. 1083–1094.
- STOC-2013-BitanskyP #approximate #encryption #obfuscation #on the
- On the impossibility of approximate obfuscation and applications to resettable cryptography (NB, OP), pp. 241–250.
- ICEIS-J-2013-Heusinger13a #design #on the #research
- On the “Impossibility” of Critical and Emancipatory Design Science Research (JMH), pp. 331–348.
- STOC-2011-Dobzinski #combinator
- An impossibility result for truthful combinatorial auctions with submodular valuations (SD), pp. 139–148.
- ICALP-A-2008-RegevS #quantum
- Impossibility of a Quantum Speed-Up with a Faulty Oracle (OR, LS), pp. 773–781.
- LICS-2008-ChenF #axiom #equivalence #on the
- On the Axiomatizability of Impossible Futures: Preorder versus Equivalence (TC, WF), pp. 156–165.
- STOC-2007-Lynch #algorithm #distributed #modelling #proving
- Distributed computing theory: algorithms, impossibility results, models, and proofs (NAL), p. 247.
- STOC-2007-MooreRS #algorithm #graph #morphism #on the #quantum
- On the impossibility of a quantum sieve algorithm for graph isomorphism (CM, AR, PS), pp. 536–545.
- ICALP-v2-2006-DodisR #on the #quantum #using
- On the Impossibility of Extracting Classical Randomness Using a Quantum Computer (YD, RR), pp. 204–215.
- RE-2006-Graham #question #requirements #testing
- Testing to Improve Requirements — Mission Impossible? (DG), p. 3.
- STOC-2005-GafniGP #adaptation #bound #complexity #set
- From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement (EG, RG, BP), pp. 714–722.
- DAC-2002-SmithNMCFKMB #embedded #question #tool support
- Unified tools for SoC embedded systems: mission critical, mission impossible or mission irrelevant? (GS, DN, SM, RC, JF, KK, GM, BB), p. 479.
- DATE-2002-Hsiao #fault #identification
- Maximizing Impossibilities for Untestable Fault Identification (MSH), pp. 949–953.
- STOC-1995-FeigeK #proving #random
- Impossibility results for recycling random bits in two-prover proof systems (UF, JK), pp. 457–468.
- STOC-1993-BorowskyG
- Generalized FLP impossibility result for t-resilient asynchronous computations (EB, EG), pp. 91–100.
- STOC-1993-SaksZ
- Wait-free k-set agreement is impossible: the topology of public knowledge (MES, FZ), pp. 101–110.
- CADE-1992-Wos #automation #logic #reasoning
- The Impossibility of the Automation of Logical Reasoning (LW), pp. 1–3.
- ESEC-1989-Thomas #state of the art
- Asking for the Impossible: The State of the Art in Safety-Related Systems (MT), pp. 42–47.
- STOC-1984-DolevHS #on the
- On the Possibility and Impossibility of Achieving Clock Synchronization (DD, JYH, HRS), pp. 504–511.
- PODS-1983-FischerLP #distributed #process
- Impossibility of Distributed Consensus with One Faulty Process (MJF, NAL, MP), pp. 1–7.
- POPL-1977-Clarke #axiom #hoare #programming language
- Programming Language Constructs for Which it is Impossible to Obtain “Good” Hoare-Like Axiom Systems (EMC), pp. 10–20.