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:
insert (8)
oper (6)
algorithm (5)
complex (5)
problem (5)

Stem delet$ (all stems)

50 papers:

DLTDLT-2014-HanKS #complexity
State Complexity of Deletion (YSH, SKK, KS), pp. 37–48.
ICEISICEIS-v1-2014-PinheiroCML #algorithm #graph
An Evolutionary Algorithm for Graph Planarisation by Vertex Deletion (RLP, AAC, CFXdM, DLS), pp. 464–471.
ECIRECIR-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.
KDIRKDIR-2014-Nakano #induction #string
Emergent Induction of L-system Grammar from a String with Deletion-type Transmutation (RN), pp. 397–402.
ISMMISMM-2014-Joisha #performance #scalability
Sticky tries: fast insertions, fast lookups, no deletions for large key universes (PGJ), pp. 35–46.
ICSTICST-2014-DelamaroOA #design
Designing Deletion Mutation Operators (MED, JO, PA), pp. 11–20.
VLDBVLDB-2013-KimelfeldVW #approximate #complexity #multi
Multi-Tuple Deletion Propagation: Approximations and Complexity (BK, JV, DPW), pp. 1558–1569.
STOCSTOC-2013-Bernstein #graph #maintenance
Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract] (AB), pp. 725–734.
CIAACIAA-J-2012-KutribO13 #automaton #complexity #on the
On the Descriptional Complexity of the Window Size for Deleting Restarting Automata (MK, FO), pp. 831–846.
CSCWCSCW-2013-AlmuhimediWLSA #analysis #scalability #twitter
Tweets are forever: a large-scale quantitative analysis of deleted tweets (HA, SW, BL, NMS, AA), pp. 897–908.
CSCWCSCW-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.
ICSTICST-2013-DengOL #empirical #evaluation
Empirical Evaluation of the Statement Deletion Mutation Operator (LD, JO, NL), pp. 84–93.
PODSPODS-2012-Kimelfeld #complexity #dependence #functional
A dichotomy in the complexity of deletion propagation with functional dependencies (BK), pp. 191–202.
PODSPODS-2011-KimelfeldVW
Maximizing conjunctive views in deletion propagation (BK, JV, RW), pp. 187–198.
DLTDLT-J-2010-KariS11 #parallel #revisited
Schema for Parallel Insertion and Deletion: Revisited (LK, SS), pp. 1655–1668.
DLTDLT-2010-KariS #parallel
Schema for Parallel Insertion and Deletion (LK, SS), pp. 267–278.
LATALATA-2010-Zantema #complexity
Complexity of Guided Insertion-Deletion in RNA-Editing (HZ), pp. 608–619.
ICGTICGT-2010-BisztrayH #termination
Combining Termination Criteria by Isolating Deletion (DB, RH), pp. 203–217.
SACSAC-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.
SACSAC-2009-KahvedzicK #data type #on the #persistent
On the persistence of deleted windows registry data structures (DK, MTK), pp. 895–896.
LATALATA-2008-KrassovitskiyRV
Further Results on Insertion-Deletion Systems with One-Sided Contexts (AK, YR, SV), pp. 333–344.
SACSAC-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.
SACSAC-2008-LeeHCHS #file system
Secure deletion for NAND flash file system (JL, JH, YC, JH, SYS), pp. 1710–1714.
VLDBVLDB-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.
ICALPICALP-v1-2006-AlonSS #approximate #problem
Additive Approximation for Edge-Deletion Problems (Abstract) (NA, AS, BS), pp. 1–2.
ICALPICALP-v1-2006-KhotP #clique
Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion (SK, AKP), pp. 226–237.
ICMLICML-2006-GlobersonR #learning #robust
Nightmare at test time: robust learning by feature deletion (AG, STR), pp. 353–360.
STOCSTOC-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.
ICALPICALP-2005-AlstrupGRTZ #constant
Union-Find with Constant Time Deletions (SA, ILG, TR, MT, UZ), pp. 78–89.
DLTDLT-2004-Domaratzki #semantics
Semantic Shuffle on and Deletion Along Trajectories (MD), pp. 163–174.
DLTDLT-2003-HofbauerW #string #term rewriting
Deleting String Rewriting Systems Preserve Regularity (DH, JW), pp. 337–348.
SIGIRSIGIR-2003-JonesF #predict #query #word
Query word deletion prediction (RJ, DCF), pp. 435–436.
PODSPODS-2002-BunemanKT #on the
On Propagation of Deletions and Annotations Through Views (PB, SK, WCT), pp. 150–158.
VLDBVLDB-2002-Mohan02a #performance #using
An Efficient Method for Performing Record Deletions and Updates Using Index Scans (CM), pp. 940–949.
STOCSTOC-2001-ErgunSSS #performance
Biased dictionaries with fast insert/deletes (FE, SCS, JS, RKS), pp. 483–491.
DLTDLT-1997-JancarMPPV #automaton
Deleting Automata with a Restart Operation (PJ, FM, MP, MP, JV), pp. 191–202.
DLTDLT-1997-MrazPP #automaton
Deleting Automata with a Restart Operation and Marcus Grammars (FM, MP, MP), pp. 329–342.
ICALPICALP-1997-Fujito #approach #approximate #problem
A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties (TF), pp. 749–759.
ICLPILPS-1997-AravindanB #algorithm #database #performance
A Rational and Efficient Algorithm for View Deletion in Databases (CA, PB), pp. 165–179.
ICPRICPR-1996-Chen #detection #parallel
The use of hidden deletable pixel detection to obtain bias-reduced skeletons in parallel thinning (YSC), pp. 91–95.
ICLPILPS-1993-WaalG #logic programming
Logic Program Specialisation With Deletion of Useless Clauses (DAdW, JPG), p. 632.
LOPSTRLOPSTR-1992-GallagherW #logic programming #source code
Deletion of Redundant Unary Type Predicates from Logic Programs (JPG, DAdW), pp. 151–167.
PODSPODS-1989-JohnsonS
Utilization of B-trees with Inserts, Deletes and Modifies (TJ, DS), pp. 235–246.
CSLCSL-1988-Schatz
Delete Operations and Horn Formulas (RS), pp. 329–343.
PODSPODS-1986-Hadzilacos #transaction
Deleting Completed Transactions (TH, MY), pp. 43–46.
SIGMODSIGMOD-1986-Willard #algorithm #worst-case
Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files (DEW), pp. 251–260.
STOCSTOC-1982-AsanoH #problem
Edge-Deletion and Edge-Contraction Problems (TA, TH), pp. 245–254.
LISPLFP-1982-HudakK #distributed #garbage collection
Garbage Collection and Task Deletion in Distributed Applicative Processing Systems (PH, RMK), pp. 168–178.
STOCSTOC-1978-Yannakakis #problem
Node- and Edge-Deletion NP-Complete Problems (MY), pp. 253–264.
STOCSTOC-1971-Berry
Block Structure: Retention or Deletion? (Extended Abstract) (DMB), pp. 86–100.

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.