BibSLEIGH — morphism tag

morphism

morphism

Tag #morphism

312 papers:

CGO-2020-ChengIBB #compilation #jit: Type freezing: exploiting attribute type monomorphism in tracing JIT compilers (LC, BI, CFBT, CB), pp. 16–29.
Haskell-2019-Devriese #approach #case study #composition #haskell #polymorphism #taxonomy #verification: Modular effects in Haskell through effect polymorphism and explicit dictionary applications: a new approach and the μVeriFast verifier as a case study (DD), pp. 1–14.
OOPSLA-2019-Nanevski0DF #concurrent #logic #simulation #source code #specification: Specifying concurrent programs in separation logic: morphisms and simulations (AN, AB0, GAD, IF), p. 30.
OOPSLA-2019-SiraichiSCP #quantum: Qubit allocation as a combination of subgraph isomorphism and token swapping (MYS, VFdS, CC, FMQP), p. 29.
POPL-2019-DunfieldK #bidirectional #polymorphism #rank: Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types (JD, NRK), p. 28.
ESOP-2019-BiXOS #composition #polymorphism #programming: Distributive Disjoint Polymorphism for Compositional Programming (XB, NX, BCdSO, TS), pp. 381–409.
ICFP-2018-HackettH #parametricity #polymorphism: Parametric polymorphism and operational improvement (JH, GH), p. 24.
ICFP-2018-OhoriUM #compilation #optimisation #polymorphism: Finitary polymorphism for optimizing type-directed compilation (AO, KU, HM), p. 29.
KDD-2018-DiPSC #learning: Transfer Learning via Feature Isomorphism Discovery (SD, JP, YS, LC), pp. 1301–1309.
PLDI-2018-SerranoHVJ #polymorphism: Guarded impredicative polymorphism (AS0, JH, DV, SPJ), pp. 783–796.
PPDP-2018-NadathurW #polymorphism #proving: Schematic Polymorphism in the Abella Proof Assistant (GN, YW), p. 13.
FDG-2017-Abuzuraiq #clustering #constraints #generative #graph #on the #using: On using graph partitioning with isomorphism constraint in procedural content generation (AMA), p. 10.
OOPSLA-2017-ZhangM #interface #named #polymorphism #product line: Familia: unifying interfaces, type classes, and family polymorphism (YZ, ACM), p. 31.
PLDI-2017-EisenbergJ #polymorphism: Levity polymorphism (RAE, SPJ), pp. 525–539.
POPL-2017-Crary #abstraction #parametricity #polymorphism: Modules, abstraction, and parametric polymorphism (KC), pp. 100–113.
POPL-2017-DolanM #polymorphism #type inference #type system: Polymorphism, subtyping, and type inference in MLsub (SD, AM), pp. 60–72.
POPL-2017-Levy: Contextual isomorphisms (PBL), pp. 400–414.
CC-2017-LiLX #execution #polymorphism #symbolic computation: Dynamic symbolic execution for polymorphism (LL, YL, JX), pp. 120–130.
ESOP-2017-AlpuimOS #polymorphism: Disjoint Polymorphism (JA, BCdSO, ZS), pp. 1–28.
CSL-2017-VerbitskyZ #complexity #first-order #on the: On the First-Order Complexity of Induced Subgraph Isomorphism (OV, MZ), p. 16.
ICFP-2016-CastroHS #parallel #pipes and filters #process #reasoning #using: Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms (DC, KH, SS), pp. 4–17.
ICML-2016-WeiWRC #network: Network Morphism (TW, CW, YR, CWC), pp. 564–572.
OOPSLA-2016-PetrashkoULO #graph #parametricity #polymorphism: Call graphs for languages with parametric polymorphism (DP, VU, OL, MO), pp. 394–409.
VLDB-2015-KimSHHC #query #rdf: Taming Subgraph Isomorphism for RDF Query Processing (JK, HS, WSH, SH, HC), pp. 1238–1249.
VLDB-2015-RenW #graph #scalability: Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs (XR, JW), pp. 617–628.
ICPC-2015-MilojkovicCLNRR #java #polymorphism #smalltalk: Polymorphism in the spotlight: studying its prevalence in Java and Smalltalk (NM, AC, MFL, ON, DR, RR), pp. 186–195.
SANER-2015-QiuSM #graph #identification #library #using: Library functions identification in binary code by using graph isomorphism testings (JQ, XS, PM), pp. 261–270.
CIAA-2015-HeamJ #automaton #generative #on the #random: On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism (PCH, JLJ), pp. 140–152.
ICALP-v1-2015-0001GR #graph: Counting Homomorphisms to Square-Free Graphs, Modulo 2 (AG, LAG, DR), pp. 642–653.
ICALP-v1-2015-BerkholzG #algebra #graph #testing: Limitations of Algebraic Approaches to Graph Isomorphism Testing (CB, MG), pp. 155–166.
ICALP-v1-2015-FominGKM #bound #graph #problem: Lower Bounds for the Graph Homomorphism Problem (FVF, AG, ASK, IM), pp. 481–493.
TLCA-2015-AtkeyGFRS #modelling #physics #polymorphism: Models for Polymorphism over Physical Dimension (RA, NG, FNF, TR, SS), pp. 45–59.
ICFP-2015-Dunfield #polymorphism: Elaborating evaluation-order polymorphism (JD), pp. 256–268.
ICFP-2015-ZilianiS #algorithm #coq #polymorphism #unification: A unification algorithm for Coq featuring universe polymorphism and overloading (BZ, MS), pp. 179–191.
DUXU-DD-2015-WuLLL #design #experience #interface #navigation: Skeuomorphism and Flat Design: Evaluating Users’ Emotion Experience in Car Navigation Interface Design (LW, TL, JL, BL), pp. 567–575.
ECOOP-2015-LongLR #polymorphism: Intensional Effect Polymorphism (YL, YDL, HR), pp. 346–370.
PEPM-2015-PoulsenMT #abstract interpretation #imperative #polymorphism: Imperative Polymorphism by Store-Based Types as Abstract Interpretations (CBP, PDM, PT), pp. 3–8.
POPL-2015-HinzeWG #recursion: Conjugate Hylomorphisms — Or: The Mother of All Structured Recursion Schemes (RH, NW, JG), pp. 527–538.
ICALP-v1-2014-KusumotoY #testing: Testing Forest-Isomorphism in the Adjacency List Model (MK, YY), pp. 763–774.
LATA-2014-Cerny #composition #multi #problem: Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms (AC), pp. 273–284.
LATA-2014-DasST #encoding #graph: Succinct Encodings of Graph Isomorphism (BD, PS, JT), pp. 285–296.
LATA-2014-MasseGHL #equation #word: Solving Equations on Words with Morphisms and Antimorphisms (ABM, SG, SH, ML), pp. 186–197.
FLOPS-2014-YallopW #lightweight #polymorphism: Lightweight Higher-Kinded Polymorphism (JY, LW), pp. 119–135.
ICGT-2014-RidderR #problem: The Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages (HNdR, NdR), pp. 192–206.
ICPR-2014-BaiRH #kernel #testing: A Hypergraph Kernel from Isomorphism Tests (LB, PR, ERH), pp. 3880–3885.
ICPR-2014-LuZXGW #approximate #quantum: Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk (KL, YZ, KX, YG, RCW), pp. 1413–1418.
PLDI-2014-GreenmanMT #bound #polymorphism: Getting F-bounded polymorphism into shape (BG, FM, RT), p. 12.
ESOP-2014-SlepakSM #polymorphism #rank: An Array-Oriented Language with Static Rank Polymorphism (JS, OS, PM), pp. 27–46.
LICS-CSL-2014-EndrullisH #on the: On periodically iterated morphisms (JE, DH), p. 10.
LICS-CSL-2014-Ilik #axiom #decidability: Axioms and decidability for type isomorphism in the presence of sums (DI), p. 7.
SMT-2014-BonichonDT #polymorphism: Extending SMT-LIB v2 with λ-Terms and Polymorphism (RB, DD, CT), pp. 53–62.
SIGMOD-2013-HanLL #database #graph #named #robust #scalability #towards: Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases (WSH, JL, JHL), pp. 337–348.
CSMR-2013-MihanceaM #correlation #fault #polymorphism #question: Changes, Defects and Polymorphism: Is There Any Correlation? (PFM, CM), pp. 341–344.
DLT-J-2012-LehtinenO13 #context-free grammar: Homomorphisms Preserving Deterministic Context-Free Languages (TL, AO), pp. 1049–1066.
ICALP-v1-2013-WimmerY #invariant #testing: Testing Linear-Invariant Function Isomorphism (KW, YY), pp. 840–850.
ICFP-2013-DunfieldK #bidirectional #polymorphism #rank: Complete and easy bidirectional typechecking for higher-rank polymorphism (JD, NRK), pp. 429–442.
DHM-HB-2013-KuzMMS #human-computer #industrial #interactive #using: Using Anthropomorphism to Improve the Human-Machine Interaction in Industrial Environments (Part I) (SK, MPM, SM, CMS), pp. 76–85.
DHM-HB-2013-MayerKS #human-computer #industrial #interactive #using: Using Anthropomorphism to Improve the Human-Machine Interaction in Industrial Environments (Part II) (MPM, SK, CMS), pp. 93–100.
OOPSLA-2013-UrecheTO #named #parametricity #polymorphism #trade-off: Miniboxing: improving the speed to code size tradeoff in parametric polymorphism translations (VU, CT, MO), pp. 73–92.
ESOP-2013-CairesPPT #behaviour #communication #parametricity #polymorphism: Behavioral Polymorphism and Parametricity in Session-Based Communication (LC, JAP, FP, BT), pp. 330–349.
FoSSaCS-2013-HofmannRS #pointer #source code: Pure Pointer Programs and Tree Isomorphism (MH, RR, US), pp. 321–336.
STOC-2013-ChenST #design #multi #testing: Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems (XC, XS, SHT), pp. 271–280.
CADE-2013-BlanchetteP #first-order #named #polymorphism: TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism (JCB, AP), pp. 414–420.
SAT-2013-Toran #complexity #graph #on the: On the Resolution Complexity of Graph Non-isomorphism (JT), pp. 52–66.
DocEng-2012-ChuangW #documentation #graph #xml: Structure-conforming XML document transformation based on graph homomorphism (TRC, HYW), pp. 99–102.
VLDB-2013-LeeHKL12 #algorithm #comparison #database #graph: An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases (JL, WSH, RK, JHL), pp. 133–144.
DLT-2012-LehtinenO #context-free grammar: Homomorphisms Preserving Deterministic Context-Free Languages (TL, AO), pp. 154–165.
ICALP-v1-2012-BabaiCQ #polynomial: Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups — (LB, PC, YQ), pp. 51–62.
LATA-2012-ArvindV #testing: Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits (VA, YV), pp. 83–94.
ICPR-2012-DahmBCG #detection: Topological features and iterative node elimination for speeding up subgraph isomorphism detection (ND, HB, TC, YG), pp. 1164–1167.
TOOLS-EUROPE-J-2011-IngesmanE12 #calculus #java #polymorphism: Lifted Java: A Minimal Calculus for Translation Polymorphism (MDI, EE), pp. 1–23.
SAC-2012-BenreguiaK #consistency #graph #problem: A consistency rule for graph isomorphism problem (BB, HK), pp. 906–911.
DAC-2012-HamzehSV #named #using: EPIMap: using epimorphism to map applications on CGRAs (MH, AS, SBKV), pp. 1284–1291.
DATE-2012-MeissnerMLH #framework #graph #performance #synthesis #testing: Fast isomorphism testing for a graph-based analog circuit synthesis framework (MM, OM, LL, LH), pp. 757–762.
STOC-2012-GroheM #graph #theorem: Structure theorem and isomorphism test for graphs with excluded topological subgraphs (MG, DM), pp. 173–192.
CSL-2012-Kuske #automation #linear #order: Isomorphisms of scattered automatic linear orders (DK), pp. 455–469.
AFL-2011-Kunimochi #algebra #petri net: Algebraic Properties of Petri Net Morphisms based on Place Connectivity (YK), pp. 270–284.
AFL-2011-PiaoSV: Tree Homomorphisms for Unranked Trees (XP, KS, SV), pp. 343–357.
ICALP-v2-2011-LohreyM #word: Isomorphism of Regular Trees and Words (ML, CM), pp. 210–221.
LATA-2011-Hadravova: The Block Structure of Successor Morphisms (JH), pp. 298–309.
ICFP-2011-CastagnaX #parametricity #polymorphism #type system: Set-theoretic foundation of parametric polymorphism and subtyping (GC, ZX), pp. 94–106.
ICFP-2011-GesbertGL #logic #parametricity #polymorphism #semantics #type system: Parametric polymorphism and semantic subtyping: the logical connection (NG, PG, NL), pp. 107–116.
ICFP-2011-MuM #functional #theorem: Generalising and dualising the third list-homomorphism theorem: functional pearl (SCM, AM), pp. 385–391.
OOPSLA-2011-AllenHKLRCS #composition #inheritance #multi #parametricity #polymorphism #type checking: Type checking modular multiple dispatch with parametric polymorphism and multiple inheritance (EEA, JH, SK, VL, SR, DC, GLSJ), pp. 973–992.
TOOLS-EUROPE-2011-IngesmanE #calculus #java #polymorphism: Lifted Java: A Minimal Calculus for Translation Polymorphism (MDI, EE), pp. 179–193.
ASE-2011-EdwardsBM #editing #tool support: Isomorphism in model tools and editors (GE, YB, NM), pp. 460–463.
ESEC-FSE-2011-HackettA #polymorphism: Inferring data polymorphism in systems code (BH, AA), pp. 332–342.
STOC-2011-AdsulGMS #algorithm #game studies #polynomial: Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm (BA, JG, RM, MAS), pp. 195–204.
CADE-2011-LiuL #performance #unification: Efficient General Unification for XOR with Homomorphism (ZL, CL), pp. 407–421.
CSL-2011-BernadetL #modelling #orthogonal #polymorphism: Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism (AB, SL), pp. 51–66.
LICS-2011-Clairambault #higher-order: Isomorphisms of Types in the Presence of Higher-Order References (PC), pp. 152–161.
SIGMOD-2010-ChengFL #named #network #privacy: K-isomorphism: privacy preserving network publication against structural attacks (JC, AWCF, JL), pp. 459–470.
VLDB-2010-FanLMWW #graph: Graph Homomorphism Revisited for Graph Matching (WF, JL, SM, HW, YW), pp. 1161–1172.
DLT-2010-HauboldLM #graph #problem #word: Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups (NH, ML, CM), pp. 218–230.
DLT-2010-ReidenbachS #ambiguity #strict: Restricted Ambiguity of Erasing Morphisms (DR, JCS), pp. 387–398.
ICALP-v1-2010-CaiCL #graph #theorem: Graph Homomorphisms with Complex Values: A Dichotomy Theorem (JyC, XC, PL), pp. 275–286.
ICALP-v2-2010-Laird #call-by #game studies #polymorphism #semantics: Game Semantics for Call-by-Value Polymorphism (JL), pp. 187–198.
ICPR-2010-PiroonratanaWUALC #identification #nondeterminism #ranking #symmetry #using: Identification of Ancestry Informative Markers from Chromosome-Wide Single Nucleotide Polymorphisms Using Symmetrical Uncertainty Ranking (TP, WW, TU, AA, CL, NC), pp. 2448–2451.
PEPM-2010-HofmannK #detection #problem #towards #using: I/O guided detection of list catamorphisms: towards problem specific use of program templates in IP (MH, EK), pp. 93–100.
SAS-2010-PredaGDCT #abstract interpretation #modelling: Modelling Metamorphism by Abstract Interpretation (MDP, RG, SKD, KC, GMT), pp. 218–235.
CSL-2010-KuskeLL #problem: The Isomorphism Problem for ω-Automatic Trees (DK, JL, ML), pp. 396–410.
LICS-2010-KuskeLL #automation #problem: The Isomorphism Problem on Classes of Automatic Structures (DK, JL, ML), pp. 160–169.
VLDB-2009-ZouCO09a #framework #named #network #privacy: K-Automorphism: A General Framework For Privacy Preserving Network Publication (LZ, LC, MTÖ), pp. 946–957.
ICALP-v1-2009-AminiFS: Counting Subgraphs via Homomorphisms (OA, FVF, SS), pp. 71–82.
PEPM-2009-RungtaM #model checking #polymorphism #source code: Guided model checking for programs with polymorphism (NR, EGM), pp. 21–30.
POPL-2009-Leijen #flexibility #polymorphism #robust #type inference: Flexible types: robust type inference for first-class polymorphism (DL), pp. 66–77.
POPL-2009-MorihataMHT #divide and conquer #theorem: The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer (AM, KM, ZH, MT), pp. 177–185.
SAC-2009-Tarau #data type #finite #haskell: Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell (PT), pp. 1898–1902.
SAC-2009-WangT #algorithm: An algorithm for optimal comma free codes with isomorphism rejection (HW, VDT), pp. 1007–1008.
ESOP-2009-StricklandTF #polymorphism: Practical Variable-Arity Polymorphism (TSS, STH, MF), pp. 32–46.
FoSSaCS-2009-BirkedalST #parametricity #polymorphism #recursion #semantics: Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types (LB, KS, JT), pp. 456–470.
STOC-2009-Guruswami: Artin automorphisms, cyclotomic function fields, and folded list-decodable codes (VG), pp. 23–32.
VLDB-2008-ShangZLY #algorithm #performance #testing #verification: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism (HS, YZ, XL, JXY), pp. 364–375.
AFL-2008-JurgensenM: Homomorphisms Preserving Types of Density (HJ, IM), pp. 183–194.
DLT-2008-BucciLL #on the #standard: On a Generalization of Standard Episturmian Morphisms (MB, AdL, ADL), pp. 158–169.
ICALP-A-2008-ChenTW #complexity #comprehension: Understanding the Complexity of Induced Subgraph Isomorphisms (YC, MT, MW), pp. 587–596.
LATA-2008-KitaevMS #order #word: Counting Ordered Patterns in Words Generated by Morphisms (SK, TM, PS), pp. 287–298.
LATA-2008-KlimaP: Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups (OK, LP), pp. 299–310.
ICFP-2008-Jones08a #functional #perspective #polymorphism #programming: Polymorphism and page tables: systems programming from a functional programmer’s perspective (MPJ), pp. 265–266.
ICFP-2008-Leijen #named #polymorphism #type inference: HMF: simple type inference for first-class polymorphism (DL), pp. 283–294.
ICFP-2008-VytiniotisWJ #haskell #named #polymorphism: FPH: first-class polymorphism for Haskell (DV, SW, SLPJ), pp. 295–306.
ICGT-2008-Heindel #category theory: Grammar Morphisms and Weakly Adhesive Categories (TH), pp. 493–495.
ICPR-2008-CosattoMGM: Grading nuclear pleomorphism on histological micrographs (EC, MM, HPG, JM), pp. 1–4.
CASE-2008-ZhangZLK #design #interactive #interface: Service robot anthropomorphism and interface design for emotion in human-robot interaction (TZ, BZ, LL, DK), pp. 674–679.
ESOP-2008-MatthewsA #exclamation #parametricity #polymorphism #runtime #theorem: Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices! (JM, AA), pp. 16–31.
FoSSaCS-2008-GodoyMT #decidability: Classes of Tree Homomorphisms with Decidable Preservation of Regularity (GG, SM, ST), pp. 127–141.
FoSSaCS-2008-Mishra-LingerS #polymorphism #type system: Erasure and Polymorphism in Pure Type Systems (NML, TS), pp. 350–364.
STOC-2008-BartoKN #complexity #graph #problem: Graphs, polymorphisms and the complexity of homomorphism problems (LB, MK, TN), pp. 789–796.
STOC-2008-DinurGKS #bound: Decodability of group homomorphisms beyond the johnson bound (ID, EG, SK, MS), pp. 275–284.
STOC-2008-KawarabayashiM #graph #linear: Graph and map isomorphism and all polyhedral embeddings in linear time (KiK, BM), pp. 471–480.
CSL-2008-Dezani-CiancagliniCGT #on the: On Isomorphisms of Intersection Types (MDC, RDC, EG, MT), pp. 461–477.
LICS-2008-LassenL #bisimulation #normalisation #parametricity #polymorphism: Typed Normal Form Bisimulation for Parametric Polymorphism (SBL, PBL), pp. 341–352.
CIAA-2007-SteinbyT: Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms (MS, CIT), pp. 265–276.
DLT-2007-FreydenbergerR #ambiguity: The Unambiguity of Segmented Morphisms (DDF, DR), pp. 181–192.
TLCA-2007-Nakazawa #proving #reduction: An Isomorphism Between Cut-Elimination Procedure and Proof Reduction (KN), pp. 336–350.
STOC-2007-MooreRS #algorithm #graph #on the #quantum: On the impossibility of a quantum sieve algorithm for graph isomorphism (CM, AR, PS), pp. 536–545.
CADE-2007-CouchotL #automation #deduction #polymorphism: Handling Polymorphism in Automated Deduction (JFC, SL), pp. 263–278.
DLT-2006-Krieger #fixpoint #on the: On Critical Exponents in Fixed Points of Non-erasing Morphisms (DK), pp. 280–291.
ICALP-v1-2006-DyerGP #graph #on the: On Counting Homomorphisms to Directed Acyclic Graphs (MED, LAG, MP), pp. 38–49.
ICALP-v1-2006-GroheV #game studies #graph #parallel #testing: Testing Graph Isomorphism in Parallel by Playing a Game (MG, OV), pp. 3–14.
ICALP-v2-2006-DelauneLLT #analysis #protocol: Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or (SD, PL, DL, RT), pp. 132–143.
ICALP-v2-2006-Mogelberg #formal method #modelling #parametricity #polymorphism: Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism (REM), pp. 372–383.
ICFP-2006-NanevskiMB #hoare #polymorphism #type system: Polymorphism and separation in hoare type theory (AN, GM, LB), pp. 62–73.
PPDP-2006-NguyenO #compilation #layout #ml #polymorphism: Compiling ML polymorphism with explicit layout bitmap (HDN, AO), pp. 237–248.
ESOP-2006-SummersB #calculus #polymorphism: Approaches to Polymorphism in Classical Sequent Calculus (AJS, SvB), pp. 84–99.
STOC-2006-HallgrenMRRS #graph #quantum: Limitations of quantum coset states for graph isomorphism (SH, CM, MR, AR, PS), pp. 604–617.
IJCAR-2006-JiaZ #finite: A Powerful Technique to Eliminate Isomorphism in Finite Model Search (XJ, JZ), pp. 318–331.
ITiCSE-2005-BerginWCGK #education #polymorphism: Teaching polymorphism early (JB, EW, MEC, MG, MK), pp. 342–343.
ICSM-2005-Demeyer #performance #polymorphism #question #what: Refactor Conditionals into Polymorphism: What’s the Performance Cost of Introducing Virtual Calls? (SD), pp. 627–630.
DLT-J-2004-Rampersad05 #word: Words avoiding 7/3-powers and the thue-morse morphism (NR), pp. 755–766.
DLT-2005-AlloucheS #strict: Restricted Towers of Hanoi and Morphisms (JPA, AS), pp. 1–10.
RTA-2005-LafourcadeLT #deduction #equation: Intruder Deduction for AC-Like Equational Theories with Homomorphisms (PL, DL, RT), pp. 308–322.
ICFP-2005-MakholmW #mixin #type inference: Type inference, principal typings, and let-polymorphism for first-class mixin modules (HM, JBW), pp. 156–167.
SEKE-2005-LucanuLD #owl: Institution Morphisms for Relating OWL and Z (DL, YFL, JSD), pp. 286–291.
OOPSLA-2005-OanceaW #architecture #component #parametricity #polymorphism: Parametric polymorphism for software component architectures (CEO, SMW), pp. 147–166.
POPL-2005-HosoyaFC #parametricity #polymorphism #xml: Parametric polymorphism for XML (HH, AF, GC), pp. 50–62.
CSL-2005-CollinsonPR #on the #polymorphism: On Bunched Polymorphism (MC, DJP, ER), pp. 36–50.
PODS-2004-AtseriasDK #on the #query: On Preservation under Homomorphisms and Unions of Conjunctive Queries (AA, AD, PGK), pp. 319–329.
DLT-2004-Rampersad #word: Words Avoiding 7/3-Powers and the Thue-Morse Morphism (NR), pp. 357–367.
ICPR-v4-2004-CongEPB #equation #using: Shape Metamorphism using p-Laplacian Equation (GC, ME, BP, GB), pp. 15–18.
POPL-2004-Fiore #polynomial #recursion: Isomorphisms of generic recursive polynomial types (MPF), pp. 77–88.
DATE-v2-2004-GoudarziHM #implementation #modelling #object-oriented #polymorphism: Overhead-Free Polymorphism in Network-on-Chip Implementation of Object-Oriented Models (MG, SH, AM), pp. 1380–1381.
ESOP-2004-Thielecke #call-by #continuation #polymorphism: Answer Type Polymorphism in Call-by-Name Continuation Passing (HT), pp. 279–293.
STOC-2004-Fischer #graph #testing: The difficulty of testing for isomorphism against a graph that is given in advance (EF), pp. 391–397.
STOC-2004-ShpilkaW #testing: Derandomizing homomorphism testing in general groups (AS, AW), pp. 427–435.
ICFP-2003-WashburnW #encoding #higher-order #parametricity #polymorphism #syntax: Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism (GW, SW), pp. 249–262.
POPL-2003-ZibinGC #algorithm #performance: Efficient algorithms for isomorphisms of simple types (YZ, JYG, JC), pp. 160–171.
ICSE-2003-RountevMR #analysis #java #polymorphism #testing: Fragment Class Analysis for Testing of Polymorphism in Java Software (AR, AM, BGR), pp. 210–220.
GPCE-2003-JarviWL #concept #polymorphism: Concept-Controlled Polymorphism (JJ, JW, AL), pp. 228–244.
FoSSaCS-2003-AbramskyJ #game studies #polymorphism #semantics: A Game Semantics for Generic Polymorphism (SA, RJ), pp. 1–22.
CADE-2003-AnantharamanNR #unification: Unification Modulo ACU I Plus Homomorphisms/Distributivity (SA, PN, MR), pp. 442–457.
LICS-2003-FederV: Homomorphism Closed vs. Existential Positive (TF, MYV), pp. 311–320.
ICFP-2002-NeubauerT #higher-order #polymorphism: Type classes with more higher-order polymorphism (MN, PT), pp. 179–190.
PPDP-2002-Shafarenko #type inference #type system: Coercion as homomorphism: type inference in a system with subtyping and overloading (AVS), pp. 14–25.
LCTES-SCOPES-2002-HuKVISZ #polymorphism: Compiler-directed cache polymorphism (JSH, MTK, NV, MJI, HS, WZ), pp. 165–174.
CSL-2002-BohlerHRV #constraints #equivalence: Equivalence and Isomorphism for Boolean Constraint Satisfaction (EB, EH, SR, HV), pp. 412–426.
ICLP-2002-CoqueryF #named #parametricity #polymorphism #type system: TCLP: Overloading, Subtyping and Parametric Polymorphism Made Practical for CLP (EC, FF), p. 480.
LICS-2002-FioreCB #λ-calculus: Remarks on Isomorphisms in Typed λ Calculi with Empty and Sum Types (MPF, RDC, VB), p. 147–?.
SAT-2002-BueningX #complexity #satisfiability: The complexity of homomorphisms and renamings of minimal unsatisfiable formulas (HKB, DX), p. 9.
SCAM-2001-ByersK #parametricity #polymorphism #slicing: Static Slicing and Parametric Polymorphism (DB, MK), pp. 181–186.
DLT-2001-HalavaH: An Undecidability Result Concerning Periodic Morphisms (VH, TH), pp. 304–310.
ICALP-2001-HarjuIKS: Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages (TH, OHI, JK, AS), pp. 579–590.
TLCA-2001-MurawskiO #evolution #game studies #polymorphism: Evolving Games and Essential Nets for Affine Polymorphism (ASM, CHLO), pp. 360–375.
ECOOP-2001-Ernst #polymorphism #product line: Family Polymorphism (EE), pp. 303–326.
SAC-2001-Viroli #implementation #java #parametricity #performance #polymorphism: Parametric polymorphism in Java: an efficient implementation for parametric methods (MV), pp. 610–619.
FoSSaCS-2001-BartheP #dependent type #proving #reuse #type system: Type Isomorphisms and Proof Reuse in Dependent Type Theory (GB, OP), pp. 57–71.
IFL-2000-GustavssonS #analysis #bound #polymorphism #type system: A Usage Analysis with Bounded Usage Polymorphism and Subtyping (JG, JS), pp. 140–157.
ICPR-v2-2000-BartoliPSZ #graph #using: Attributed Tree Homomorphism Using Association Graphs (MB, MP, KS, SWZ), pp. 2133–2136.
ICPR-v2-2000-PerchantB #fuzzy #graph: Graph Fuzzy Homomorphism Interpreted as Fuzzy Association Graphs (AP, IB), pp. 6042–6045.
OOPSLA-2000-ViroliN #approach #java #parametricity #polymorphism: Parametric polymorphism in Java: an approach to translation based on reflective features (MV, AN), pp. 146–165.
AdaEurope-2000-LinM #polymorphism: (True) Polymorphism in SPARK2000 (TML, JAM), pp. 252–265.
PPDP-2000-KollerM #abstract interpretation #component #performance #using: Efficient abstract interpretation using component-wise homomorphisms (JK, MM), pp. 226–234.
STOC-2000-Grohe #graph #testing: Isomorphism testing for embeddable graphs through definability (MG), pp. 63–72.
ICALP-1999-BednarczykB #petri net: General Morphisms of Petri Nets (MAB, AMB), pp. 190–199.
TLCA-1999-Fujita #call-by #polymorphism #λ-calculus #μ-calculus: Explicitly Typed λμ-Calculus for Polymorphism an Call-by-Value (KeF), pp. 162–176.
TLCA-1999-Ohori #compilation #execution: A Curry-Howard Isomorphism for Compilation and Program Execution (AO), pp. 280–294.
FLOPS-1999-Ohori #automaton #logic: The Logical Abstract Machine: A Curry-Howard Isomorphism for Machine Code (AO), pp. 300–318.
ICFP-1999-OhoriY #compilation #ml #polymorphism #rank #type inference: Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML (AO, NY), pp. 160–171.
OOPSLA-1999-RinatMS #object-oriented #polymorphism: Correspondence Polymorphism for Object-Oriented Languages (RR, MM, SFS), pp. 167–186.
ICSE-1999-BenlarbiM #metric #polymorphism #predict #risk management: Polymorphism Measures for Early Risk Prediction (SB, WLM), pp. 334–344.
STOC-1999-KlivansM #graph #polynomial #proving: Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses (AK, DvM), pp. 659–667.
STOC-1999-Luks #equivalence: Hypergraph Isomorphism and Structural Equivalence of Boolean Functions (EML), pp. 652–658.
CSL-1999-BalatC #linear #logic: A Linear Logical View of Linear Type Isomorphisms (VB, RDC), pp. 250–265.
PODS-1998-Etessami #first-order: Dynamic Tree Isomorphism via First-Order Updates (KE), pp. 235–243.
AFP-1998-Augusteijn98 #sorting: Sorting Morphisms (LA), pp. 1–27.
ICFP-1998-CraryWM #polymorphism #semantics: Intensional Polymorphism in Type-Erasure Semantics (KC, SW, JGM), pp. 301–312.
OOPSLA-1998-Litvinov #polymorphism #static typing #towards #type system: Contraint-Based Polymorphism in Cecil: Towards a Practical and Static Type System (VL), pp. 388–411.
OOPSLA-1998-SolorzanoA #java #parametricity #polymorphism: Parametric Polymorphism for Java: A Reflective Solution (JS, SA), pp. 216–225.
POPL-1998-Schubert #higher-order #polymorphism #type inference #unification: Second-Order Unification and Type Inference for Church-Style Polymorphism (AS), pp. 279–288.
SAS-1998-Duggan #finite #polymorphism #type inference #type system: Finite Subtype Inference with Explicit Polymorphism (DD), pp. 295–310.
CSL-1998-Statman: Morphisms and Partitions of V-sets (RS), pp. 313–322.
TOOLS-ASIA-1997-PengCC #analysis #multi #performance #polymorphism: The Implement Mechanism and Efficiency Analysis of Multiinheritance and Polymorphism (RP, JC, SC), pp. 389–392.
TOOLS-PACIFIC-1997-NayaNYHOA #development #execution #object-oriented #optimisation #polymorphism: Object-Oriented Development Based on Polymorphism Patterns and Optimization to Reduce Executable Code Size (HN, FN, TY, LH, KO, MA), pp. 68–79.
POPL-1997-Jones #polymorphism #type inference: First-class Polymorphism with Type Inference (MPJ), pp. 483–496.
ICSE-1997-TonellaAFM #analysis #c++ #pointer #polymorphism #slicing: Flow Insensitive C++ Pointers and Polymorphism Analysis and its Application to Slicing (PT, GA, RF, EM), pp. 433–443.
TACAS-1997-BeeckBCDFKMSS #graph #polymorphism #power of: Graphs in METAFrame: The Unifying Power of Polymorphism (MvdB, VB, AC, AD, CF, DK, TMS, FS, BS), pp. 112–129.
TAPSOFT-1997-Liang: Let-Polymorphism and Eager Type Schemes (CL), pp. 490–501.
ICALP-1996-Luca #on the #standard: On Standard Sturmian Morphisms (AdL), pp. 403–415.
ICALP-1996-MitchellV #effectiveness #modelling #polymorphism #recursion #type system: Effective Models of Polymorphism, Subtyping and Recursion (JCM, RV), pp. 170–181.
ICFP-1996-HuIT #recursion: Deriving Structural Hylomorphisms From Recursive Definitions (ZH, HI, MT), pp. 73–82.
ECOOP-1996-RinatM #polymorphism #reuse: Metaphoric Polymorphism: Taking Code Reuse One Step Further (RR, MM), pp. 449–471.
PLILP-1996-AponteC: Type Isomorphisms for Module Signatures (MVA, RDC), pp. 334–346.
PLILP-1996-LouvetR #parametricity #polymorphism #prolog: Parametric Polymorphism for Typed Prolog and λ-Prolog (PL, OR), pp. 47–61.
POPL-1996-FegarasS #data type #embedded #source code: Revisiting Catamorphisms over Datatypes with Embedded Functions (or, Programs from Outer Space) (LF, TS), pp. 284–294.
STOC-1996-Spielman #graph #performance #testing: Faster Isomorphism Testing of Strongly Regular Graphs (DAS), pp. 576–584.
DLT-1995-KariT: Morphisms and Associated Congruences (LK, GT), pp. 119–128.
TLCA-1995-BellucciAC #parametricity #polymorphism: A Model for Formal Parametric Polymorphism: A PER Interpretation for System R (RB, MA, PLC), pp. 32–46.
TLCA-1995-CosmoP #polymorphism: Expanding Extensional Polymorphism (RDC, AP), pp. 139–153.
AFP-1995-Jones95 #functional #higher-order #polymorphism #programming: Functional Programming with Overloading and Higher-Order Polymorphism (MPJ), pp. 97–136.
ECOOP-1995-Agesen #algorithm #parametricity #polymorphism #precise #type inference: The Cartesian Product Algorithm: Simple and Precise Type Inference Of Parametric Polymorphism (OA), pp. 2–26.
OOPSLA-1995-DayGLM #parametricity #polymorphism #type system: Subtypes vs. Where Clauses: Constraining Parametric Polymorphism (MD, RG, BL, ACM), pp. 156–168.
POPL-1995-DuboisRW #polymorphism: Generic Polymorphism (CD, FR, PW), pp. 118–129.
POPL-1995-HarperM #analysis #compilation #polymorphism #using: Compiling Polymorphism Using Intensional Type Analysis (RH, JGM), pp. 130–141.
SAC-1995-AbualiWS95a #algorithm #problem #search-based #using: Solving the three-star tree isomorphism problem using genetic algorithms (FNA, RLW, DAS), pp. 337–344.
TAPSOFT-1995-Wacrenier: Semi-Trace Morphisms and Rational Transductions (PAW), pp. 303–317.
SAS-1994-Agesen #constraints #parametricity #polymorphism #type inference: Constraint-Based Type Inference and Parametric Polymorphism (OA), pp. 78–100.
SAC-1994-StansiferW #polymorphism #re-engineering: Type reconstruction for coercion polymorphism (RS, DW), pp. 420–424.
ESOP-1994-JayC #polymorphism: Shapely Types and Shape Polymorphism (CBJ, JRBC), pp. 302–316.
ESOP-1994-Kahrs #ml #polymorphism: First-Class Polymorphism for ML (SK), pp. 333–347.
ESOP-1994-OHearnR #parametricity #polymorphism: Fully Abstract Translations and Parametric Polymorphism (PWO, JGR), pp. 454–468.
LICS-1994-RobinsonR #graph #parametricity #polymorphism #reflexive: Reflexive Graphs and Parametric Polymorphism (EPR, GR), pp. 364–371.
ICALP-1993-Lepisto #on the #power of: On the Power of Periodic Iteration of Morphisms (AL), pp. 496–506.
TLCA-1993-Pierce #bound #polymorphism: Intersection Types and Bounded Polymorphism (BCP), pp. 346–360.
TLCA-1993-PlotkinA #logic #parametricity #polymorphism: A Logic for Parametric Polymorphism (GDP, MA), pp. 361–375.
FPCA-1993-Jones #higher-order #polymorphism: A System of Constructor Classes: Overloading and Implicit Higher-Order Polymorphism (MPJ), pp. 52–64.
TOOLS-PACIFIC-1993-DongD #polymorphism: Class Union and Polymorphism (JSD, RD), pp. 181–190.
POPL-1993-AbadiCC #parametricity #polymorphism: Formal Parametric Polymorphism (MA, LC, PLC), pp. 157–170.
POPL-1993-HarperL #continuation #polymorphism: Explicit Polymorphism and CPS Conversion (RH, ML), pp. 206–219.
POPL-1993-Leroy #continuation #polymorphism: Polymorphism by Name for References and Continuations (XL), pp. 220–231.
POPL-1993-Reynolds #logic #parametricity #polymorphism #tutorial: An Introduction to Logical Relations and Parametric Polymorphism — Tutorial (JCR), pp. 155–156.
DAC-1993-OhlrichEGS #algorithm #identification #named #performance #using: SubGemini: Identifying SubCircuits using a Fast Subgraph Isomorphism Algorithm (MO, CE, EG, LS), pp. 31–37.
CHI-1992-DonBLS #named: Anthropomorphism: From Eliza to Terminator 2 (AD, SB, BL, BS), pp. 67–70.
POPL-1992-BruceM #higher-order #modelling #polymorphism #recursion #type system: PER Models of Subtyping, Recursive Types and Higher-Order Polymorphism (KBB, JCM), pp. 316–327.
POPL-1992-Cosmo #framework: Type Isomorphisms in a Type-Assignment Framework (RDC), pp. 200–210.
ICALP-1991-HonkalaS #ambiguity #bound: L Morphisms: Bounded Delay and Regularity of Ambiguity (JH, AS), pp. 566–574.
RTA-1991-BaaderN #algebra #commutative #equation #how #unification: Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification (FB, WN), pp. 124–135.
FPCA-1991-AdityaN #incremental #polymorphism: Incremental Polymorphism (SA, RSN), pp. 379–405.
FPCA-1991-Thatte: Coercive Type Isomorphism (SRT), pp. 29–49.
LICS-1991-KiferW #first-order #logic programming #polymorphism: A First-Order Theory of Types and Polymorphism in Logic Programming (MK, JW), pp. 310–321.
LFP-1990-Leivant #polymorphism: Discrete Polymorphism (DL), pp. 288–297.
GG-1990-Kennaway #category theory #graph grammar: Graph Rewriting in Some Categories of Partial Morphisms (RK), pp. 490–504.
CADE-1990-Basin #commutative #similarity: Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators in Isomorphism Complete (DAB), pp. 251–260.
LICS-1990-AbadiP #polymorphism #recursion: A Per Model of Polymorphism and Recursive Types (MA, GDP), pp. 355–365.
LICS-1990-RobinsonR #call-by #polymorphism #set: Polymorphism, Set Theory, and Call-by-Value (ER, GR), pp. 12–18.
FPCA-1989-CanningCHOM #bound #object-oriented #polymorphism #programming: F-Bounded Polymorphism for Object-Oriented Programming (PSC, WRC, WLH, WGO, JCM), pp. 273–280.
FPCA-1989-Ohori #ml #polymorphism #semantics: A Simple Semantics for ML Polymorphism (AO), pp. 281–292.
SEKE-1989-WuCZT #identification #novel #query #subclass: A Novel Way 1o Identify IneguaIity Query Subclasses Which possess the Homomorphism Property (TW, JLC, NZ, KT), pp. 158–163.
POPL-1989-Meseguer #modelling #polymorphism: Relating Models of Polymorphism (JM), pp. 228–241.
POPL-1989-WadlerB #ad hoc #how #polymorphism: How to Make ad-hoc Polymorphism Less ad-hoc (PW, SB), pp. 60–76.
CCIPL-1989-HarperP #ambiguity #calculus #polymorphism #type checking: Type Checking, Universe Polymorphism, and Typical Ambiguity in the Calculus of Constructions (Draft) (RH, RP), pp. 241–256.
CCIPL-1989-PfenningL #named #polymorphism: LEAP: A Language with Eval And Polymorphism (FP, PL), pp. 345–359.
STOC-1989-KurtzMR #random: The Isomorphism Conjecture Fails Relative to a Random Oracle (SAK, SRM, JSR), pp. 157–166.
LICS-1989-Leivant #polymorphism: Stratified Polymorphism (DL), pp. 39–47.
ICALP-1988-LingasS #algorithm #graph #polynomial: A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs (AL, MMS), pp. 394–409.
ICALP-1988-RudichB #transitive: Optimal Circuits and Transitive Automorphism Groups (SR, LB), pp. 516–524.
DAC-1988-TakashimaIKTSS #comparison #functional #rule-based: A Circuit Comparison System with Rule-Based Functional Isomorphism Checking (MT, AI, SK, TT, TS, JiS), pp. 512–516.
VDME-1987-Airchinnigh: Mathematical Structures and their Morphisms in Meta-IV (MMaA), pp. 287–320.
FPCA-1987-ToynDR #performance #polymorphism: Performance polymorphism (IT, AJD, CR), pp. 325–346.
CFLP-1987-TannenC #modelling #polymorphism: Extensional Models for Polymorphism (VT, TC), pp. 291–307.
LICS-1987-Breazu-TannenM #polymorphism: Polymorphism is conservative over simple types (VT, ARM), pp. 7–17.
OOPSLA-1986-Ingalls #multi #polymorphism: A Simple Technique for Handling Multiple Polymorphism (DHHI), pp. 347–349.
STOC-1986-KoLD #polynomial: A Note on One-Way Functions and Polynomial-Time Isomorphisms (KIK, TJL, DZD), pp. 295–303.
ICALP-1985-Keranen #on the #word: On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet (VK), pp. 338–347.
FPCA-1985-Nikhil85 #polymorphism: Practical Polymorphism (RSN), pp. 319–333.
CAAP-1985-Castellani #abstraction #bisimulation: Bisimulations and Abstraction Homomorphisms (IC), pp. 223–238.
STOC-1985-BruceL #equation #modelling: Provable Isomorphisms and Domain Equations in Models of Typed Languages (KBB, GL), pp. 263–272.
POPL-1984-Wand #polymorphism #semantics: A Types-as-Sets Semantics for Milner-Style Polymorphism (MW), pp. 158–164.
ICALP-1983-ChoffrutK #bound #testing: Test Sets for Morphisms with Bounded Delay (CC, JK), pp. 118–127.
ICALP-1983-LatteuxL #composition #on the: On the Composition of Morphisms and Inverse Morphisms (ML, JL), pp. 420–432.
ICALP-1983-SpinradV #2d #partial order #recognition: Recognition and Isomorphism of Two Dimensional Partial Orders (JPS, JV), pp. 676–686.
ICALP-1982-EhrenfeuchtR: Repetitions in Homomorphisms and Languages (AE, GR), pp. 192–211.
ICALP-1982-GoralcikovaGK #bound #pseudo: A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties (AG, PG, VK), pp. 292–299.
GG-1982-Pfaltz: Transformation of structures by convex homomorphisms (JLP), pp. 297–313.
GG-1982-Schnitzler #graph #problem: The isomorphism problem is polynomially solvable for certain graph languages (MS), pp. 369–379.
STOC-1982-BabaiGM #bound #graph #multi: Isomorphism of Graphs with Bounded Eigenvalue Multiplicity (LB, DYG, DMM), pp. 310–324.
ICALP-1981-Karhumaki: Generalized Parikh Mappings and Homomorphisms (JK), pp. 324–332.
ICALP-1980-AlbertC #context-free grammar #equivalence #testing: Test Sets for Homomorphism Equivalence on Context Free Languages (JA, KCI), pp. 12–18.
STOC-1980-FilottiM #algorithm #graph #polynomial: A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus (ISF, JNM), pp. 236–243.
STOC-1980-Hoffmann #graph #testing: Testing Isomorphism on Cone Graphs (CMH), pp. 244–251.
STOC-1980-Lichtenstein #graph: Isomorphism for Graphs Embeddable on the Projective Plane (DL), pp. 218–224.
STOC-1980-Miller #bound #graph #testing: Isomorphism Testing for Graphs of Bounded Genus (GLM), pp. 225–235.
ICALP-1979-Berstel #french: Sur les mots sans carré définis par un morphisme (JB), pp. 16–25.
ICALP-1978-ArnoldD #french: Sul l’inversion des morphisms d’arbres (AA, MD), pp. 26–35.
POPL-1978-DemersDS #data type #encapsulation #polymorphism: Data Types as Values: Polymorphism, Type-Checking, Encapsulation (AJD, JED, GS), pp. 23–30.
STOC-1978-LapaughR #problem: The Subgraph Homeomorphism Problem (ASL, RLR), pp. 40–50.
STOC-1978-Miller #on the: On the n^log n Isomorphism Technique: A Preliminary Report (GLM), pp. 51–58.
STOC-1977-Miller #graph: Graph Isomorphism, General Remarks (GLM), pp. 143–150.
ICALP-1976-Fontet #algorithm #graph #linear #testing: A Linear Algorithm for Testing Isomorphism of Planar Graphs (MF), pp. 411–424.
STOC-1976-HartmanisB #on the #set: On Isomorphisms and Density of NP and Other Complete Sets (JH, LB), pp. 30–40.
ICALP-1974-EhrenfeuchtR #term rewriting #trade-off #using: Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems (AE, GR), pp. 473–480.
ICALP-1974-Fontet #french #permutation: Un resultat en theorie des groupes de permutations et son application au calcul effectif du groupe d’automorphismes d’un automate fini (MF), pp. 335–341.
STOC-1974-HopcroftW #algorithm #graph #linear: Linear Time Algorithm for Isomorphism of Planar Graphs (JEH, JKW), pp. 172–184.