## Stem delet$ (all stems)

### 50 papers:

- DLT-2014-HanKS #complexity
- State Complexity of Deletion (YSH, SKK, KS), pp. 37–48.
- ICEIS-v1-2014-PinheiroCML #algorithm #graph
- An Evolutionary Algorithm for Graph Planarisation by Vertex Deletion (RLP, AAC, CFXdM, DLS), pp. 464–471.
- ECIR-2014-YangPSS #case study #e-commerce #query #scalability #using
- A Study of Query Term Deletion Using Large-Scale E-commerce Search Logs (BY, NP, GS, NS), pp. 235–246.
- KDIR-2014-Nakano #induction #string
- Emergent Induction of L-system Grammar from a String with Deletion-type Transmutation (RN), pp. 397–402.
- ISMM-2014-Joisha #performance #scalability
- Sticky tries: fast insertions, fast lookups, no deletions for large key universes (PGJ), pp. 35–46.
- ICST-2014-DelamaroOA #design
- Designing Deletion Mutation Operators (MED, JO, PA), pp. 11–20.
- VLDB-2013-KimelfeldVW #approximate #complexity #multi
- Multi-Tuple Deletion Propagation: Approximations and Complexity (BK, JV, DPW), pp. 1558–1569.
- STOC-2013-Bernstein #graph #maintenance
- Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract] (AB), pp. 725–734.
- CIAA-J-2012-KutribO13 #automaton #complexity #on the
- On the Descriptional Complexity of the Window Size for Deleting Restarting Automata (MK, FO), pp. 831–846.
- CSCW-2013-AlmuhimediWLSA #analysis #scalability #twitter
- Tweets are forever: a large-scale quantitative analysis of deleted tweets (HA, SW, BL, NMS, AA), pp. 897–908.
- CSCW-2013-SchneiderSPD #ad hoc #experience #how #online
- Arguments about deletion: how experience improves the acceptability of arguments in ad-hoc online task groups (JS, KS, AP, SD), pp. 1069–1080.
- ICST-2013-DengOL #empirical #evaluation
- Empirical Evaluation of the Statement Deletion Mutation Operator (LD, JO, NL), pp. 84–93.
- PODS-2012-Kimelfeld #complexity #dependence #functional
- A dichotomy in the complexity of deletion propagation with functional dependencies (BK), pp. 191–202.
- PODS-2011-KimelfeldVW
- Maximizing conjunctive views in deletion propagation (BK, JV, RW), pp. 187–198.
- DLT-J-2010-KariS11 #parallel #revisited
- Schema for Parallel Insertion and Deletion: Revisited (LK, SS), pp. 1655–1668.
- DLT-2010-KariS #parallel
- Schema for Parallel Insertion and Deletion (LK, SS), pp. 267–278.
- LATA-2010-Zantema #complexity
- Complexity of Guided Insertion-Deletion in RNA-Editing (HZ), pp. 608–619.
- ICGT-2010-BisztrayH #termination
- Combining Termination Criteria by Isolating Deletion (DB, RH), pp. 203–217.
- SAC-2010-AveiroST #enterprise #generative #modelling #towards
- Towards a GOD-theory for organizational engineering: continuously modeling the continuous (re)generation, operation and deletion of the enterprise (DA, ARS, JMT), pp. 150–157.
- SAC-2009-KahvedzicK #data type #on the #persistent
- On the persistence of deleted windows registry data structures (DK, MTK), pp. 895–896.
- LATA-2008-KrassovitskiyRV
- Further Results on Insertion-Deletion Systems with One-Sided Contexts (AK, YR, SV), pp. 333–344.
- SAC-2008-BuenoTT #algorithm #data access #effectiveness #metric #optimisation
- An algorithm for effective deletion and a new optimization technique for metric access methods (RB, AJMT, CTJ), pp. 1034–1035.
- SAC-2008-LeeHCHS #file system
- Secure deletion for NAND flash file system (JL, JH, YC, JH, SYS), pp. 1710–1714.
- VLDB-2007-BhattacharjeeMLMKBK #clustering #multi #performance
- Efficient Bulk Deletes for Multi Dimensionally Clustered Tables in DB2 (BB, TM, SL, SM, JAK, RVB, JK), pp. 1197–1206.
- ICALP-v1-2006-AlonSS #approximate #problem
- Additive Approximation for Edge-Deletion Problems (Abstract) (NA, AS, BS), pp. 1–2.
- ICALP-v1-2006-KhotP #clique
- Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion (SK, AKP), pp. 226–237.
- ICML-2006-GlobersonR #learning #robust
- Nightmare at test time: robust learning by feature deletion (AG, STR), pp. 353–360.
- STOC-2005-AgarwalCMM #algorithm #approximate #problem
- O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (AA, MC, KM, YM), pp. 573–581.
- ICALP-2005-AlstrupGRTZ #constant
- Union-Find with Constant Time Deletions (SA, ILG, TR, MT, UZ), pp. 78–89.
- DLT-2004-Domaratzki #semantics
- Semantic Shuffle on and Deletion Along Trajectories (MD), pp. 163–174.
- DLT-2003-HofbauerW #string #term rewriting
- Deleting String Rewriting Systems Preserve Regularity (DH, JW), pp. 337–348.
- SIGIR-2003-JonesF #predict #query #word
- Query word deletion prediction (RJ, DCF), pp. 435–436.
- PODS-2002-BunemanKT #on the
- On Propagation of Deletions and Annotations Through Views (PB, SK, WCT), pp. 150–158.
- VLDB-2002-Mohan02a #performance #using
- An Efficient Method for Performing Record Deletions and Updates Using Index Scans (CM), pp. 940–949.
- STOC-2001-ErgunSSS #performance
- Biased dictionaries with fast insert/deletes (FE, SCS, JS, RKS), pp. 483–491.
- DLT-1997-JancarMPPV #automaton
- Deleting Automata with a Restart Operation (PJ, FM, MP, MP, JV), pp. 191–202.
- DLT-1997-MrazPP #automaton
- Deleting Automata with a Restart Operation and Marcus Grammars (FM, MP, MP), pp. 329–342.
- ICALP-1997-Fujito #approach #approximate #problem
- A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties (TF), pp. 749–759.
- ILPS-1997-AravindanB #algorithm #database #performance
- A Rational and Efficient Algorithm for View Deletion in Databases (CA, PB), pp. 165–179.
- ICPR-1996-Chen #detection #parallel
- The use of hidden deletable pixel detection to obtain bias-reduced skeletons in parallel thinning (YSC), pp. 91–95.
- ILPS-1993-WaalG #logic programming
- Logic Program Specialisation With Deletion of Useless Clauses (DAdW, JPG), p. 632.
- LOPSTR-1992-GallagherW #logic programming #source code
- Deletion of Redundant Unary Type Predicates from Logic Programs (JPG, DAdW), pp. 151–167.
- PODS-1989-JohnsonS
- Utilization of B-trees with Inserts, Deletes and Modifies (TJ, DS), pp. 235–246.
- CSL-1988-Schatz
- Delete Operations and Horn Formulas (RS), pp. 329–343.
- PODS-1986-Hadzilacos #transaction
- Deleting Completed Transactions (TH, MY), pp. 43–46.
- SIGMOD-1986-Willard #algorithm #worst-case
- Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files (DEW), pp. 251–260.
- STOC-1982-AsanoH #problem
- Edge-Deletion and Edge-Contraction Problems (TA, TH), pp. 245–254.
- LFP-1982-HudakK #distributed #garbage collection
- Garbage Collection and Task Deletion in Distributed Applicative Processing Systems (PH, RMK), pp. 168–178.
- STOC-1978-Yannakakis #problem
- Node- and Edge-Deletion NP-Complete Problems (MY), pp. 253–264.
- STOC-1971-Berry
- Block Structure: Retention or Deletion? (Extended Abstract) (DMB), pp. 86–100.