## Stem disjoint$ (all stems)

### 49 papers:

- ICALP-v1-2015-WeinsteinW #communication #data type
- The Simultaneous Communication of Disjointness with Applications to Data Streams (OW, DPW), pp. 1082–1093.
- OOPSLA-2015-BrandauerCW #alias #fine-grained
- Disjointness domains for fine-grained aliasing (SB, DC, TW), pp. 898–916.
- CADE-2015-ChocronFR #revisited
- A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited (PC, PF, CR), pp. 419–433.
- FoSSaCS-2014-ErbaturKMMNR #on the #problem #symmetry #unification
- On Asymmetric Unification and the Combination Problem in Disjoint Theories (SE, DK, AMM, CM, PN, CR), pp. 274–288.
- STOC-2014-KawarabayashiKK #graph #grid #problem #theorem
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (KiK, YK, SK), pp. 70–78.
- ICALP-v1-2014-BjorklundH #polynomial
- Shortest Two Disjoint Paths in Polynomial Time (AB, TH), pp. 211–222.
- KDD-2014-FangT #linear
- Networked bandits with disjoint linear payoffs (MF, DT), pp. 1106–1115.
- IJCAR-2014-ChocronFR #satisfiability
- A Gentle Non-disjoint Combination of Satisfiability Procedures (PC, PF, CR), pp. 122–136.
- ESOP-2013-KassiosK #verification
- A Discipline for Program Verification Based on Backpointers and Its Use in Observational Disjointness (ITK, EK), pp. 149–168.
- ICALP-v1-2013-ChekuriNS #graph
- Maximum Edge-Disjoint Paths in k-Sums of Graphs (CC, GN, FBS), pp. 328–339.
- STOC-2012-Sherstov #communication #complexity #multi #set
- The multiparty communication complexity of set disjointness (AAS), pp. 525–548.
- IJCAR-2012-FontaineMW #decidability
- Combination of Disjoint Theories: Beyond Decidability (PF, SM, CW), pp. 256–270.
- STOC-2011-KawarabayashiK #algorithm #approximate #problem
- Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two (KiK, YK), pp. 81–88.
- LATA-2011-BrijderB
- Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars (RB, HB), pp. 167–178.
- CC-2011-JenistaED #parallel #reachability #using
- Using Disjoint Reachability for Parallelization (JCJ, YHE, BD), pp. 198–224.
- DAC-2010-KongMYW #algorithm
- An optimal algorithm for finding disjoint rectangles and its application to PCB routing (HK, QM, TY, MDFW), pp. 212–217.
- STOC-2010-Klauck #theorem
- A strong direct product theorem for disjointness (HK), pp. 77–86.
- ICALP-v1-2010-Georgiadis #graph #testing
- Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs (LG), pp. 738–749.
- ICALP-v1-2010-ShpilkaV #on the #polynomial #testing
- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors (AS, IV), pp. 408–419.
- ICEIS-DISI-2009-Chen #graph
- Directed Acyclic Graphs and Disjoint Chains (YC), pp. 17–24.
- ICALP-2007-GroheG #problem
- Parameterized Approximability of the Disjoint Cycle Problem (MG, MG), pp. 363–374.
- STOC-2006-ChekuriKS #constant #graph
- Edge-disjoint paths in Planar graphs with constant congestion (CC, SK, FBS), pp. 757–766.
- ICALP-v1-2006-RaoZ #graph
- Edge Disjoint Paths in Moderately Connected Graphs (SR, SZ), pp. 202–213.
- STOC-2005-AndrewsZ #problem
- Hardness of the undirected edge-disjoint paths problem (MA, LZ), pp. 276–283.
- DATE-v2-2004-MillbergNTJ #network #using
- Guaranteed Bandwidth Using Looped Containers in Temporally Disjoint Networks within the Nostrum Network on Chip (MM, EN, RT, AJ), pp. 890–895.
- CADE-2003-KrsticC
- Canonization for Disjoint Unions of Theories (SK, SC), pp. 197–211.
- CADE-2003-Ringeissen
- Matching in a Class of Combined Non-disjoint Theories (CR), pp. 212–227.
- ICML-2002-YangW #classification
- Non-Disjoint Discretization for Naive-Bayes Classifiers (YY, GIW), pp. 666–673.
- OOPSLA-2002-ClarkeD #encapsulation
- Ownership, encapsulation and the disjointness of type and effect (DGC, SD), pp. 292–310.
- STOC-2001-KlauckNTZ #communication #complexity #interactive #quantum #set
- Interaction in quantum communication and the complexity of set disjointness (HK, AN, ATS, DZ), pp. 124–133.
- STOC-1999-GuruswamiKRSY #algorithm #approximate #problem
- Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems (VG, SK, RR, FBS, MY), pp. 19–28.
- STOC-1998-Kleinberg #algorithm #problem
- Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem (JMK), pp. 530–539.
- STOC-1996-AggarwalKW #layout #trade-off
- Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout (AA, JMK, DPW), pp. 585–594.
- STOC-1995-KleinbergT #approximate #network #problem
- Approximations for the disjoint paths problem in high-diameter planar networks (JMK, ÉT), pp. 26–35.
- SAC-1995-Li #algorithm #optimisation #performance #set
- An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization (WNL), pp. 56–60.
- ICALP-1994-NikolestseasPSY #graph #multi #network #random #reliability
- Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing (SEN, KVP, PGS, MY), pp. 508–519.
- CADE-1994-DomenjoudKR #equation
- Combination Techniques for Non-Disjoint Equational Theories (ED, FK, CR), pp. 267–281.
- STOC-1992-BroderFU #graph
- Existence and Construction of Edge Disjoint Paths on Expander Graphs (AZB, AMF, EU), pp. 140–149.
- KR-1992-BollingerP #constraints #logic #order
- An Order-Sorted Logic with Sort Literals and Disjointness Constraints (TB, UP), pp. 413–424.
- CADE-1992-BaaderS #equation #unification
- Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures (FB, KUS), pp. 50–65.
- SIGIR-1991-Swanson #analysis
- Analysis of Unintended Connections Between Disjoint Science Literatures (DRS), pp. 280–289.
- PODS-1989-Elkan #query
- A Decision Procedure for Conjunctive Query Disjointness (CE), pp. 134–139.
- CADE-1988-Schmidt-Schauss #equation #unification
- Unification in a Combination of Arbitrary Disjoint Equational Theories (MSS), pp. 378–396.
- STOC-1987-PelegU #graph
- Constructing Disjoint Paths on Expander Graphs (Extended Abstract) (DP, EU), pp. 264–273.
- CADE-1986-Tiden #set #unification
- Unification in Combinations of Collapse-Free Theories with Disjoint Sets of Function Symbols (ET), pp. 431–449.
- STOC-1985-BollobasS #algorithm #behaviour #on the #set
- On the Expected Behaviour of Disjoint Set Union Algorithms (BB, IS), pp. 224–231.
- VLDB-1983-IbarakiKM #concept
- Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract) (TI, TK, TM), pp. 89–91.
- STOC-1983-GabowT #algorithm #linear #set
- A Linear-Time Algorithm for a Special Case of Disjoint Set Union (HNG, RET), pp. 246–251.
- STOC-1977-Tarjan #maintenance #set
- Reference Machines Require Non-linear Time to Maintain Disjoint Sets (RET), pp. 18–29.