35 papers:
- MSR-2015-SlagWB #stack overflow #why
- One-Day Flies on StackOverflow — Why the Vast Majority of StackOverflow Users Only Posts Once (RS, MdW, AB), pp. 458–461.
- ICALP-v1-2015-GoldreichGR #branch #context-free grammar #proving #proximity #source code
- Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs — (Extended Abstract) (OG, TG, RDR), pp. 666–677.
- SPLC-2015-CordyDGGH #product line #specification
- All-at-once-synthesis of controllers from scenario-based product line specifications (MC, JMD, JG, EG, PH), pp. 26–35.
- DATE-2014-LiM #memory management
- Write-once-memory-code phase change memory (JL, KM), pp. 1–6.
- STOC-2014-ForbesSS #algebra #branch #multi #order #set #source code
- Hitting sets for multilinear read-once algebraic branching programs, in any order (MAF, RS, AS), pp. 867–875.
- CHI-2014-HornbaekSBS #human-computer #interactive
- Is once enough?: on the extent and content of replications in human-computer interaction (KH, SSS, JABA, JGS), pp. 3523–3532.
- CHI-2012-LucaHBLH #authentication #exclamation
- Touch me once and i know it’s you!: implicit authentication based on touch screen patterns (ADL, AH, FB, CL, HH), pp. 987–996.
- IDGD-2011-ZhangM #trust
- Once Broken, Never Fixed? The Impact of Culture and Medium on Repairing Trust in CMC (QZ, NM), pp. 341–350.
- ICMT-2011-CuadradoGL #model transformation #reuse
- Generic Model Transformations: Write Once, Reuse Everywhere (JSC, EG, JdL), pp. 62–77.
- CGO-2011-NuzmanDRRWYCZ
- Vapor SIMD: Auto-vectorize once, run everywhere (DN, SD, ER, IR, KW, DY, AC, AZ), pp. 151–160.
- VLDB-2010-SenDG #database #evaluation #probability #query
- Read-Once Functions and Query Evaluation in Probabilistic Databases (PS, AD, LG), pp. 1068–1079.
- CHI-2009-HongC #using
- Annotate once, appear anywhere: collective foraging for snippets of interest using paragraph fingerprinting (LH, EHC), pp. 1791–1794.
- STOC-2008-ShpilkaV #polynomial #testing
- Read-once polynomial identity testing (AS, IV), pp. 507–516.
- ICALP-2007-MoranNS #independence #information management
- Deterministic History-Independent Strategies for Storing Information on Write-Once Memories (TM, MN, GS), pp. 303–315.
- ITiCSE-2006-VilnerZ #difference #gender
- Once she makes it, she is there: gender differences in computer science study (TV, EZ), pp. 227–231.
- EDOC-2004-GorpJG #case study #performance
- Write Once, Deploy N: A Performance Oriented MDA Case Study (PVG, DJ, TG), pp. 123–134.
- ICEIS-v1-2003-WangH #database #scalability
- Scanning a Large Database Once to Mine Association Rules (FW, NH), pp. 421–429.
- SAT-2003-BuningZ
- Read-Once Unit Resolution (HKB, XZ), pp. 356–369.
- VLDB-2002-ShegalovWBL #middleware #named
- EOS: Exactly-Once E-Service Middleware (GS, GW, RSB, DBL), pp. 1043–1046.
- ITiCSE-2002-DagdilelisSE #behaviour #what
- What they really do?: attempting (once again) to model novice programmers’ behavior (VD, MS, GE), p. 244.
- DAC-2001-GolumbicMR #recognition #using
- Factoring and Recognition of Read-Once Functions using Cographs and Normality (MCG, AM, UR), pp. 109–114.
- STOC-2001-BolligW #bound #branch #integer #multi #using
- A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal (BB, PW), pp. 419–424.
- IJCAR-2001-Szeider
- NP-Completeness of Refutability by Literal-Once Resolution (SS), pp. 168–181.
- POPL-1999-WansbroughJ #polymorphism
- Once Upon a Polymorphic Type (KW, SLPJ), pp. 15–28.
- STOC-1997-RazborovWY #branch #calculus #proving #source code
- Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus (AAR, AW, ACCY), pp. 739–748.
- ICALP-1997-Ablayev #branch #nondeterminism #order #source code
- Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs (FMA), pp. 195–202.
- STOC-1995-Ponzio #bound #branch #integer #multi #source code
- A lower bound for integer multiplication with read-once branching programs (SP), pp. 130–139.
- FPCA-1995-TurnerWM
- Once Upon a Type (DNT, PW, CM), pp. 1–11.
- LICS-1995-KupfermanP
- Once and For All (OK, AP), pp. 25–35.
- WSA-1993-BruynoogheC #correctness
- Freeness, Sharing, Linearity and Correctness — All at Once (MB, MC), pp. 153–164.
- STOC-1992-BshoutyHH #learning
- Learning Arithmetic Read-Once Formulas (NHB, TRH, LH), pp. 370–381.
- SOSP-1987-FinlaysonC
- Log Files: An Extended File Service Exploiting Write-Once Storage (RSF, DRC), pp. 139–148.
- STOC-1984-DolevMMU #fault #memory management
- Correcting Faults in Write-Once Memory (DD, DM, HGM, JDU), pp. 225–229.
- PODS-1982-Maier #database #memory management #using
- Using Write-once Memory for Database Storage (DM), pp. 239–246.
- STOC-1982-RivestS #how #memory management #reuse
- How to Reuse a “Write-Once” Memory (Preliminary Version) (RLR, AS), pp. 105–113.