BibSLEIGH — combinator tag

combinator

combinator

Tag #combinator

339 papers:

CGO-2020-ShobakiKM #approach #gpu #optimisation #using: Optimizing occupancy and ILP on the GPU using a combinatorial approach (GS, AK, SM), pp. 133–144.
SANER-2019-MaJXLLLZ #learning #named #testing: DeepCT: Tomographic Combinatorial Testing for Deep Learning Systems (LM0, FJX, MX, BL0, LL0, YL0, JZ), pp. 614–618.
IFM-2019-BowlesC #approach #optimisation #problem: An Integrated Approach to a Combinatorial Optimisation Problem (JB, MBC), pp. 284–302.
ICML-2019-MoonAS #black box #optimisation #performance: Parsimonious Black-Box Adversarial Attacks via Efficient Combinatorial Optimization (SM, GA, HOS), pp. 4636–4645.
Onward-2019-WeiherH: Storage combinators (MW, RH), pp. 111–127.
PADL-2019-AndersenS #distributed #protocol: Distributed Protocol Combinators (KJAA, IS), pp. 169–186.
PADL-2019-Tarau #framework #proving #testing #theorem proving: A Combinatorial Testing Framework for Intuitionistic Propositional Theorem Provers (PT), pp. 115–132.
PLDI-2019-TonderG #lightweight #multi #parsing #syntax: Lightweight multi-language syntax transformation with parser parser combinators (RvT, CLG), pp. 363–378.
POPL-2019-Mellies #category theory #game studies #scheduling #semantics: Categorical combinatorics of scheduling and synchronization in game semantics (PAM), p. 30.
PPDP-2019-ValliappanR #category theory #exponential: Exponential Elimination for Bicartesian Closed Categorical Combinators (NV, AR), p. 13.
ESEC-FSE-2019-LinCLLZ #algorithm #generative #metaheuristic #performance #testing #towards: Towards more efficient meta-heuristic algorithms for combinatorial test generation (JL, SC, CL, QL, HZ0), pp. 212–222.
CADE-2019-BhayatR #strict #unification: Restricted Combinatory Unification (AB, GR), pp. 74–93.
AIIDE-2018-MoraesMLN #abstraction #multi: Action Abstractions for Combinatorial Multi-Armed Bandit Tree Search (ROM, JRHM, LHSL, MAN), pp. 74–80.
ICML-2018-BaptistaP #optimisation: Bayesian Optimization of Combinatorial Structures (RB, MP), pp. 471–480.
ICML-2018-Koriche #compilation #game studies #predict: Compiling Combinatorial Prediction Games (FK), pp. 2761–2770.
ICML-2018-LuCLLW #statistics #trade-off: The Edge Density Barrier: Computational-Statistical Tradeoffs in Combinatorial Inference (HL, YC, JL, HL0, ZW), pp. 3253–3262.
ICML-2018-RosenfeldBGS #learning: Learning to Optimize Combinatorial Functions (NR, EB, AG, YS), pp. 4371–4380.
ICML-2018-WangC: Thompson Sampling for Combinatorial Semi-Bandits (SW, WC), pp. 5101–5109.
PPDP-2018-BendkowskiL: Combinatorics of Explicit Substitutions (MB, PL), p. 12.
PPDP-2018-SakanashiS #constraints #optimisation #problem #sql: Transformation of Combinatorial Optimization Problems Written in Extended SQL into Constraint Problems (GS, MS), p. 13.
ASE-2018-MukelabaiNMBS #case study #configuration management #explosion #industrial: Tackling combinatorial explosion: a study of industrial needs and practices for analyzing highly configurable systems (MM, DN, SM, TB, JPS), pp. 155–166.
ESEC-FSE-2018-Tzoref-BrillM #co-evolution #modelling #testing: Modify, enhance, select: co-evolution of combinatorial models and test plans (RTB, SM), pp. 235–245.
ICSE-2018-MadalaDA #approach #behaviour: A combinatorial approach for exposing off-nominal behaviors (KM, HD, DA), pp. 910–920.
SLE-2018-BinsbergenSJ #flexibility #gll #parsing: GLL parsing with flexible combinators (LTvB, ES, AJ), pp. 16–28.
ESOP-2018-Matsuda0 #lens #named #programming #using: HOBiT: Programming Lenses Without Using Lens Combinators (KM, MW0), pp. 31–59.
ICTSS-2018-WotawaL #modelling #ontology #testing: From Ontologies to Input Models for Combinatorial Testing (FW, YL), pp. 155–170.
IJCAR-2018-AcclavioS #proving: From Syntactic Proofs to Combinatorial Proofs (MA, LS), pp. 481–497.
FSCD-2017-Czajka #confluence #logic: Confluence of an Extension of Combinatory Logic by Boolean Constants (LC0), p. 16.
FSCD-2017-Strassburger #normalisation: Combinatorial Flows and Their Normalisation (LS), p. 17.
ICML-2017-MuellerGJ #sequence: Sequence to Better Sequence: Continuous Revision of Combinatorial Structures (JM, DKG, TSJ), pp. 2536–2544.
KDD-2017-ZhangHMWZFGY #modelling #optimisation #order: A Taxi Order Dispatch Model based On Combinatorial Optimization (LZ, TH, YM, GW, JZ, PF, PG, JY), pp. 2151–2159.
ICSE-2017-Tzoref-BrillM #design #difference #modelling #semantics: Syntactic and semantic differencing for combinatorial models of test designs (RTB, SM), pp. 621–631.
ICST-2017-KleineS #named #testing: Coveringcerts: Combinatorial Methods for X.509 Certificate Testing (KK, DES), pp. 69–79.
ICTSS-2017-SimosBDGKLW #execution #framework #testing #using: Testing TLS Using Combinatorial Methods and Execution Framework (DES, JB, FD, BG, KK, YL, FW), pp. 162–177.
ICML-2016-BalkanskiMKS #learning: Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization (EB, BM, AK0, YS), pp. 2207–2216.
ICML-2016-LiWZC: Contextual Combinatorial Cascading Bandits (SL0, BW, SZ, WC), pp. 1245–1253.
KDD-2016-ShanHJWYM #modelling: Deep Crossing: Web-Scale Modeling without Manually Crafted Combinatorial Features (YS, TRH, JJ, HW, DY, JCM), pp. 255–262.
PEPM-2016-IzmaylovaAS #parsing: Practical, general parser combinators (AI, AA, TvdS), pp. 1–12.
ASE-2016-LiLKLG #big data #generative #testing: Applying combinatorial test data generation to big data applications (NL, YL, HRK, JL, YG), pp. 637–647.
ASE-2016-Tzoref-BrillWM #modelling #testing #visualisation: Visualization of combinatorial models and test plans (RTB, PW, SM), pp. 144–154.
ASE-2016-YamadaBAKC #generative #satisfiability #testing #using: Greedy combinatorial test case generation using unsatisfiable cores (AY, AB, CA, TK, EHC), pp. 614–624.
FSE-2016-ZhongZK #generative #testing: Combinatorial generation of structurally complex test inputs for commercial software applications (HZ, LZ, SK), pp. 981–986.
ICSE-2016-MirzaeiGBSM #android #testing #user interface: Reducing combinatorics in GUI testing of android applications (NM, JG, HB, AS, SM), pp. 559–570.
CASE-2016-Csiszar #approach #automation #equation #generative: A combinatorial approach to the automated generation of inverse kinematics equations for robot arms (AC), pp. 984–989.
ICST-2016-Segall #design #multi #testing: Repeated Combinatorial Test Design - Unleashing the Potential in Multiple Testing Iterations (IS), pp. 12–21.
ICTSS-2016-KampelS #algorithm #generative #testing: Set-Based Algorithms for Combinatorial Test Set Generation (LK, DES), pp. 231–240.
ICTSS-2016-SimosKGGL #approach #security #testing #web: A Combinatorial Approach to Analyzing Cross-Site Scripting (XSS) Vulnerabilities in Web Application Security Testing (DES, KK, LSGG, BG, YL), pp. 70–85.
TAP-2016-DuboisGG #proving #testing: Tests and Proofs for Enumerative Combinatorics (CD, AG, RG), pp. 57–75.
ICALP-v1-2015-HuangL #approximate #optimisation #probability #problem: Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (LH, JL), pp. 910–921.
ICALP-v1-2015-Yu #algorithm #matrix #multi: An Improved Combinatorial Algorithm for Boolean Matrix Multiplication (HY), pp. 1094–1105.
HOFM-2015-ZamanskyF #agile #design #towards: Helping the Tester Get It Right: Towards Supporting Agile Combinatorial Test Design (AZ, EF), pp. 35–42.
ICML-2015-WenKA #learning #performance #scalability: Efficient Learning in Large-Scale Combinatorial Semi-Bandits (ZW, BK, AA), pp. 1113–1122.
ICML-2015-WuGS #feedback #finite #identification #on the: On Identifying Good Options under Combinatorially Structured Feedback in Finite Noisy Environments (YW, AG, CS), pp. 1283–1291.
MoDELS-2015-MannaSG #specification #testing: Synthesizing tests for combinatorial coverage of modal scenario specifications (VPLM, IS, JG), pp. 126–135.
PADL-2015-Tarau #generative #logic programming #normalisation #on the #type inference: On Logic Programming Representations of λ Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization (PT), pp. 115–131.
PPDP-2015-Tarau #on the #representation: On a uniform representation of combinators, arithmetic, λ terms and types (PT), pp. 244–255.
ASE-2015-LinLCSH0 #algorithm #generative #metaheuristic #named #performance #testing: TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation (T) (JL, CL, SC, KS, DH, LZ), pp. 494–505.
ICSE-v1-2015-JiaCHP #generative #interactive #learning #testing #using: Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search (YJ, MBC, MH, JP), pp. 540–550.
SAC-2015-CalvagnaFT #case study #consistency #effectiveness #random #testing: Random versus combinatorial effectiveness in software conformance testing: a case study (AC, AF, ET), pp. 1797–1802.
DATE-2015-KriebelRSASH #analysis #configuration management #fault #named #performance: ACSEM: accuracy-configurable fast soft error masking analysis in combinatorial circuits (FK, SR, DS, PVA, MS, JH), pp. 824–829.
STOC-2015-BraunPZ #problem: Inapproximability of Combinatorial Problems via Small LPs and SDPs (GB, SP, DZ), pp. 107–116.
STOC-2015-ChanL #clustering #integer: Clustered Integer 3SUM via Additive Combinatorics (TMC, ML), pp. 31–40.
ICST-2015-YamadaKACOB #incremental #optimisation #satisfiability #testing: Optimization of Combinatorial Testing by Incremental SAT Solving (AY, TK, CA, EHC, YO, AB), pp. 1–10.
LATA-2014-DennunzioFM: Extremal Combinatorics of Reaction Systems (AD, EF, LM), pp. 297–307.
AIIDE-2014-ShakerA #approach #game studies #generative: Alone We Can Do So Little, Together We Can Do So Much: A Combinatorial Approach for Generating Game Content (NS, MAZ).
FDG-2014-GarbeRDWM #bound #visualisation: Author assistance visualizations for Ice-Bound, a combinatorial narrative (JG, AAR, MD, NWF, MM).
ICML-c2-2014-LinAKLC #feedback #game studies #linear #monitoring: Combinatorial Partial Monitoring Game with Linear Feedback and Its Applications (TL, BDA, RDK, JL, WC), pp. 901–909.
ICPR-2014-SmedtBTG #detection #multi: The Combinator: Optimal Combination of Multiple Pedestrian Detectors (FDS, KVB, TT, TG), pp. 3522–3527.
OOPSLA-2014-JonnalageddaCSRO #parsing #performance #staged: Staged parser combinators for efficient data processing (MJ, TC, SS, TR, MO), pp. 637–653.
PEPM-2014-KameyamaKS #code generation: Combinators for impure yet hygienic code generation (YK, OK, CcS), pp. 3–14.
PEPM-2014-PachecoHF #bidirectional #monad #programming: Monadic combinators for “Putback” style bidirectional programming (HP, ZH, SF), pp. 39–50.
SAS-2014-ToubhansCR #abstract domain #abstraction #memory management: An Abstract Domain Combinator for Separately Conjoining Memory Abstractions (AT, BYEC, XR), pp. 285–301.
ASE-2014-GuoZORCAA #optimisation #parallel #scalability: Scaling exact multi-objective combinatorial optimization by parallelization (JG, EZ, RO, DR, KC, SA, JMA), pp. 409–420.
SLE-2014-Ridge #context-free grammar #parsing #performance #using: Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle (TR), pp. 261–281.
LCTES-2014-LozanoCBS #optimisation: Combinatorial spill code optimization and ultimate coalescing (RCL, MC, GHB, CS), pp. 23–32.
STOC-2014-AggarwalDL: Non-malleable codes from additive combinatorics (DA, YD, SL), pp. 774–783.
ICST-2014-PapadakisHT #analysis #interactive #mutation testing #testing: Sampling Program Inputs with Mutation Analysis: Going Beyond Combinatorial Interaction Testing (MP, CH, YLT), pp. 1–10.
ICST-2014-WojciakT #case study #concurrent #maintenance #testing: System Level Combinatorial Testing in Practice — The Concurrent Maintenance Case Study (PW, RTB), pp. 103–112.
LICS-CSL-2014-AlurFR #string: Regular combinators for string transformations (RA, AF, MR), p. 10.
LICS-CSL-2014-BarceloM #graph #logic #word: Graph logics with rational relations: the role of word combinatorics (PB, PM), p. 10.
CIAA-J-2012-GocHS13 #automation #word: Automatic Theorem-Proving in Combinatorics on Words (DG, DH, JS), pp. 781–798.
ICALP-v1-2013-AvisT #complexity #on the: On the Extension Complexity of Combinatorial Polytopes (DA, HRT), pp. 57–68.
ICALP-v1-2013-DuanM #algorithm #linear #polynomial: A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market (RD, KM), pp. 425–436.
AIIDE-2013-Ontanon #game studies #multi #problem #realtime: The Combinatorial Multi-Armed Bandit Problem and Its Application to Real-Time Strategy Games (SO).
ECIR-2013-YasudaNHN #optimisation: Sub-sentence Extraction Based on Combinatorial Optimization (NY, MN, TH, MN), pp. 812–815.
ICML-c1-2013-ChenWY #framework #multi: Combinatorial Multi-Armed Bandit: General Framework and Applications (WC, YW, YY), pp. 151–159.
MLDM-2013-LiuLM #approach #lightweight #multi: A Lightweight Combinatorial Approach for Inferring the Ground Truth from Multiple Annotators (XL, LL, NDM), pp. 616–628.
SEKE-2013-DengWH #algorithm #identification #multi #using: Combining multiple stress identification algorithms using combinatorial fusion (YD, ZW, DFH), pp. 421–428.
SEKE-2013-QiHW #concurrent #source code #testing: A Mixed-way Combinatorial Testing for Concurrent Programs (XQ, JH, PW), pp. 699–702.
SEKE-2013-WangGZZX #array #generative #interactive #testing: Generating Partial Covering Array for Locating Faulty Interactions in Combinatorial Testing (ZW, TG, WZ, WZ, BX), pp. 578–583.
OOPSLA-2013-MillerHBO #generative #object-oriented #performance: Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization (HM, PH, EB, MO), pp. 183–202.
ASE-2013-NguyenT #automation #classification #dependence #testing: Automated inference of classifications and dependencies for combinatorial testing (DCN, PT), pp. 622–627.
ESEC-FSE-2013-KimMKBSBd #configuration management #dynamic analysis #lightweight #named #testing: SPLat: lightweight dynamic analysis for reducing combinatorics in testing configurable systems (CHPK, DM, SK, DSB, SS, PB, Md), pp. 257–267.
ESEC-FSE-2013-PetkeYCH #detection #fault #interactive #performance #testing: Efficiency and early fault detection with lower and higher strength combinatorial interaction testing (JP, SY, MBC, MH), pp. 26–36.
CASE-2013-Pan #problem #scheduling: A combinatorial auctions perspective on min-sum scheduling problems (YP), pp. 564–569.
STOC-2013-FeldmanGL #equilibrium: Combinatorial walrasian equilibrium (MF, NG, BL), pp. 61–70.
STOC-2013-KelnerOSZ #algorithm: A simple, combinatorial algorithm for solving SDD systems in nearly-linear time (JAK, LO, AS, ZAZ), pp. 911–920.
STOC-2013-LiY #approximate #optimisation #probability: Stochastic combinatorial optimization via poisson approximation (JL, WY), pp. 971–980.
ICST-2013-CalvagnaGV #interactive #testing: Combinatorial Interaction Testing with CITLAB (AC, AG, PV), pp. 376–382.
ICST-2013-YuLBKK #algorithm #constraints #generative #performance #testing: An Efficient Algorithm for Constraint Handling in Combinatorial Test Generation (LY, YL, MNB, RK, DRK), pp. 242–251.
ICST-2013-YuLKK #generative #named #testing: ACTS: A Combinatorial Test Generation Tool (LY, YL, RK, DRK), pp. 370–375.
AFL-J-2011-Blanchet-Sadri12 #algorithm #word: Algorithmic Combinatorics on Partial Words (FBS), pp. 1189–1206.
CIAA-2012-GocHS #automation #word: Automatic Theorem-Proving in Combinatorics on Words (DG, DH, JS), pp. 180–191.
RTA-2012-SeveriV #logic #set: Meaningless Sets in Infinitary Combinatory Logic (PS, FJdV), pp. 288–304.
ICFP-2012-Siederdissen #performance #programming: Sneaking around concatMap: efficient combinators for dynamic programming (CHzS), pp. 215–226.
ICML-2012-KiralyT #algebra #approach #matrix #rank: A Combinatorial Algebraic Approach for the Identifiability of Low-Rank Matrix Completion (FJK, RT), p. 100.
ICPR-2012-BougleuxDBGM #kernel #similarity: Shape similarity based on combinatorial maps and a tree pattern kernel (SB, FXD, LB, BG, MM), pp. 1602–1605.
LOPSTR-2012-SchrijversTWSS: An Introduction to Search Combinators (TS, GT, PW, HS, PJS), pp. 2–16.
ICSE-2012-SegallT #interactive #refinement #testing: Interactive refinement of combinatorial test plans (IS, RTB), pp. 1371–1374.
SAC-2012-ManciniFP #constraints #database #problem #relational #synthesis: Combinatorial problem solving over relational databases: view synthesis through constraint-based local search (TM, PF, JP), pp. 80–87.
FASE-2012-TrikiLBDB #modelling #testing: Model-Based Filtering of Combinatorial Test Suites (TT, YL, LdB, FD, JB), pp. 439–454.
FoSSaCS-2012-MazzaR #abstraction #interactive #modelling #symmetry: Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators (DM, NJR), pp. 316–330.
STOC-2012-KuperbergLP #probability: Probabilistic existence of rigid combinatorial structures (GK, SL, RP), pp. 1091–1106.
CSL-2012-DudderMRU #bound #logic: Bounded Combinatory Logic (BD, MM, JR, PU), pp. 243–258.
ICST-2012-BorazjanyYLKK #case study #testing: Combinatorial Testing of ACTS: A Case Study (MNB, LY, YL, RK, RK), pp. 591–600.
ICST-2012-CunninghamHH #analysis #testing: A System Analysis Study Comparing Reverse Engineered Combinatorial Testing to Expert Judgment (AMCJ, JDH, RJH), pp. 630–635.
ICST-2012-GargantiniV #interactive #named #testing: CITLAB: A Laboratory for Combinatorial Interaction Testing (AG, PV), pp. 559–568.
ICST-2012-GhandehariLXKK #identification #testing: Identifying Failure-Inducing Combinations in a Combinatorial Test Set (LSGG, YL, TX, DRK, RK), pp. 370–379.
ICST-2012-KruseBW #constraints #interactive #testing: Numerical Constraints for Combinatorial Interaction Testing (PMK, JB, JW), pp. 758–763.
ICST-2012-KuhnHLKL #sequence #testing: Combinatorial Methods for Event Sequence Testing (DRK, JMH, JL, RK, YL), pp. 601–609.
ICST-2012-RamlerKP #design #lessons learnt: Combinatorial Test Design in the TOSCA Testsuite: Lessons Learned and Practical Implications (RR, TK, WP), pp. 569–572.
ICST-2012-SaleckerG #grammarware #interactive #testing: Combinatorial Interaction Testing for Test Selection in Grammar-Based Testing (ES, SG), pp. 610–619.
ICST-2012-SegallTZ #modelling: Simplified Modeling of Combinatorial Test Spaces (IS, RTB, AZ), pp. 573–579.
ICST-2012-SegallTZ12a #modelling: Common Patterns in Combinatorial Models (IS, RTB, AZ), pp. 624–629.
ICST-2012-ShakyaXLLKK #classification #testing #using: Isolating Failure-Inducing Combinations in Combinatorial Testing Using Test Augmentation and Classification (KS, TX, NL, YL, RK, DRK), pp. 620–623.
ICST-2012-ZhangLZ #testing: Combinatorial Testing on ID3v2 Tags of MP3 Files (ZZ, XL, JZ), pp. 587–590.
ISSTA-2012-NguyenMT #effectiveness #generative #modelling #testing: Combining model-based and combinatorial testing for effective test case generation (CDN, AM, PT), pp. 100–110.
LICS-2012-Hoshino #call-by #semantics: Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects (NH), pp. 385–394.
SAT-2012-ErmonLGSD: SMT-Aided Combinatorial Materials Discovery (SE, RL, CPG, BS, RBvD), pp. 172–185.
ICSM-2011-KuhnK #detection #fault #testing: Practical combinatorial (t-way) methods for detecting complex faults in regression testing (RK, RK), p. 599.
DLT-J-2010-BrodaMMR11 #approach #automaton #complexity #on the: On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach (SB, AM, NM, RR), pp. 1593–1606.
ICALP-v1-2011-BodlaenderJK #analysis #kernel #preprocessor: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (HLB, BMPJ, SK), pp. 437–448.
RTA-2011-Rose #named #reduction: CRSX — Combinatory Reduction Systems with Extensions (KHR), pp. 81–90.
TLCA-2011-RehofU #finite #logic: Finite Combinatory Logic with Intersection Types (JR, PU), pp. 169–183.
Haskell-2011-BolingbrokeJV #termination: Termination combinators forever (MCB, SLPJ, DV), pp. 23–34.
ICFP-2011-AhnS #data type #induction #recursion: A hierarchy of mendler style recursion combinators: taming inductive datatypes with negative occurrences (KYA, TS), pp. 234–246.
ICML-2011-JegelkaB #online: Online Submodular Minimization for Combinatorial Structures (SJ, JAB), pp. 345–352.
MoDELS-2011-JohansenHF #feature model #modelling #product line #testing: Properties of Realistic Feature Models Make Combinatorial Testing of Product Lines Feasible (MFJ, ØH, FF), pp. 638–652.
PADL-2011-Brown #haskell #message passing: Combinators for Message-Passing in Haskell (NCCB), pp. 19–33.
PADL-2011-DevrieseP #domain-specific language #recursion #semiparsing: Explicitly Recursive Grammar Combinators — A Better Model for Shallow Parser DSLs (DD, FP), pp. 84–98.
ICSE-2011-ChenZ #metric #testing #tuple: Tuple density: a new metric for combinatorial test suites (BC, JZ), pp. 876–879.
SLE-2011-Wider #bidirectional #model transformation #scala #towards: Towards Combinators for Bidirectional Model Transformations in Scala (AW), pp. 367–377.
CASE-2011-KalyanasundaramLR #distributed #resource management: Fail-Stop Distributed Combinatorial Auctioning Systems with fair resource allocation (AK, RAKL, SR), pp. 181–188.
STOC-2011-Dobzinski: An impossibility result for truthful combinatorial auctions with submodular valuations (SD), pp. 139–148.
STOC-2011-DughmiRY #optimisation #random #towards: From convex optimization to randomized mechanisms: toward optimal combinatorial auctions (SD, TR, QY), pp. 149–158.
STOC-2011-GopalanMRZ #generative #pseudo: Pseudorandom generators for combinatorial shapes (PG, RM, OR, DZ), pp. 253–262.
CSL-2011-Czajka #approach #logic #semantics: A Semantic Approach to Illative Combinatory Logic (LC0), pp. 174–188.
ISSTA-2011-DumluYCP #adaptation #feedback #testing: Feedback driven adaptive combinatorial testing (ED, CY, MBC, AAP), pp. 243–253.
ISSTA-2011-SegallTF #design #diagrams #using: Using binary decision diagrams for combinatorial test design (IS, RTB, EF), pp. 254–264.
ICALP-v1-2010-BorodinL #design #on the: On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions (AB, BL), pp. 90–101.
SEFM-2010-LarsenLB #testing: Combinatorial Testing for VDM (PGL, KL, NB), pp. 278–285.
FLOPS-2010-ThiemannS #generative #polymorphism: Tag-Free Combinators for Binding-Time Polymorphic Program Generation (PT, MS), pp. 87–102.
ICFP-2010-Danielsson #parsing: Total parser combinators (NAD), pp. 285–296.
ICPR-2010-FoureyB #encoding #performance: Efficient Encoding of n-D Combinatorial Pyramids (SF, LB), pp. 1036–1039.
KDIR-2010-Molokov #identification: Application of Combinatorial Methods to Protein Identification in Peptide Mass Fingerprinting (LM), pp. 307–313.
KR-2010-PorelloE #linear #logic #modelling: Modelling Combinatorial Auctions in Linear Logic (DP, UE).
SEKE-2010-WangXCC #effectiveness #testing: Cost-Effective Combinatorial Test Case Prioritization for Varying Combination Weights (ZW, BX, LC, ZC), pp. 273–278.
LOPSTR-2010-DanvyZ #graph #reduction: Three Syntactic Theories for Combinatory Graph Reduction (OD, IZ), pp. 1–20.
PADL-2010-HafizF #attribute grammar #execution #lazy evaluation #specification: Lazy Combinators for Executable Specifications of General Attribute Grammars (RH, RAF), pp. 167–182.
PPDP-2010-Jeltsch #static typing #type checking: Generic record combinators with static type checking (WJ), pp. 143–154.
ICSE-2010-CohenU #design: Combinatorial test design in practice (MBC, SU), pp. 495–496.
GPCE-J-2007-FrisbyKWA10 #algebra: Constructing language processors with algebra combinators (NF, GK, PW, PA), pp. 543–572.
CASE-2010-BiswasN: An iterative auction mechanism for combinatorial exchanges (SB, YN), pp. 849–854.
STOC-2010-BayatiGT #approach #graph #random #scalability: Combinatorial approach to the interpolation method and scaling limits in sparse random graphs (MB, DG, PT), pp. 105–114.
LICS-2010-EndrullisHK #composition #fixpoint: Modular Construction of Fixed Point Combinators and Clocked Bohm Trees (JE, DH, JWK), pp. 111–119.
ICSM-2009-WangLSKKL #approach #graph #navigation #web: A combinatorial approach to building navigation graphs for dynamic web applications (WW, YL, SS, RK, RK, JL), pp. 211–220.
KDD-2009-BekkermanSV #clustering: Improving clustering stability with combinatorial MRFs (RB, MS, KV), pp. 99–108.
SOSP-2009-DunaganZS #graph #named #optimisation #using: Heat-ray: combating identity snowball attacks using machinelearning, combinatorial optimization and attack graphs (JD, AXZ, DRS), pp. 305–320.
TAP-2009-CalvagnaG #heuristic #interactive #satisfiability #testing: Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing (AC, AG), pp. 27–42.
ITiCSE-2008-ReyesM #education #game studies #java: Games developed in Java for teaching “Combinatorial Game Theory” (MR, ÁM), p. 359.
ITiCSE-2008-Rubio-Sanchez #equivalence #problem: An introduction to problem equivalence with combinatorics (MRS), p. 313.
ICALP-A-2008-BlellochVW #approach #graph #problem: A New Combinatorial Approach for Sparse Graph Problems (GEB, VV, RW), pp. 108–120.
ICALP-A-2008-ChristodoulouKS: Bayesian Combinatorial Auctions (GC, AK, MS), pp. 820–832.
ICALP-A-2008-FominV: Treewidth Computation and Extremal Combinatorics (FVF, YV), pp. 210–221.
ICALP-A-2008-PoratR #adaptation #testing: Explicit Non-adaptive Combinatorial Group Testing Schemes (EP, AR), pp. 748–759.
RTA-2008-Ketema #normalisation #on the #reduction: On Normalisation of Infinitary Combinatory Reduction Systems (JK), pp. 172–186.
RTA-2008-MazanekM #functional #graph #parsing: Functional-Logic Graph Parser Combinators (SM, MM), pp. 261–275.
GT-VMT-2008-MazanekM #graph #parsing: Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators (SM, MM).
PADL-2008-FrostHC #ambiguity #parsing #recursion: Parser Combinators for Ambiguous Left-Recursive Grammars (RAF, RH, PC), pp. 167–181.
CASE-2008-BandaruN #algorithm #composition #performance #web #web service: Efficient algorithms for combinatorial auctions with volume discounts arising in web service composition (PB, YN), pp. 995–1000.
CASE-2008-SrivastavaVK #using: Procurement of global logistics services using combinatorial auctions (NKS, NV, SK), pp. 297–302.
STOC-2008-Ben-AroyaT #graph #using: A combinatorial construction of almost-ramanujan graphs using the zig-zag product (ABA, ATS), pp. 325–334.
STOC-2008-ChenGP: Pricing combinatorial markets for tournaments (YC, SG, DMP), pp. 305–314.
STOC-2008-Meir: Combinatorial construction of locally testable codes (OM), pp. 285–294.
TAP-2008-CalvagnaG #approach #constraints #testing: A Logic-Based Approach to Combinatorial Testing with Constraints (AC, AG), pp. 66–83.
ICSM-2007-QuCW #case study #generative #interactive #testing: Combinatorial Interaction Regression Testing: A Study of Test Case Generation and Prioritization (XQ, MBC, KMW), pp. 255–264.
ICALP-2007-Colcombet #theorem: A Combinatorial Theorem for Trees (TC), pp. 901–912.
TLCA-2007-Mazza #abstraction #interactive #symmetry: Edifices and Full Abstraction for the Symmetric Interaction Combinators (DM), pp. 305–320.
IFL-2007-MazanekM #graph #parsing: Graph Parser Combinators (SM, MM), pp. 1–18.
ICEIS-J-2007-GujoS07a: Bid Formation in a Combinatorial Auction for Logistics Services (OG, MS), pp. 303–315.
ICEIS-SAIC-2007-GujoS #named: COMEX: Combinatorial Auctions for the Intra-Enterprise Exchange of Logistics Services (OG, MS), pp. 5–12.
POPL-2007-Lammel #scrap your boilerplate: Scrap your boilerplate with XPath-like combinators (RL), pp. 137–142.
ASE-2007-LedruDBVR #explosion #generative: Mastering combinatorial explosion with the tobias-2 test generator (YL, FD, LdB, SV, ER), pp. 535–536.
SAC-2007-ZengS #geometry #optimisation #problem: Semi-mechanization method for a unsolved optimization problem in combinatorial geometry (ZZ, MS), pp. 762–766.
GPCE-2007-WeaverKFA #algebra: Constructing language processors with algebra combinators (PW, GK, NF, PA), pp. 155–164.
CASE-2007-MohabeyNMSS #composition #web #web service: A Combinatorial Procurement Auction for QoS-Aware Web Services Composition (MM, YN, SM, PS, SVS), pp. 716–721.
DAC-2007-TaylorP #design #logic #optimisation #physics: Exact Combinatorial Optimization Methods for Physical Design of Regular Logic Bricks (BT, LTP), pp. 344–349.
FoSSaCS-2007-BertolissiK #calculus #reduction: The Rewriting Calculus as a Combinatory Reduction System (CB, CK), pp. 78–92.
STOC-2007-AroraK #approach #source code: A combinatorial, primal-dual approach to semidefinite programs (SA, SK), pp. 227–236.
STOC-2007-Basu #complexity #geometry: Combinatorial complexity in O-minimal geometry (SB), pp. 47–56.
LICS-2007-HarmerHM #category theory: Categorical Combinatorics for Innocent Strategies (RH, MH, PAM), pp. 379–388.
DLT-J-2005-LucaL06: Combinatorial Properties of Sturmian Palindromes (AdL, ADL), pp. 557–574.
DLT-2006-Shur #complexity: Factorial Languages of Low Combinatorial Complexity (AMS), pp. 397–407.
ICEIS-SAIC-2006-SchwindG #grid #resource management #using: Using Shadow Prices for Resource Allocation in a Combinatorial Grid with Proxy-Bidding Agents (MS, OG), pp. 11–18.
ICPR-v1-2006-FraileH #integration: Combinatorial Surface Integration (RF, ERH), pp. 59–62.
ASPLOS-2006-Solar-LezamaTBSS #finite #sketching #source code: Combinatorial sketching for finite programs (ASL, LT, RB, SAS, VAS), pp. 404–415.
DATE-2006-SoffkeZMG #analysis #approach #statistics: A signal theory based approach to the statistical analysis of combinatorial nanoelectronic circuits (OS, PZ, TM, MG), pp. 632–637.
HPDC-2006-LiuSW #approach #throughput: A High Throughput Approach to Combinatorial Search on Grids (YL, AMS, SW), pp. 351–352.
STOC-2006-DobzinskiNS #random: Truthful randomized mechanisms for combinatorial auctions (SD, NN, MS), pp. 644–652.
STOC-2006-Shapira #all about #graph: A combinatorial characterization of the testable graph properties: it’s all about regularity (NA, EF, IN, AS), pp. 251–260.
ICLP-2006-OrtizV #logic #natural language #using: Natural Language Processing Using Lexical and Logical Combinators (JFO, JV), pp. 444–446.
IJCAR-2006-UrbanB #data type #higher-order #recursion: A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL (CU, SB), pp. 498–512.
TestCom-2006-LammelS #grammarware #testing: Controllable Combinatorial Coverage in Grammar-Based Testing (RL, WS), pp. 19–38.
ICALP-2005-GairingMW #algorithm #approximate #parallel #performance #scheduling: A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines (MG, BM, AW), pp. 828–839.
ICALP-2005-Wegener #optimisation: Simulated Annealing Beats Metropolis in Combinatorial Optimization (IW), pp. 589–601.
RTA-2005-KetemaS #reduction: Infinitary Combinatory Reduction Systems (JK, JGS), pp. 438–452.
MLDM-2005-TakigawaKN #classification #product line #set #subclass: The Convex Subclass Method: Combinatorial Classifier Based on a Family of Convex Sets (IT, MK, AN), pp. 90–99.
SEKE-2005-LungZ #analysis #architecture #design: Application of Design Combinatorial Theory to Scenario-Based Software Architecture Analysis (CHL, MZ), pp. 418–423.
POPL-2005-FosterGMPS #approach #problem #program transformation: Combinators for bi-directional tree transformations: a linguistic approach to the view update problem (JNF, MBG, JTM, BCP, AS), pp. 233–246.
FoSSaCS-2005-Fiore #modelling: Mathematical Models of Computational and Combinatorial Structures (MPF), pp. 25–46.
STOC-2005-DobzinskiNS #algorithm #approximate: Approximation algorithms for combinatorial auctions with complement-free bidders (SD, NN, MS), pp. 610–618.
A-MOST-2005-LottJD #modelling #requirements #testing: Modeling requirements for combinatorial software testing (CML, AJ, SRD), pp. 37–43.
CHI-2004-LawH #analysis #testing #usability: Analysis of combinatorial user effect in international usability tests (ELCL, EÞH), pp. 9–16.
SAC-2004-LimaLS #category theory #haskell #multi: A back-end for GHC based on categorical multi-combinators (RMFL, RDL, ALMS), pp. 1482–1489.
FASE-2004-LedruBMB #testing: Filtering TOBIAS Combinatorial Test Suites (YL, LdB, OM, PB), pp. 281–294.
ICALP-2003-AgeevYZ #algorithm #approximate #problem: Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem (AAA, YY, JZ), pp. 145–156.
LOPSTR-2003-FlenerPA #modelling #problem #relational: Introducing esra, a Relational Language for Modelling Combinatorial Problems (PF, JP, MÅ), pp. 214–232.
PADL-2003-FernandezHS #constraints #functional #logic #problem: Solving Combinatorial Problems with a Constraint Functional Logic Language (AJF, MTHG, FSP), pp. 320–338.
SAT-2003-Kullmann: The Combinatorics of Conflicts between Clauses (OK), pp. 426–440.
IWPC-2002-DeursenV #comprehension #tool support #using #visitor: Building Program Understanding Tools Using Visitor Combinators (AvD, JV), pp. 137–146.
SCAM-2002-BunusF #declarative #equation #graph transformation #semantics: Semantics Guided Filtering of Combinatorial Graph Transformations in Declarative Equation-Based Languages (PB, PF), pp. 163–172.
KR-2002-Lang #representation: From Preference Representation to Combinatorial Vote (JL), pp. 277–290.
PADL-2002-LammelV #traversal: Typed Combinators for Generic Traversal (RL, JV), pp. 137–154.
DATE-2002-VicenteLH #optimisation: FPGA Placement by Thermodynamic Combinatorial Optimization (JdV, JL, RH), pp. 54–60.
STOC-2002-AdlemanCGHKER #optimisation #problem #self: Combinatorial optimization problems in self-assembly (LMA, QC, AG, MDAH, DK, PMdE, PWKR), pp. 23–32.
STOC-2002-ElkinK #algorithm #approximate #problem: Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem (ME, GK), pp. 438–447.
ICALP-2001-FerencziHZ: Combinatorics of Three-Interval Exchanges (SF, CH, LQZ), pp. 567–578.
ICALP-2001-RivalsR #string: Combinatorics of Periods in Strings (ER, SR), pp. 615–626.
ICALP-2001-SadakaneTT #algorithm #sequence: Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence (KS, NTC, TT), pp. 166–177.
DAC-2001-MajumdarW #satisfiability #using: Watermarking of SAT using Combinatorial Isolation Lemmas (RM, JLW), pp. 480–485.
DATE-2001-MinatoI #problem #scalability #streaming: Streaming BDD manipulation for large-scale combinatorial problems (SiM, SI), pp. 702–707.
CSL-2001-Akama #algebra #logic #towards #λ-calculus: Limiting Partial Combinatory Algebras towards Infinitary λ-Calculi and Classical Logic (YA), pp. 399–413.
WLC-2000-KelarevT #monad: A Combinatorial Property of Languages and Monoids (AVK, PGT), pp. 228–239.
RTA-2000-Statman #on the #problem #word: On the Word Problem for Combinators (RS), pp. 203–213.
PADL-2000-Schulte #concurrent #constraints #programming: Programming Deep Concurrent Constraint Combinators (CS), pp. 215–229.
STOC-2000-IwataFF #algorithm #polynomial: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (SI, LF, SF), pp. 97–106.
STOC-2000-OrlinSS #optimisation #precise: epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (JBO, ASS, SS), pp. 565–572.
CSL-2000-MakowskyM #complexity #generative #graph #on the: On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale (JAM, KM), pp. 399–410.
ICFP-1999-WallaceR #haskell #question #type system #xml: Haskell and XML: Generic Combinators or Type-Based Translation? (MW, CR), pp. 148–159.
PADL-1999-Kahl #concept #documentation #pretty-printing: Beyond Pretty-Printing: Galley Concepts in Document Formatting Combinators (WK), pp. 76–90.
SAC-1999-Haynes #adaptation #distributed #optimisation #problem: Distributed Collective Adaptation Applied to Hard Combinatorial Optimization Problem (TH), pp. 339–343.
STOC-1999-Indyk99a #design #symmetry: Inerpolation of Symmetric Functions and a New Type of Combinatorial Design (PI), pp. 736–740.
STOC-1999-Wayne #algorithm #polynomial: A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow (KDW), pp. 11–18.
CAV-1999-Bjesse #automation #pipes and filters #verification: Automatic Verification of Combinatorial and Pipelined FFT (PB), pp. 380–393.
ICALP-1998-Lu #generative #pseudo: Improved Pseudorandom Generators for Combinatorial Rectangles (CJL), pp. 223–234.
RTA-1998-Akama #algebra: SN Combinators and Partial Combinatory Algebras (YA), pp. 302–316.
AFP-1998-SwierstraAS98 #design #implementation: Designing and Implementing Combinator Languages (SDS, PRAA, JS), pp. 150–206.
ICFP-1998-Scholz #imperative #library #monad #programming: Imperative Streams — A Monadic Combinator Library for Synchronous Programming (ES), pp. 261–272.
IFL-1998-KoopmanP #parsing #performance: Efficient Combinator Parsers (PWMK, MJP), pp. 120–136.
LOPSTR-1998-HamfeltN #composition #induction #logic programming #source code #synthesis: Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes (AH, JFN), pp. 143–158.
SAC-1998-SandadlidisSR #evolution: A combinatorial evolution strategy for dynamic channel assignment in cellular radio (HGS, PPS, JRT), pp. 303–307.
ICALP-1997-MehlhornNU #framework #geometry #platform: The LEDA Platform of Combinatorial and Geometric Computing (KM, SN, CU), pp. 7–16.
RTA-1997-Statman #effectiveness #reduction: Effective Reduction and Conversion Strategies for Combinators (RS), pp. 299–307.
STOC-1997-BelingV #complexity: Combinatorial Complexity of the Central Curve (PAB, SV), pp. 250–255.
CADE-1997-Fuchs #evolution: Evolving Combinators (MF), pp. 416–430.
RTA-1996-BlooR #reduction: Combinatory Reduction Systems with Explicit Substitution that Preserve Strong Nomalisation (RB, KHR), pp. 169–183.
AFP-1996-SwierstraD96 #parsing: Deterministic, Error-Correcting Combinator Parsers (SDS, LD), pp. 184–207.
STOC-1996-Friedman: Computing Betti Numbers via Combinatorial Laplacians (JF), pp. 386–391.
LICS-1996-BethkeKV #algebra #normalisation: Completing Partial Combinatory Algebras With Unique Head-Normal Forms (IB, JWK, RCdV), pp. 448–454.
PODS-1995-Kolaitis #database #game studies: Combinatorial Games In Database Theory (PGK), pp. 231–232.
TLCA-1995-Dowek #comprehension #λ-calculus: λ-calculus, Combinators and the Comprehension Scheme (GD), pp. 154–170.
SAC-1995-ParkC #effectiveness #on the #optimisation #search-based: On the effectiveness of genetic search in combinatorial optimization (KP, BC), pp. 329–336.
STOC-1995-KargerP #constraints #multi #optimisation #problem: Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows (DRK, SAP), pp. 18–25.
SIGMOD-1994-WangCMSSZ: Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results (JTLW, GWC, TGM, BAS, DS, KZ), pp. 115–125.
POPL-1994-HondaY #mobile #process #representation: Combinatory Representation of Mobile Processes (KH, NY), pp. 348–360.
DAC-1994-PomeranzR #fault #scalability #using: Design-for-Testability for Path Delay Faults in Large Combinatorial Circuits Using Test-Points (IP, SMR), pp. 358–364.
ILPS-1994-BroomeL #calculus #logic programming: Combinatory Logic Programming: Computing in Relation Calculi (PB, JL), pp. 269–285.
ICML-1993-Mladenic #concept #induction #learning #optimisation: Combinatorial Optimization in Inductive Concept Learning (DM), pp. 205–211.
SAC-1993-RankinW #fixpoint #prolog #using: Finding Fixed Point Combinators Using Prolog (RR, RWW), pp. 604–608.
DAC-1993-Minato #problem #set: Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems (SiM), pp. 272–277.
STOC-1993-FelsnerW #algorithm #set: Maximum k-chains in planar point sets: combinatorial structure and algorithms (SF, LW), pp. 146–153.
STOC-1993-Karp #biology #problem: Mapping the genome: some combinatorial problems arising in molecular biology (RMK), pp. 278–285.
STOC-1993-LinialLSZ #performance #set: Efficient construction of a small hitting set for combinatorial rectangles in high dimension (NL, ML, MES, DZ), pp. 258–267.
CSL-1993-BergstraBP #algebra #process: Process Algebra with Combinators (JAB, IB, AP), pp. 36–65.
CADE-1992-DoughertyJ #approach #higher-order #logic: A Combinatory Logic Approach to Higher-order E-unification (DJD, PJ), pp. 79–93.
CADE-1992-FegarasSS #traversal: Uniform Traversal Combinators: Definition, Use and Properties (LF, TS, DWS), pp. 148–162.
CSL-1991-Meinke #data type #equation #specification: Equational Specification of Abstract Types and Combinators (KM), pp. 257–271.
LICS-1991-Statman #monad: Freyd’s Hierarchy of Combinator Monoids (RS), pp. 186–190.
SIGMOD-1989-Swami #heuristic #optimisation #query #scalability: Optimization of Large Join Queries: Combining Heuristic and Combinatorial Techniques (ANS), pp. 367–376.
ICALP-1989-EppsteinG #algorithm #parallel: Parallel Algorithmic Techniques for Combinatorial Computation (DE, ZG), pp. 304–318.
ICALP-1989-Toran #complexity: A Combinatorial Technique for Separating Counting Complexity Classes (JT), pp. 733–744.
PLDI-1989-KoopmanL #fresh look #graph #reduction: A Fresh Look at Combinator Graph Reduction (PJKJ, PL), pp. 110–119.
STOC-1989-ChazelleEGS #algorithm: Lines in Space-Combinatorics, Algorithms and Applications (BC, HE, LJG, MS), pp. 382–393.
ICALP-1988-EdelsbrunnerGPPSS #algorithm: Arrangements of Curves in the Plane — Topology, Combinatorics, and Algorithms (HE, LJG, JP, RP, RS, MS), pp. 214–229.
LFP-1988-Norman #hardware #performance #reduction #using: Faster Combinator Reduction Using stock Hardware (ACN), pp. 235–243.
STOC-1988-Yannakakis #linear #optimisation #problem #source code: Expressing Combinatorial Optimization Problems by Linear Programs (MY), pp. 223–228.
CADE-1988-WosM #automation #challenge #logic #problem #similarity #source code: Challenge Problems Focusing on Equality and Combinatory Logic: Evaluating Automated Theorem-Proving Programs (LW, WM), pp. 714–729.
RTA-1987-Sopena: Combinatorial Hypermap Rewriting (ES), pp. 62–73.
FPCA-1987-FairbairnW #automaton #lazy evaluation #named: TIM: A simple, lazy abstract machine to execute supercombinatorics (JF, SW), pp. 34–45.
FPCA-1987-Lins #category theory #multi: Categorical multi-combinators (RDL), pp. 60–79.
DAC-1987-Serlet #performance: Fast, Small, and Static Combinatorial CMOS Circuits (BS), pp. 451–458.
CFLP-1987-Piperno #abstraction #algorithm #logic: A Compositive Abstraction Algorithm for Combinatory Logic (AP), pp. 39–51.
CSL-1987-BohmP #finite #reduction #set: Surjectivity for Finite Sets of Combinators by Weak Reduction (CB, AP), pp. 27–43.
ICALP-1986-ArquesFGG #algorithm #approach #comparison #concurrent #database: Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach (DA, JF, MTG, PG), pp. 11–20.
LFP-1986-LemaitreCDDL #multi #performance #reduction: Mechanisms for Efficient Multiprocessor Combinator Reduction (ML, MC, MHD, GD, BL), pp. 113–121.
DAC-1986-NaharSS #optimisation: Simulated annealing and combinatorial optimization (SN, SS, ES), pp. 293–299.
ESOP-1986-Bellot #functional #named #programming #reduction: GRAAL: A Functional Programming System with Uncurryfied Combinators and its Reduction Machine (PB), pp. 82–98.
ESOP-1986-HankinBJ #approach #parallel #reduction: A Safe Approach to Parallel Combinator Reduction (CH, GLB, SLPJ), pp. 99–110.
CADE-1986-Gibert #functional #programming: The J-Machine: Functional Programming with Combinators (JG), pp. 683–684.
CADE-1986-Lins #execution: A New Formula for the Execution of Categorial Combinators (RDL), pp. 89–98.
LICS-1986-Statman #on the #problem: On Translating λ Terms into Combinators; The Basis Problem (RS), pp. 378–382.
ICALP-1985-Curien #category theory #logic: Categorical Combinatory Logic (PLC), pp. 130–139.
ICALP-1985-Jerrum #generative #random: Random Generation of Combinatorial Structures from a Uniform Distribution (MJ), pp. 290–299.
FPCA-1985-Brownbridge85: Cyclic Reference Counting for Combinator Machines (DRB), pp. 273–288.
FPCA-1985-HankinOS85 #architecture #named #reduction: COBWEB — A Combinator Reduction Architecture (CH, PO, MJS), pp. 99–112.
FPCA-1985-HudakG85 #parallel: Serial Combinators: “Optimal” Grains of Parallelism (PH, BG), pp. 382–399.
CAAP-1985-Curien #logic: Typed Categorial Combinatory Logic (PLC), pp. 157–172.
LFP-1984-HudakG #reduction: Experiments in Diffused Combinator Reduction (PH, BG), pp. 167–176.
LFP-1984-StoyeCN #agile #reduction: Some Practical Methods for Rapid Combinator Reduction (WRS, TJWC, ACN), pp. 159–166.
POPL-1984-HudakK #compilation #functional: A Combinator-Based Compiler for a Functional Language (PH, DAK), pp. 122–132.
POPL-1983-Wand #compilation: Loops in Combinator-Based Compilers (MW), pp. 190–196.
LFP-1982-Bohm #functional #programming: Combinatory Foundation of Functional Programming (CB), pp. 29–36.
LFP-1982-Hughes #implementation: Super Combinators: A New Implementation Method for Applicative Languages (RJMH), pp. 1–10.
LFP-1982-Jones: An Investigation of the Relative Efficiencies of Combinators and λ Expressions (SLPJ), pp. 150–158.
LFP-1982-MuchnickJ #evaluation: A Fixed-Program Machine for Combinator Expression Evaluation (SSM, NDJ), pp. 11–20.
STOC-1981-AdachiIK #complexity #game studies #low level: Low Level Complexity for Combinatorial Games (AA, SI, TK), pp. 228–237.
ICALP-1978-Zilli #logic #normalisation: Head Recurrent Terms in Combinatory Logic: A Generalization of the Notion of Head Normal Form (MVZ), pp. 477–493.
STOC-1978-Megiddo #optimisation: Combinatorial Optimization with Rational Objective Functions (NM), pp. 1–12.
VLDB-1977-Ikeda #evaluation: Evaluation of Combinatorial File Orgenization Schemes (HI), pp. 231–235.
ICALP-1977-AusielloDP #on the #problem #reduction: On the Structure of Combinatorial Problems and Structure Preserving Reductions (GA, AD, MP), pp. 45–60.
STOC-1977-ODonnell #equation #lisp #logic #program transformation #recursion: Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic (MO), pp. 295–305.
STOC-1975-EhrenfeuchtR75a #interactive #on the: On the (Combinatorial) Structure of L Languages without Interactions (AE, GR), pp. 137–144.
STOC-1975-EvenT #polynomial #problem: a Combinatorial Problem which is Complete in Polynomial Space (SE, RET), pp. 66–71.
STOC-1975-Paul #bound #complexity: A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions (WJP), pp. 27–36.
ICALP-1974-BohmD #equation #normalisation #problem: Combinatorial Problems, Combinator Equations and Normal Forms (CB, MDC), pp. 185–199.
DAC-1974-Los #approach #optimisation #programming: A combinatorial programming approach to the joint optimization of land use and transportation (ML), pp. 220–228.
STOC-1973-Johnson #algorithm #approximate #problem: Approximation Algorithms for Combinatorial Problems (DSJ), pp. 38–49.
SIGIR-1971-Gustafson #random: Elements of the Randomized Combinatorial File Structure (RAG), pp. 163–174.
SHARE-1966-Golomb #aspect-oriented #automation #design: Combinatorial aspects of automated designs (SWG).