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:
use (21)
base (18)
algorithm (15)
tree (14)
merg (13)

Stem split$ (all stems)

151 papers:

CASECASE-2015-HandokoL #order #performance #privacy
Efficient order sharing with privacy preservation via double auction with split delivery (SDH, HCL), pp. 69–74.
DocEngDocEng-2015-FranzeMW #documentation #navigation #question
Does a Split-View Aid Navigation Within Academic Documents? (JF, KM, MW), pp. 211–214.
CHICHI-2015-HongHIL #named
SplitBoard: A Simple Split Soft Keyboard for Wristwatch-sized Touch Screens (JH, SH, PI, GL), pp. 1233–1236.
HCIDUXU-IXD-2015-LeeLK #case study #navigation
A Study on a Split-View Navigation System (JSL, HL, SWK), pp. 485–495.
SIGIRSIGIR-2015-LipaniLH #anti #bias #precise
Splitting Water: Precision and Anti-Precision to Reduce Pool Bias (AL, ML, AH), pp. 103–112.
SOSPSOSP-2015-YangHAKKAKAA #scheduling
Split-level I/O scheduling (SY, TH, NA, SSK, AK, SAK, RTK, ACAD, RHAD), pp. 474–489.
DACDAC-2014-VaidyanathanDP #detection #reliability #stack #using
Detecting Reliability Attacks during Split Fabrication using Test-only BEOL Stack (KV, BPD, LP), p. 6.
VLDBVLDB-2014-GankidiTPHD
Indexing HDFS Data in PDW: Splitting the data from the index (VRG, NT, JMP, AH, DJD), pp. 1520–1528.
FASEFASE-2014-StruberRTC #crawling #information retrieval #modelling #using
Splitting Models Using Information Retrieval and Model Crawling Techniques (DS, JR, GT, MC), pp. 47–62.
HCILCT-TRE-2014-OzcelikCSTU #education
The Effect of Split Attention in Surgical Education (, NEÇ, GS, ET, BU), pp. 3–10.
ICPRICPR-2014-GognaSM #matrix #using
Matrix Recovery Using Split Bregman (AG, AS, AM), pp. 1031–1036.
SACSAC-2014-CruzMOV
Workload-aware table splitting for NoSQL (FC, FM, RO, RV), pp. 399–404.
SACSAC-2014-ZhengBM #empirical #recommendation
Splitting approaches for context-aware recommendation: an empirical study (YZ, RDB, BM), pp. 274–279.
CASECASE-2013-YeWZML #approach #network #optimisation #predict #scalability
A signal split optimization approach based on model predictive control for large-scale urban traffic networks (BLY, WW, XZ, WJM, JL), pp. 904–909.
DATEDATE-2013-RajendranSK #question
Is split manufacturing secure? (JR, OS, RK), pp. 1259–1264.
DocEngDocEng-2013-BilaucaH
Splitting wide tables optimally (MB, PH), pp. 249–252.
SIGMODSIGMOD-2013-DeWittHNSAAFG #query
Split query processing in polybase (DJD, AH, RVN, SS, JAS, AA, MF, JG), pp. 1255–1266.
KDDKDD-2013-TabeiKKY #constraints #scalability #similarity
Succinct interval-splitting tree for scalable similarity search of compound-protein pairs with property constraints (YT, AK, MK, YY), pp. 176–184.
CADECADE-2013-HoderV
The 481 Ways to Split a Clause and Deal with Propositional Variables (KH, AV), pp. 450–464.
CAVCAV-2013-JegourelLS #model checking #statistics
Importance Splitting for Statistical Model Checking Rare Properties (CJ, AL, SS), pp. 576–591.
DATEDATE-2012-KwongG #architecture #constant #geometry #performance
A high performance split-radix FFT with constant geometry architecture (JK, MG), pp. 1537–1542.
HTHT-2012-FahlHMS #named #network #social
TrustSplit: usable confidentiality for social network messaging (SF, MH, TM, MS), pp. 145–154.
ICSMEICSM-2012-CorazzaMM #approach #identifier #named #performance
LINSEN: An efficient approach to split identifiers and expand abbreviations (AC, SDM, VM), pp. 233–242.
WCREWCRE-2012-GuerroujGGAP #algorithm #identifier #named #performance
TRIS: A Fast and Accurate Identifiers Splitting and Expansion Algorithm (LG, PG, YGG, GA, MDP), pp. 103–112.
STOCSTOC-2012-CebrianCVV #contract #robust
Finding red balloons with split contracts: robustness to individuals’ selfishness (MC, LC, AV, PV), pp. 775–788.
CIKMCIKM-2012-ChengZPW #clustering
Hierarchical co-clustering based on entropy splitting (WC, XZ, FP, WW), pp. 1472–1476.
ICMLICML-2012-WangC12a #clustering
Clustering to Maximize the Ratio of Split to Diameter (JW, JC), p. 74.
ICMLICML-2012-XiangMCCTZ #clustering #framework
A Split-Merge Framework for Comparing Clusterings (QX, QM, KMAC, HLC, IWT, ZZ), p. 164.
ICPRICPR-2012-RaketN #algorithm
A splitting algorithm for directional regularization and sparsification (LLR, MN), pp. 3094–3098.
VMCAIVMCAI-2012-ErmisHP
Splitting via Interpolants (EE, JH, AP), pp. 186–201.
SIGMODSIGMOD-2011-Bajda-PawlikowskiASP #execution #performance #query
Efficient processing of data warehousing queries in a split execution environment (KBP, DJA, AS, EP), pp. 1165–1176.
CSMRCSMR-2011-KohlKPDM #analysis #maintenance #multi #using
Using Multivariate Split Analysis for an Improved Maintenance of Automotive Diagnosis Functions (JK, AK, JPP, AD, SM), pp. 305–308.
ICPCICPC-2011-DitGPA #feature model #identifier #question
Can Better Identifier Splitting Techniques Help Feature Location? (BD, LG, DP, GA), pp. 11–20.
MLDMMLDM-2011-Grabczewski
Separability of Split Value Criterion with Weighted Separation Gains (KG), pp. 88–98.
SEKESEKE-2011-VilkomirKT #algorithm #case study #interface #testing #using
Interface Testing Using a Subgraph Splitting Algorithm: A Case Study (SV, AAK, NT), pp. 219–224.
ICLPICLP-J-2011-SlotaLS #hybrid #knowledge base
Splitting and updating hybrid knowledge bases (MS, JL, TS), pp. 801–819.
DACDAC-2010-CohenR #compilation #embedded #manycore
Processor virtualization and split compilation for heterogeneous multicore embedded systems (AC, ER), pp. 102–107.
DACDAC-2010-CongLR #concurrent #named
ACES: application-specific cycle elimination and splitting for deadlock-free routing on irregular network-on-chip (JC, CL, GR), pp. 443–448.
DATEDATE-2010-AbellaCCV
The split register file (JA, JC, PC, XV), pp. 945–948.
ICFPICFP-2010-BergstromRRSF #lazy evaluation
Lazy tree splitting (LB, MR, JHR, AS, MF), pp. 93–104.
AdaEuropeAdaEurope-2010-AnderssonP #ada #algorithm #implementation #manycore #realtime #scheduling #using
Implementing Multicore Real-Time Scheduling Algorithms Based on Task Splitting Using Ada 2012 (BA, LMP), pp. 54–67.
ICPRICPR-2010-XiongOL #algorithm #composition #recursion
A Recursive and Model-Constrained Region Splitting Algorithm for Cell Clump Decomposition (WX, SHO, JHL), pp. 4416–4419.
SACSAC-2010-SenguptaMS #multi #named #network #protocol
MMSRP: multi-wavelength Markov-based split reservation protocol for DWDM optical networks (MS, SKM, DS), pp. 689–693.
PPoPPPPoPP-2010-TzannesCBV #adaptation #lazy evaluation #runtime
Lazy binary-splitting: a run-time adaptive work-stealing scheduler (AT, GCC, RB, UV), pp. 179–190.
CAVCAV-2010-CohenNS10a #composition #ltl #named #verification
SPLIT: A Compositional LTL Verifier (AC, KSN, YS), pp. 558–561.
ASEASE-2009-CassellAGN #automation #clustering #towards #using
Towards Automating Class-Splitting Using Betweenness Clustering (KC, PA, LG, JN), pp. 595–599.
CASECASE-2009-MakkapatiN #detection
Clump splitting based on detection of dominant points from contours (VM, SKN), pp. 197–201.
MSRMSR-2009-EnslenHPV #analysis #automation #identifier #mining #source code
Mining source code to automatically split identifiers for software analysis (EE, EH, LLP, KVS), pp. 71–80.
CIAACIAA-J-2008-DixonES09 #analysis
Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching (RD, ÖE, TS), pp. 597–612.
ICALPICALP-v1-2009-DietzfelbingerR
Applications of a Splitting Trick (MD, MR), pp. 354–365.
HCIHCI-NT-2009-AbeOO #automation #image #using
Automatic Method for Measuring Eye Blinks Using Split-Interlaced Images (KA, SO, MO), pp. 3–11.
CIKMCIKM-2009-KhaitanDGS #data-driven
Data-driven compound splitting method for english compounds in domain names (SK, AD, SG, AS), pp. 207–214.
ECIRECIR-2009-GoyalPHJ #segmentation
Split and Merge Based Story Segmentation in News Videos (AG, PP, FH, JMJ), pp. 766–770.
ICMLICML-2009-BouchardZ
Split variational inference (GB, OZ), pp. 57–64.
RecSysRecSys-2009-BaltrunasR #collaboration
Context-based splitting of item ratings in collaborative filtering (LB, FR), pp. 245–248.
CCCC-2009-BraunH #source code
Register Spilling and Live-Range Splitting for SSA-Form Programs (MB, SH), pp. 174–189.
DRRDRR-2008-GaoT #approach
A mixed approach to book splitting (LG, ZT), p. 68150.
CSMRCSMR-2008-GlorieZHD #case study #concept analysis #evolution #experience #industrial #scalability #using
Splitting a Large Software Archive for Easing Future Software Evolution — An Industrial Experience Report using Formal Concept Analysis (MG, AZ, LH, AvD), pp. 153–162.
SASSAS-2008-Simon #control flow
Splitting the Control Flow with Boolean Flags (AS), pp. 315–331.
CIAACIAA-2008-DixonES #analysis
Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning (RD, ÖE, TS), pp. 141–150.
CSCWCSCW-2008-MorrisTB #collaboration #personalisation #web
Enhancing collaborative web search with personalization: groupization, smart splitting, and group hit-highlighting (MRM, JT, SB), pp. 481–484.
ICPRICPR-2008-SpringerK #feature model
Feature selection via decision tree surrogate splits (CS, WPK), pp. 1–5.
ICPRICPR-2008-XuP #image
Finding the splitting vector for image resolution up-conversion (XX, HP), pp. 1–4.
SIGIRSIGIR-2008-GoharianM #detection #documentation #on the
On document splitting in passage detection (NG, SSRM), pp. 833–834.
SACSAC-2008-DouillardJ #constraints #heuristic
Splitting heuristics for disjunctive numerical constraints (TD, CJ), pp. 140–144.
SACSAC-2008-LandD #enterprise #ontology
Enterprise ontology based splitting and contracting of organizations (MOL, JLGD), pp. 524–531.
FSEFSE-2008-LivshitsK #bound #named #web
Doloto: code splitting for network-bound web 2.0 applications (VBL, EK), pp. 350–360.
HPDCHPDC-2008-KhannaCKSSKF #data transfer #multi #network #optimisation #using
Multi-hop path splitting and multi-pathing optimizations for data transfers over shared wide-area networks using gridFTP (GK, ÜVÇ, TMK, PS, JHS, RK, ITF), pp. 225–226.
ISMMISMM-2008-CurialZAGCSA #named
MPADS: memory-pooling-assisted data splitting (SC, PZ, JNA, YG, SC, RS, RA), pp. 101–110.
PPoPPPPoPP-2008-LevM #hardware #memory management #transaction #using
Split hardware transactions: true nesting of transactions using best-effort hardware transactional memory (YL, JWM), pp. 197–206.
CAVCAV-2008-VakkalankaGK #order #reduction #source code #verification
Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings (SSV, GG, RMK), pp. 66–79.
IJCARIJCAR-2008-FietzkeW
Labelled Splitting (AF, CW), pp. 459–474.
DACDAC-2007-BonnyH #performance
Instruction Splitting for Efficient Code Compression (TB, JH), pp. 646–651.
DATEDATE-2007-MeijerKTK #interactive #network #process
Interactive presentation: A process splitting transformation for Kahn process networks (SM, BK, AT, EAdK), pp. 1355–1360.
DATEDATE-2007-NaguibG #process #simulation
Speeding up SystemC simulation through process splitting (YNN, RSG), pp. 111–116.
HCIHCI-IPT-2007-KimL #design #evaluation #readability
The Design and Evaluation of a Diagonally Splitted Column to Improve Text Readability on a Small Screen (YJK, WL), pp. 384–393.
SACSAC-2007-NazKOF #configuration management #embedded #novel
Reconfigurable split data caches: a novel scheme for embedded systems (AN, KMK, JHO, PF), pp. 707–712.
CADECADE-2007-AntonsenW
A Labelled System for IPL with Variable Splitting (RA, AW), pp. 132–146.
PLDIPLDI-2006-NakaikeIKN
Profile-based global live-range splitting (TN, TI, HK, TN), pp. 216–227.
ICPRICPR-v1-2006-GayuboGFMP #detection #fault #online #process
On-line machine vision system for detect split defects in sheet-metal forming processes (FG, JLG, EdlFL, FMT, JRP), pp. 723–726.
ICPRICPR-v1-2006-WenGL #clustering #detection #markov #monte carlo
Markov Chain Monte Carlo Data Association for Merge and Split Detection in Tracking Protein Clusters (QW, JG, KLP), pp. 1030–1033.
ICPRICPR-v2-2006-ZhanWG #approach #image #robust #segmentation
A Robust Split-and-Merge Text Segmentation Approach for Images (YZ, WW, WG), pp. 1002–1005.
ICPRICPR-v3-2006-SchmidtWY #approach
A Split & Merge Approach to Metric-Topological Map-Building (JS, CKW, WKY), pp. 1069–1072.
ISMMISMM-2006-SagonasW
Mark and split (KFS, JW), pp. 29–39.
OSDIOSDI-2006-Ta-MinLL #configuration management #interface #operating system #trust
Splitting Interfaces: Making Trust Between Applications and Operating Systems Configurable (RTM, LL, DL), pp. 279–292.
SIGMODSIGMOD-2005-JahangiriSS #maintenance #multi #named #performance
SHIFT-SPLIT: I/O Efficient Maintenance of Wavelet-Transformed Multidimensional Data (MJ, DS, CS), pp. 275–286.
VLDBVLDB-2005-RaseticSEN #performance
A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing (SR, JS, JE, MAN), pp. 934–945.
CCCC-2005-BartonTBA
Generalized Index-Set Splitting (CB, AT, BB, JNA), pp. 106–120.
CSMRCSMR-2004-Zdun #maintenance #re-engineering #using
Using Split Objects for Maintenance and Reengineering Tasks (UZ), pp. 105–114.
PLDIPLDI-2004-ZhongOSD #array #using
Array regrouping and structure splitting using whole-program reference affinity (YZ, MO, XS, CD), pp. 255–266.
ICPRICPR-v2-2004-KaratzasA #image #segmentation #using #web
Text Extraction from Web Images Based on A Split-and-Merge Segmentation Method Using Colour Perception (DK, AA), pp. 634–637.
ICPRICPR-v3-2004-XiangW #clustering #image #segmentation
Range Image Segmentation Based on Split-Merge Clustering (RX, RW), pp. 614–617.
ICPRICPR-v4-2004-GenovesioO #multi
Split and Merge Data Association Filter for Dense Multi-target Tracking (AG, JCOM), pp. 677–680.
ICPRICPR-v4-2004-WeiCN #image
Digital Image Restoration by Exposure-Splitting and Registration (ZW, YC, ARN), pp. 657–660.
KRKR-2004-QiLG #consistency #knowledge base
A Split-Combination Method for Merging Inconsistent Possibilistic Knowledge Bases (GQ, WL, DHG), pp. 348–356.
ICLPICLP-2004-VennekensGD
Splitting an Operator (JV, DG, MD), pp. 195–209.
DATEDATE-2003-FalkM #control flow #source code
Control Flow Driven Splitting of Loop Nests at the Source Code Level (HF, PM), pp. 10410–10415.
ICDARICDAR-2003-Lin03a
Text-mining based journal splitting (XL), pp. 1075–1079.
WCREWCRE-2003-ZouG #analysis #detection #using
Detecting Merging and Splitting using Origin Analysis (LZ, MWG), pp. 146–154.
ICMLICML-2003-YamadaSYT #data-driven #database #induction #standard
Decision-tree Induction from Time-series Data Based on a Standard-example Split Test (YY, ES, HY, KT), pp. 840–847.
MLDMMLDM-2003-CeciAM
Simplification Methods for Model Trees with Regression and Splitting Nodes (MC, AA, DM), pp. 20–34.
SOSPSOSP-2003-CastroDKNRS #multi #named
SplitStream: high-bandwidth multicast in cooperative environments (MC, PD, AMK, AN, AITR, AS), pp. 298–313.
ICMLICML-2002-TakechiS #induction
Finding an Optimal Gain-Ratio Subset-Split Test for a Set-Valued Attribute in Decision Tree Induction (FT, ES), pp. 618–625.
SACSAC-2002-FuTS #algorithm #similarity
Node splitting algorithms in tree-structured high-dimensional indexes for similarity search (YF, JCT, SRS), pp. 766–770.
ICDARICDAR-2001-HadjarHI #approach #composition #using
Newspaper Page Decomposition Using a Split and Merge Approach (KH, OH, RI), pp. 1186–1189.
SACSAC-2001-GaliassoW #algorithm #hybrid #multi #problem #search-based
A hybrid genetic algorithm for the point to multipoint routing problem with single split paths (PG, RLW), pp. 327–332.
DACDAC-2000-MoonKRS #image
To split or to conjoin: the question in image computation (IHM, JHK, KR, FS), pp. 23–28.
DATEDATE-2000-HsiehP #architecture #optimisation
Architectural Power Optimization by Bus Splitting (CTH, MP), pp. 612–616.
PLDIPLDI-2000-Lucco #taxonomy
Split-stream dictionary program compression (SL), pp. 27–34.
ICMLICML-2000-DrummondH
Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria (CD, RCH), pp. 239–246.
ICPRICPR-v1-2000-BorgesA #2d #algorithm #image #segmentation
A Split-and-Merge Segmentation Algorithm for Line Extraction in 2-D Range Image (GdAB, MJA), pp. 1441–1444.
SPLCSPLC-2000-CoriatJB
The SPLIT Method (MC, JJ, FB), pp. 147–166.
HPDCHPDC-2000-ThainL #execution #named
Bypass: A Tool for Building Split Execution Systems (DT, ML), pp. 79–86.
ICMLICML-1999-Robnik-SikonjaK #dependence #modelling
Attribute Dependencies, Understandability and Split Selection in Tree Based Models (MRS, IK), pp. 344–353.
OOPSLAOOPSLA-1999-KrintzCH #java #using
Reducing Transfer Delay Using Java Class File Splitting and Prefetching (CK, BC, UH), pp. 276–291.
ICSEICSE-1999-HerbslebG #revisited
Splitting the Organization and Integrating the Code: Conway’s Law Revisited (JDH, REG), pp. 85–95.
ICLPICLP-1999-GuptaP #distributed #memory management #named
Stack-splitting: Or-/And-parallelism on Distributed Memory Machines (GG, EP), pp. 290–304.
VLDBVLDB-1998-GarciaLL #on the
On Optimal Node Splitting for R-trees (YJG, MAL, STL), pp. 334–344.
ICPRICPR-1998-FerriMAS #algorithm #estimation #using
Variable-size block matching algorithm for motion estimation using a perceptual-based splitting criterion (FJF, JM, JVA, JS), pp. 286–288.
ICPRICPR-1998-ZhaHH #3d #algorithm #modelling #recursion #using
A recursive fitting-and-splitting algorithm for 3-D object modeling using superquadrics (HZ, TH, TH), pp. 658–662.
CCCC-1998-CooperS #graph
Live Range Splitting in a Graph Coloring Register Allocator (KDC, LTS), pp. 174–187.
DACDAC-1997-KernsY #congruence #network #reduction
Preservation of Passivity During RLC Network Reduction via Split Congruence Transformations (KJK, ATY), pp. 34–39.
VLDBVLDB-1997-LeeLWS #database #design #multi #physics
A Region Splitting Strategy for Physical Database Design of Multidimensional File Organizations (JHL, YKL, KYW, IYS), pp. 416–425.
VLDBVLDB-1997-MorimotoIM #performance
Efficient Construction of Regression Trees with Range and Region Splitting (YM, HI, SM), pp. 166–175.
ICALPICALP-1997-GrossiI #algorithm #order #performance #problem
Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract) (RG, GFI), pp. 605–615.
ICFPICFP-1997-BlumeA #approach #higher-order #named #optimisation
λ-Splitting: A Higher-Order Approach to Cross-Module Optimizations (MB, AWA), pp. 112–124.
STOCSTOC-1996-NagamochiI #graph
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs (HN, TI), pp. 64–73.
ICPRICPR-1996-ChatzisP #fuzzy
Introducing the select and split fuzzy cell Hough transform (VC, IP), pp. 552–556.
OOPSLAOOPSLA-1996-BardouD
Split Objects: a Disciplined Use of Delegation within Objects (DB, CD), pp. 122–137.
OOPSLAOOPSLA-1996-R
Reorganizing Split Objects (HA), pp. 138–149.
CCCC-1996-JanssenC
Controlled Node Splitting (JJ, HC), pp. 44–58.
ICALPICALP-1995-Vogler #equivalence
The Limit of Split_n-Language Equivalence (WV), pp. 636–647.
ICMLICML-1995-Brodley #automation
Automatic Selection of Split Criterion during Tree Growing Based on Node Location (CEB), pp. 73–80.
ICMLICML-1995-FultonKS #algorithm #multi #performance
Efficient Algorithms for Finding Multi-way Splits for Decision Trees (TF, SK, SS), pp. 244–251.
PLDIPLDI-1994-KurlanderF #low cost
Zero-cost Range Splitting (SMK, CNF), pp. 257–265.
STOCSTOC-1994-Gabow #algorithm #graph #performance
Efficient splitting off algorithms for graphs (HNG), pp. 696–705.
STOCSTOC-1994-Miltersen #bound #problem #random
Lower bounds for union-split-find related problems on random access machines (PBM), pp. 625–634.
ICLPICLP-1994-LifschitzT #logic programming
Splitting a Logic Program (VL, HT), pp. 23–37.
SASWSA-1992-GiannottiL #abstract interpretation #specification #using
Using Abstract Interpretation for Gate splitting in LOTOS Specifications (FG, DL), pp. 194–204.
PLDIPLDI-1990-ChambersU #analysis #dynamic typing #object-oriented #optimisation #source code
Iterative Type Analysis and Extended Message Splitting: Optimizing Dynamically-Typed Object-Oriented Programs (CC, DU), pp. 150–164.
STOCSTOC-1990-Poutre #bound #pointer #problem
Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines (JALP), pp. 34–44.
ICMLML-1990-Kadie #algorithm #concept #set
Conceptual Set Covering: Improving Fit-And-Split Algorithms (CMK), pp. 40–48.
ICMLML-1990-UtgoffB #incremental #multi
An Incremental Method for Finding Multivariate Splits for Decision Trees (PEU, CEB), pp. 58–65.
ICMLML-1989-LambertTL #algorithm #concept #hybrid #learning #recursion
Generalized Recursive Splitting Algorithms for Learning Hybrid Concepts (BLL, DKT, SCYL), pp. 496–498.
DACDAC-1988-Cheng #generative #testing
Split Circuit Model for Test Generation (WTC), pp. 96–101.
VLDBVLDB-1988-PuKH #process #transaction
Split-Transactions for Open-Ended Activities (CP, GEK, NCH), pp. 26–37.
ICALPICALP-1987-MehlhornNA #bound #complexity #problem
A Lower Bound for the Complexity of the Union-Split-Find Problem (KM, SN, HA), pp. 479–488.
ICGTGG-1982-EhrigS #graph transformation
Church-Rosser properties for graph replacement systems with unique splitting (HE, JS), pp. 82–101.
VLDBVLDB-1980-Kent #concept
Splitting the Conceptual Schema (WK), pp. 10–14.
CCSDCG-1980-Watt #parsing
Rule splitting and attribute-directed parsing (DAW), pp. 363–392.
VLDBVLDB-1978-NakamuraM #analysis
An Analysis of Storage Utilization Factor in Block Split Data Structuring Scheme (TN, TM), pp. 489–495.

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.