111 papers:
- TACAS-2015-ChenHSW #commutative #reduction
- Commutativity of Reducers (YFC, CDH, NS, BYW), pp. 131–146.
- ICALP-v1-2015-CoudronV #approximate #interactive #proving
- Interactive Proofs with Approximately Commuting Provers (MC, TV), pp. 355–366.
- LATA-2015-MikulskiPR #commutative #word
- Square-Free Words over Partially Commutative Alphabets (LM, MP, WR), pp. 424–435.
- DUXU-DD-2015-RossBOAA #case study #experience #feedback
- A Feasibility Study of the Effect of Phone-Based Feedback of Other Commuters’ Subjective Experiences on Driver Intentions to Change (TR, AB, LO, BA, VAS), pp. 548–558.
- RecSys-2015-DalyBS #recommendation
- Crowd Sourcing, with a Few Answers: Recommending Commuters for Traffic Updates (ED, MB, FS), pp. 253–256.
- CAV-2015-GehrDV #commutative #learning #specification
- Learning Commutativity Specifications (TG, DD, MTV), pp. 307–323.
- LICS-2015-HeunenL #algebra #commutative
- Domains of Commutative C-Subalgebras (CH, BL), pp. 450–461.
- PLDI-2014-DimitrovRVK #commutative #concurrent #detection
- Commutativity race detection (DD, VR, MTV, EK), p. 33.
- AFL-2014-Crespi-ReghizziP #commutative #composition
- Commutative Languages and their Composition by Consensual Methods (SCR, PSP), pp. 216–230.
- ICML-c2-2014-CohenW #commutative #learning
- Learning the Irreducible Representations of Commutative Lie Groups (TC, MW), pp. 1755–1763.
- KDD-2014-XueWCG #identification
- Identifying tourists from public transport commuters (MX, HW, WC, WSN, GHG), pp. 1779–1788.
- RecSys-2014-GingerichA
- Content ordering based on commuting patterns (TG, OA), pp. 365–366.
- LATA-2013-LuttenbergerS #commutative #convergence
- Convergence of Newton’s Method over Commutative Semirings (ML, MS), pp. 407–418.
- DUXU-NTE-2013-ArningZM #design #exclamation #framework #guidelines #interface #requirements
- Join the Ride! User Requirements and Interface Design Guidelines for a Commuter Carpooling Platform (KA, MZ, HM), pp. 10–19.
- SOSP-2013-ClementsKZMK #commutative #design #manycore #scalability
- The scalable commutativity rule: designing scalable software for multicore processors (ATC, MFK, NZ, RTM, EK), pp. 1–17.
- ECMFA-2012-MosserBD #adaptation #commutative #composition
- A Commutative Model Composition Operator to Support Software Adaptation (SM, MBF, LD), pp. 4–19.
- CSL-2012-Wu #automaton #commutative
- Commutative Data Automata (ZW), pp. 528–542.
- PLDI-2011-KimR #commutative #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 #commutative
- Exploiting the commutativity lattice (MK, DN, DP, XS, KP), pp. 542–555.
- PLDI-2011-PrabhuGZJA #commutative #parallel #programming #set
- Commutative set: a language extension for implicit parallel programming (PP, SG, YZ, NPJ, DIA), pp. 1–11.
- CSL-2011-TatsutaB #commutative
- Non-Commutative Infinitary Peano Arithmetic (MT, SB), pp. 538–552.
- STOC-2010-HrubesWY #commutative #problem
- Non-commutative circuits and the sum-of-squares problem (PH, AW, AY), pp. 667–676.
- LATA-2010-KlunderR #commutative #problem
- Post Correspondence Problem with Partially Commutative Alphabets (BK, WR), pp. 356–367.
- ICDAR-2009-StoffelTR #commutative #diagrams #online #recognition
- Recognition of On-Line Handwritten Commutative Diagrams (AS, ET, RR), pp. 1211–1215.
- ESOP-2009-MostrousYH #commutative #type system
- Global Principal Typing in Partially Commutative Asynchronous Sessions (DM, NY, KH), pp. 316–332.
- DLT-2009-Kirsten #commutative
- The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable (DK), pp. 326–333.
- LATA-2009-Akama #commutative #learning
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory (YA), pp. 93–104.
- ICFP-2009-LiuCH #commutative #optimisation
- Causal commutative arrows and their optimization (HL, EC, PH), pp. 35–46.
- ICFP-2009-Piponi #commutative #diagrams #monad
- Commutative monads, diagrams and knots (DPP), pp. 231–232.
- ASPLOS-2009-AleenC #analysis #commutative #parallel #program transformation
- Commutativity analysis for software parallelization: letting program transformations see the big picture (FA, NC), pp. 241–252.
- CSL-2009-Tatsuta #calculus #commutative #first-order
- Non-Commutative First-Order Sequent Calculus (MT), pp. 470–484.
- FoSSaCS-2008-Parys #commutative #equation #finite
- Systems of Equations Satisfied in All Commutative Finite Semigroups (PP), pp. 261–272.
- AFL-2008-Martyugin #automaton #commutative #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 #commutative #question
- When Does Partial Commutative Closure Preserve Regularity? (ACG, GG, JÉP), pp. 209–220.
- ICPR-2008-EmmsHW #graph #quantum #using
- Graph drawing using quantum commute time (DE, ERH, RCW), pp. 1–4.
- KDD-2008-YenSMS #difference #metric #product line
- A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances (LY, MS, AM, MS), pp. 785–793.
- DLT-2007-Frid
- Commutation of Binary Factorial Languages (AEF), pp. 193–204.
- ICALP-2007-BosnackiEGP #agile #commutative #on the
- On Commutativity Based Edge Lean Search (DB, EE, BG, DP), pp. 158–170.
- LATA-2007-FrancezK #automaton
- Pushdown automata with cancellation and commutation-augmented pregroups grammars (NF, MK), pp. 7–26.
- ICALP-v2-2006-GuerriniM #commutative #linear #logic #multi #quantifier
- Commutative Locative Quantifiers for Multiplicative Linear Logic (SG, PM), pp. 396–407.
- ICPR-v3-2006-QiuH #graph #using
- Graph Matching using Commute Time Spanning Trees (HQ, ERH), pp. 1224–1227.
- ICPR-v4-2006-QiuH06a #graph #using
- Graph Matching using Commute Time Spanning Tr (HQ, ERH), p. 955.
- ICALP-2005-MagniezN #commutative #complexity #quantum #testing
- Quantum Complexity of Testing Group Commutativity (FM, AN), pp. 1312–1324.
- TLCA-2005-CosmoPR #commutative #recursion #type system
- Subtyping Recursive Types Modulo Associative Commutative Products (RDC, FP, DR), pp. 179–193.
- VMCAI-2005-SistlaZW #commutative #model checking
- Model Checking of Systems Employing Commutative Functions (APS, MZ, XW), pp. 250–266.
- DLT-2004-ChoffrutGL #on the
- On the Maximum Coefficients of Rational Formal Series in Commuting Variables (CC, MG, VL), pp. 114–126.
- ICALP-2003-ChattopadhyayT #category theory #commutative
- Locally Commutative Categories (AC, DT), pp. 984–995.
- CSL-2003-Aichernig
- The Commuting V-Diagram (BKA), pp. 15–28.
- RTA-2003-Eker #commutative #scalability
- Associative-Commutative Rewriting on Large Terms (SE), pp. 14–29.
- FoSSaCS-2002-Srba #commutative
- Note on the Tableau Technique for Commutative Transition Systems (JS), pp. 387–401.
- ICALP-2001-DiekertM #commutative #decidability #equation
- Solvability of Equations in Free Partially Commutative Groups Is Decidable (VD, AM), pp. 543–554.
- ICALP-2001-HarjuIKS #morphism
- Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages (TH, OHI, JK, AS), pp. 579–590.
- CSL-2001-GuglielmiS #calculus #commutative
- Non-commutativity and MELL in the Calculus of Structures (AG, LS), pp. 54–68.
- CSL-2001-Mogbil #commutative #correctness #logic #polynomial
- Quadratic Correctness Criterion for Non-commutative Logic (VM), pp. 69–83.
- CSL-2001-Ohsaki #automaton #commutative #equation
- Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories (HO), pp. 539–553.
- WLC-2000-ImrehIP #automaton #commutative #on the
- On Commutative Asynchronous Automata (BI, MI, AP), pp. 212–221.
- WLC-2000-SchottS #algorithm #parallel #word
- Two Optimal Parallel Algorithms on the Commutation Class of a Word (RS, JCS), pp. 403–419.
- PPDP-2000-Faggian #calculus #clustering #commutative #proving
- Proof construction and non-commutativity: a cluster calculus (CF), pp. 80–91.
- LICS-1999-HopkinsK #algebra #commutative #theorem
- Parikh’s Theorem in Commutative Kleene Algebra (MWH, DK), pp. 394–401.
- ALP-PLILP-1998-MoreauK #commutative #compilation #source code
- A Compiler for Rewrite Programs in Associative-Commutative Theories (PEM, HK), pp. 230–249.
- RTA-1998-MarcheU #commutative #dependence #termination
- Termination of Associative-Commutative Rewriting by Dependency Pairs (CM, XU), pp. 241–255.
- ICALP-1997-DrosteG #on the
- On Recognizable and Rational Formal Power Series in Partially Commuting Variables (MD, PG), pp. 682–692.
- ASF+SDF-1997-MoreauK #commutative #compilation #normalisation
- Compilation techniques for associative-commutative normalisation (PEM, HK), p. 11.
- CSL-1997-RuetF #commutative #concurrent #constraints #logic #programming
- Concurrent Constraint Programming and Non-commutative Logic (PR, FF), pp. 406–423.
- RTA-1997-BachmairT #commutative #polynomial
- D-Bases for Polynomial Ideals over Commutative Noetherian Rings (LB, AT), pp. 113–127.
- TLCA-1997-RetoreL #commutative #linear #logic
- A Non-commutative Extension of Classical Linear Logic (CR, PL), pp. 300–318.
- TACAS-1996-Kozen #algebra #commutative
- Kleene Algebra withTests and Commutativity Conditions (DK), pp. 14–33.
- PLDI-1996-RinardD #analysis #commutative #compilation #framework
- Commutativity Analysis: A New Analysis Framework for Parallelizing Compilers (MCR, PCD), pp. 54–67.
- ICPR-1996-Karasik #3d #commutative #on the #representation #set
- On a planar representation of 3D figures commutative with respect to set and morphological operations (YBK), pp. 615–619.
- CAV-1996-BerregebBR #automation #commutative #induction #verification
- Automated Verification by Induction with Associative-Commutative Operators (NB, AB, MR), pp. 220–231.
- RTA-1996-BerregebBR #commutative #induction #named #proving
- SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories (NB, AB, MR), pp. 428–431.
- ICALP-1995-MetivierRW #set #word
- Computing the Closure of Sets of Words Under Partial Commutations (YM, GR, PAW), pp. 75–86.
- RTA-1995-ChenA #commutative #named
- STORM: A MAny-to-One Associative-Commutative Matcher (TC, SA), pp. 414–419.
- SAS-1994-KhoshnevisanA #commutative
- Mechanical Elimination of Commutative Redundancy (HK, MA), pp. 449–463.
- CADE-1994-Vigneron #commutative #constraints #deduction
- Associative-Commutative Deduction with Constraints (LV), pp. 530–544.
- ICALP-1993-OchmanskiW #on the
- On Regular Compatibility of Semi-Commutations (EO, PAW), pp. 445–456.
- RTA-1993-DelorP #commutative #order
- Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols (CD, LP), pp. 389–404.
- ICALP-1992-ClerboutRZ
- Semi-Commutations and Rational Expressions (MC, YR, WZ), pp. 113–125.
- STOC-1991-Nisan #bound #commutative
- Lower Bounds for Non-Commutative Computation (Extended Abstract) (NN), pp. 410–418.
- ICALP-1991-DiekertOR #complexity #confluence #decidability #on the
- On Confluent Semi-Commutations — Decidability and Complexity Results (VD, EO, KR), pp. 229–241.
- ICALP-1991-DuchampK #commutative #monad
- Lazard’s Factorizations of Free Partially Commutative Monoids (GD, DK), pp. 242–253.
- RTA-1991-BaaderN #algebra #commutative #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 #commutative #finite
- Any Gound Associative-Commutative Theory Has a Finite Canonical System (PN, MR), pp. 423–434.
- ICALP-1990-ClerboutLR #composition
- Decomposition of Partial Commutations (MC, ML, YR), pp. 501–511.
- CADE-1990-Basin #commutative #morphism #similarity
- Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators in Isomorphism Complete (DAB), pp. 251–260.
- VLDB-1989-Ioannidis #commutative #linear #recursion
- Commutativity and its Role in the Processing of Linear Recursion (YEI), pp. 155–163.
- STOC-1989-ChandraRRST #graph
- The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract) (AKC, PR, WLR, RS, PT), pp. 574–586.
- ICALP-1989-Perrin
- Partial Commutations (DP), pp. 637–651.
- RTA-1989-BairdPW #commutative #reduction #set
- Complete Sets of Reductions Modulo Associativity, Commutativity and Identity (TBB, GEP, RWW), pp. 29–44.
- RTA-1989-Lai #commutative #how #on the
- On How To Move Mountains “Associatively and Commutatively” (ML), pp. 187–202.
- ICALP-1988-Diekert #commutative #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 #commutative #summary #unification
- Adventures in Associative-Commutative Unification (A Summary) (PL, JC), pp. 358–367.
- ICALP-1987-Beaudry #commutative #testing
- Testing Membership in Commutative Transformation Semigroups (MB), pp. 542–549.
- ICALP-1987-Metivier #algorithm #automaton #graph
- An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs (YM), pp. 226–236.
- ICALP-1986-Metivier #commutative #monad #on the #set
- On Recognizable Subsets of Free Partially Commutative Monoids (YM), pp. 254–264.
- CADE-1986-BachmairD #termination
- Commutation, Transformation, and Termination (LB, ND), pp. 5–20.
- CADE-1986-GnaedigL #commutative #proving #term rewriting #termination
- Proving Termination of Associative Commutative Rewriting Systems by Rewriting (IG, PL), pp. 52–61.
- CADE-1986-PoratF #equation #term rewriting
- Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems (SP, NF), pp. 21–41.
- STOC-1985-Huynh #commutative #complexity #equivalence #problem #symmetry
- The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems (DTH), pp. 405–412.
- ICALP-1985-Kortelainen #commutative #regular expression
- Every Commutative Quasirational Language is Regular (JK), pp. 348–355.
- RTA-1985-Fortenbach #algebra #commutative #unification
- An Algebraic Approch to Unification Under Assoiativity and Commutativity (AF), pp. 381–397.
- RTA-1985-Kandri-RodyKN #algebra #approach #commutative #problem #unification
- An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras (AKR, DK, PN), pp. 345–364.
- CADE-1984-Fages #commutative #unification
- Associative-Commutative Unification (FF), pp. 194–208.
- CADE-1984-Stickel #case study #commutative #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 #commutative #protocol
- Compatibility and Commutativity in Non-two-phase Locking Protocols (CM, DSF, AS), pp. 283–292.
- ICALP-1980-Shamir #commutative #encryption #on the #power of
- On the Power of Commutativity in Cryptography (AS), pp. 582–595.
- STOC-1979-JaJa #commutative #complexity #on the
- On the Complexity of Bilinear Forms with Commutativity (JJ), pp. 197–208.
- ICALP-1979-Jeanrond #axiom #commutative #termination #theorem
- A Unique Termination Theorem for a Theory with Generalised Commutative Axioms (HJJ), pp. 316–330.
- STOC-1976-CardozaLM #commutative #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 #commutative #on the #problem
- On the Decision Problems of Program Schemas with Commutative and Invertable Functions (AKC), pp. 235–242.
- ICALP-1972-Kalman #commutative #linear
- Realization Theory of Linear Systems over a Commutative Ring (REK), pp. 61–65.