Tag #commutative
103 papers:
DLT-2018-CarpiD #context-free grammar #equivalence #on the- On the Commutative Equivalence of Context-Free Languages (AC, FD), pp. 169–181.
LOPSTR-2018-AlpuenteCEM #axiom- Homeomorphic Embedding Modulo Combinations of Associativity and Commutativity Axioms (MA, ACO, SE, JM), pp. 38–55.
CGO-2018-PorpodasRG - Look-ahead SLP: auto-vectorization in the presence of commutative operations (VP, RCOR, LFWG), pp. 163–174.
FASE-2018-ChechikSDR #analysis #named #performance- FPH: Efficient Non-commutativity Analysis of Feature-Based Systems (MC, IS, CD, JR), pp. 319–336.
IJCAR-2018-KanovichKNS #framework #logic- A Logical Framework with Commutative and Non-commutative Subexponentials (MIK, SK, VN, AS), pp. 228–245.
ESOP-2017-Staton #probability #programming #semantics- Commutative Semantics for Probabilistic Programming (SS), pp. 855–879.
Haskell-2016-YallopL #revisited- Causal commutative arrows revisited (JY, HL), pp. 21–32.
CAV-2016-ChenSW #approach #framework #pipes and filters #problem #transducer- The Commutativity Problem of the MapReduce Framework: A Transducer-Based Approach (YFC, LS, ZW), pp. 91–111.
LATA-2015-MikulskiPR #word- Square-Free Words over Partially Commutative Alphabets (LM, MP, WR), pp. 424–435.
TACAS-2015-ChenHSW #reduction- Commutativity of Reducers (YFC, CDH, NS, BYW), pp. 131–146.
- CAV-2015-GehrDV #learning #specification
- Learning Commutativity Specifications (TG, DD, MTV), pp. 307–323.
LICS-2015-HeunenL #algebra- Domains of Commutative C-Subalgebras (CH, BL), pp. 450–461.
AFL-2014-Crespi-ReghizziP #composition- Commutative Languages and their Composition by Consensual Methods (SCR, PSP), pp. 216–230.
ICML-c2-2014-CohenW #learning- Learning the Irreducible Representations of Commutative Lie Groups (TC, MW), pp. 1755–1763.
PLDI-2014-DimitrovRVK #concurrent #detection- Commutativity race detection (DD, VR, MTV, EK), p. 33.
ICALP-v1-2013-Blaser - Noncommutativity Makes Determinants Hard (MB), pp. 172–183.
- LATA-2013-LuttenbergerS #convergence
- Convergence of Newton’s Method over Commutative Semirings (ML, MS), pp. 407–418.
SOSP-2013-ClementsKZMK #design #manycore #scalability- The scalable commutativity rule: designing scalable software for multicore processors (ATC, MFK, NZ, RTM, EK), pp. 1–17.
STOC-2013-NaorRV #difference #performance- Efficient rounding for the noncommutative grothendieck inequality (AN, OR, TV), pp. 71–80.
ECMFA-2012-MosserBD #adaptation #composition- A Commutative Model Composition Operator to Support Software Adaptation (SM, MBF, LD), pp. 4–19.
CSL-2012-Wu #automaton- Commutative Data Automata (ZW), pp. 528–542.
- PLDI-2011-KimR #data type #linked data #open data #semantics #verification
- Verification of semantic commutativity conditions and inverse operations on linked data structures (DK, MCR), pp. 528–541.
- PLDI-2011-KulkarniNPSP
- Exploiting the commutativity lattice (MK, DN, DP, XS, KP), pp. 542–555.
- PLDI-2011-PrabhuGZJA #parallel #programming #set
- Commutative set: a language extension for implicit parallel programming (PP, SG, YZ, NPJ, DIA), pp. 1–11.
- STOC-2011-ChienHSS
- Almost settling the hardness of noncommutative determinant (SC, PH, AS, SS), pp. 499–508.
- CSL-2011-TatsutaB
- Non-Commutative Infinitary Peano Arithmetic (MT, SB), pp. 538–552.
CIAA-2010-Grosu #theorem- The Cayley-Hamilton Theorem for Noncommutative Semirings (RG), pp. 143–153.
- LATA-2010-KlunderR #problem
- Post Correspondence Problem with Partially Commutative Alphabets (BK, WR), pp. 356–367.
- STOC-2010-ArvindS #on the
- On the hardness of the noncommutative determinant (VA, SS), pp. 677–686.
- STOC-2010-HrubesWY #problem
- Non-commutative circuits and the sum-of-squares problem (PH, AW, AY), pp. 667–676.
ICDAR-2009-StoffelTR #diagrams #online #recognition- Recognition of On-Line Handwritten Commutative Diagrams (AS, ET, RR), pp. 1211–1215.
- DLT-2009-Kirsten
- The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable (DK), pp. 326–333.
- LATA-2009-Akama #learning
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory (YA), pp. 93–104.
ICFP-2009-LiuCH #optimisation- Causal commutative arrows and their optimization (HL, EC, PH), pp. 35–46.
- ICFP-2009-Piponi #diagrams #monad
- Commutative monads, diagrams and knots (DPP), pp. 231–232.
ASPLOS-2009-AleenC #analysis #parallel #program transformation- Commutativity analysis for software parallelization: letting program transformations see the big picture (FA, NC), pp. 241–252.
- ESOP-2009-MostrousYH #type system
- Global Principal Typing in Partially Commutative Asynchronous Sessions (DM, NY, KH), pp. 316–332.
- CSL-2009-Tatsuta #calculus #first-order
- Non-Commutative First-Order Sequent Calculus (MT), pp. 470–484.
- AFL-2008-Martyugin #automaton #complexity #problem #word
- Complexity of problems concerning reset words for commutative automata and automata with simple idempotents (PVM), pp. 314–324.
- ICALP-B-2008-GomezGP #question
- When Does Partial Commutative Closure Preserve Regularity? (ACG, GG, JÉP), pp. 209–220.
FoSSaCS-2008-Parys #equation #finite- Systems of Equations Satisfied in All Commutative Finite Semigroups (PP), pp. 261–272.
- ICALP-2007-BosnackiEGP #agile #on the
- On Commutativity Based Edge Lean Search (DB, EE, BG, DP), pp. 158–170.
- ICALP-v2-2006-GuerriniM #linear #logic #multi #quantifier
- Commutative Locative Quantifiers for Multiplicative Linear Logic (SG, PM), pp. 396–407.
- ICALP-2005-MagniezN #complexity #quantum #testing
- Quantum Complexity of Testing Group Commutativity (FM, AN), pp. 1312–1324.
TLCA-2005-CosmoPR #recursion #type system- Subtyping Recursive Types Modulo Associative Commutative Products (RDC, FP, DR), pp. 179–193.
VMCAI-2005-SistlaZW #model checking- Model Checking of Systems Employing Commutative Functions (APS, MZ, XW), pp. 250–266.
- ICALP-2003-ChattopadhyayT #category theory
- Locally Commutative Categories (AC, DT), pp. 984–995.
RTA-2003-Eker #scalability- Associative-Commutative Rewriting on Large Terms (SE), pp. 14–29.
- FoSSaCS-2002-Srba
- Note on the Tableau Technique for Commutative Transition Systems (JS), pp. 387–401.
- ICALP-2001-DiekertM #decidability #equation
- Solvability of Equations in Free Partially Commutative Groups Is Decidable (VD, AM), pp. 543–554.
- CSL-2001-GuglielmiS #calculus
- Non-commutativity and MELL in the Calculus of Structures (AG, LS), pp. 54–68.
- CSL-2001-Mogbil #correctness #logic #polynomial
- Quadratic Correctness Criterion for Non-commutative Logic (VM), pp. 69–83.
- CSL-2001-Ohsaki #automaton #equation
- Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories (HO), pp. 539–553.
WLC-2000-ImrehIP #automaton #on the- On Commutative Asynchronous Automata (BI, MI, AP), pp. 212–221.
PPDP-2000-Faggian #calculus #clustering #proving- Proof construction and non-commutativity: a cluster calculus (CF), pp. 80–91.
- LICS-1999-HopkinsK #algebra #theorem
- Parikh’s Theorem in Commutative Kleene Algebra (MWH, DK), pp. 394–401.
- RTA-1998-MarcheU #dependence #termination
- Termination of Associative-Commutative Rewriting by Dependency Pairs (CM, XU), pp. 241–255.
- ALP-PLILP-1998-MoreauK #compilation #source code
- A Compiler for Rewrite Programs in Associative-Commutative Theories (PEM, HK), pp. 230–249.
- RTA-1997-BachmairT #polynomial
- D-Bases for Polynomial Ideals over Commutative Noetherian Rings (LB, AT), pp. 113–127.
- RTA-1997-GreenHK #named
- Opal: A System for Computing Noncommutative Gröbner Bases (ELG, LSH, BJK), pp. 331–334.
- TLCA-1997-RetoreL #linear #logic
- A Non-commutative Extension of Classical Linear Logic (CR, PL), pp. 300–318.
ASF+SDF-1997-MoreauK #compilation #normalisation- Compilation techniques for associative-commutative normalisation (PEM, HK), p. 11.
- CSL-1997-RuetF #concurrent #constraints #logic #programming
- Concurrent Constraint Programming and Non-commutative Logic (PR, FF), pp. 406–423.
- RTA-1996-BerregebBR #induction #named #proving
- SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories (NB, AB, MR), pp. 428–431.
ICPR-1996-Karasik #3d #on the #representation #set- On a planar representation of 3D figures commutative with respect to set and morphological operations (YBK), pp. 615–619.
- PLDI-1996-RinardD #analysis #compilation #framework
- Commutativity Analysis: A New Analysis Framework for Parallelizing Compilers (MCR, PCD), pp. 54–67.
- TACAS-1996-Kozen #algebra
- Kleene Algebra withTests and Commutativity Conditions (DK), pp. 14–33.
- CAV-1996-BerregebBR #automation #induction #verification
- Automated Verification by Induction with Associative-Commutative Operators (NB, AB, MR), pp. 220–231.
- RTA-1995-ChenA #named
- STORM: A MAny-to-One Associative-Commutative Matcher (TC, SA), pp. 414–419.
SAS-1994-KhoshnevisanA - Mechanical Elimination of Commutative Redundancy (HK, MA), pp. 449–463.
CADE-1994-Vigneron #constraints #deduction- Associative-Commutative Deduction with Constraints (LV), pp. 530–544.
- RTA-1993-DelorP #order
- Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols (CD, LP), pp. 389–404.
- STOC-1993-AllenderJ #reduction
- Depth reduction for noncommutative arithmetic circuits (EA, JJ), pp. 515–522.
TAPSOFT-1993-BachmairCR - Associative-Commutative Discrimination Nets (LB, TC, IVR), pp. 61–74.
- ICALP-1991-DuchampK #monad
- Lazard’s Factorizations of Free Partially Commutative Monoids (GD, DK), pp. 242–253.
- RTA-1991-BaaderN #algebra #equation #how #morphism #unification
- Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification (FB, WN), pp. 124–135.
- RTA-1991-NarendranR #canonical #finite
- Any Gound Associative-Commutative Theory Has a Finite Canonical System (PN, MR), pp. 423–434.
- CAAP-1991-KounalisL #compilation #pattern matching
- Compilation of Pattern Matching with Associative-Commutative Functions (EK, DL), pp. 57–73.
- STOC-1991-Nisan #bound
- Lower Bounds for Non-Commutative Computation (NN), pp. 410–418.
- CADE-1990-Basin #morphism #similarity
- Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators in Isomorphism Complete (DAB), pp. 251–260.
VLDB-1989-Ioannidis #linear #recursion- Commutativity and its Role in the Processing of Linear Recursion (YEI), pp. 155–163.
- RTA-1989-BairdPW #reduction #set
- Complete Sets of Reductions Modulo Associativity, Commutativity and Identity (TBB, GEP, RWW), pp. 29–44.
- RTA-1989-Lai #how #on the
- On How To Move Mountains “Associatively and Commutatively” (ML), pp. 187–202.
- ICALP-1988-Diekert #for free #monad #transitive
- Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids (VD), pp. 176–187.
- CADE-1988-LincolnC #unification
- Adventures in Associative-Commutative Unification (PL, JC), pp. 358–367.
- ICALP-1987-Beaudry #testing
- Testing Membership in Commutative Transformation Semigroups (MB), pp. 542–549.
- ICALP-1986-Metivier #monad #on the #set
- On Recognizable Subsets of Free Partially Commutative Monoids (YM), pp. 254–264.
- CADE-1986-GnaedigL #proving #term rewriting #termination
- Proving Termination of Associative Commutative Rewriting Systems by Rewriting (IG, PL), pp. 52–61.
- ICALP-1985-Kortelainen #regular expression
- Every Commutative Quasirational Language is Regular (JK), pp. 348–355.
- RTA-1985-Fortenbach #algebra #unification
- An Algebraic Approch to Unification Under Assoiativity and Commutativity (AF), pp. 381–397.
- RTA-1985-Kandri-RodyKN #algebra #approach #problem #unification
- An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras (AKR, DK, PN), pp. 345–364.
- STOC-1985-Huynh #complexity #equivalence #problem #symmetry
- The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems (DTH), pp. 405–412.
- CADE-1984-Fages #unification
- Associative-Commutative Unification (FF), pp. 194–208.
- CADE-1984-Stickel #case study #proving #theorem proving
- A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity (MES), pp. 248–258.
PODS-1982-MohanFS #protocol- Compatibility and Commutativity in Non-two-phase Locking Protocols (CM, DSF, AS), pp. 283–292.
- ICALP-1980-Shamir #encryption #on the #power of
- On the Power of Commutativity in Cryptography (AS), pp. 582–595.
- ICALP-1979-Jeanrond #axiom #termination #theorem
- A Unique Termination Theorem for a Theory with Generalised Commutative Axioms (HJJ), pp. 316–330.
- STOC-1979-JaJa #complexity #on the
- On the Complexity of Bilinear Forms with Commutativity (JJ), pp. 197–208.
- ICALP-1978-Reutenauer #french
- Sur les Series Rationnelles en Variables Non Commutatives (CR), pp. 372–381.
- STOC-1976-CardozaLM #exponential #petri net #problem
- Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report (EC, RJL, ARM), pp. 50–54.
POPL-1973-Chandra #on the #problem- On the Decision Problems of Program Schemas with Commutative and Invertable Functions (AKC), pp. 235–242.
- ICALP-1972-Fliess #french
- Automates stochastiques et séries rationnelles non commutatives (MF), pp. 397–411.
- ICALP-1972-Kalman #linear
- Realization Theory of Linear Systems over a Commutative Ring (REK), pp. 61–65.
