Stem isomorph$ (all stems)

85 papers:

VLDB-2015-KimSHHC #morphism #query #rdf

Taming Subgraph Isomorphism for RDF Query Processing (JK, HS, WSH, SH, HC), pp. 1238–1249.

VLDB-2015-RenW #graph #morphism #scalability

Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs (XR, JW), pp. 617–628.

SANER-2015-QiuSM #graph #identification #library #morphism #using

Library functions identification in binary code by using graph isomorphism testings (JQ, XS, PM), pp. 261–270.

CIAA-2015-HeamJ #automaton #generative #morphism #on the #random

On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism (PCH, JLJ), pp. 140–152.

ICALP-v1-2015-BerkholzG #algebra #graph #morphism #testing

Limitations of Algebraic Approaches to Graph Isomorphism Testing (CB, MG), pp. 155–166.

ICALP-v1-2014-KusumotoY #morphism #testing

Testing Forest-Isomorphism in the Adjacency List Model (MK, YY), pp. 763–774.

LATA-2014-DasST #encoding #graph #morphism

Succinct Encodings of Graph Isomorphism (BD, PS, JT), pp. 285–296.

ICGT-2014-RidderR #morphism #problem

The Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages (HNdR, NdR), pp. 192–206.

ICPR-2014-BaiRH #kernel #morphism #testing

A Hypergraph Kernel from Isomorphism Tests (LB, PR, ERH), pp. 3880–3885.

ICPR-2014-LuZXGW #approximate #morphism #quantum

Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk (KL, YZ, KX, YG, RCW), pp. 1413–1418.

LICS-CSL-2014-Ilik #axiom #decidability #morphism

Axioms and decidability for type isomorphism in the presence of sums (DI), p. 7.

SIGMOD-2013-HanLL #database #graph #morphism #named #robust #scalability #towards

Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases (WSH, JL, JHL), pp. 337–348.

FoSSaCS-2013-HofmannRS #morphism #pointer #source code

Pure Pointer Programs and Tree Isomorphism (MH, RR, US), pp. 321–336.

STOC-2013-ChenST #design #morphism #multi #testing

Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems (XC, XS, SHT), pp. 271–280.

ICALP-v1-2013-WimmerY #invariant #morphism #testing

Testing Linear-Invariant Function Isomorphism (KW, YY), pp. 840–850.

SAT-2013-Toran #complexity #graph #morphism #on the

On the Resolution Complexity of Graph Non-isomorphism (JT), pp. 52–66.

DATE-2012-MeissnerMLH #framework #graph #morphism #performance #synthesis #testing

Fast isomorphism testing for a graph-based analog circuit synthesis framework (MM, OM, LL, LH), pp. 757–762.

VLDB-2013-LeeHKL12 #algorithm #comparison #database #graph #morphism

An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases (JL, WSH, RK, JHL), pp. 133–144.

STOC-2012-GroheM #graph #morphism #theorem

Structure theorem and isomorphism test for graphs with excluded topological subgraphs (MG, DM), pp. 173–192.

ICALP-v1-2012-BabaiCQ #morphism #polynomial

Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups — (Extended Abstract) (LB, PC, YQ), pp. 51–62.

LATA-2012-ArvindV #morphism #testing

Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits (VA, YV), pp. 83–94.

ICPR-2012-DahmBCG #detection #morphism

Topological features and iterative node elimination for speeding up subgraph isomorphism detection (ND, HB, TC, YG), pp. 1164–1167.

SAC-2012-BenreguiaK #consistency #graph #morphism #problem

A consistency rule for graph isomorphism problem (BB, HK), pp. 906–911.

CSL-2012-Kuske #automation #linear #morphism #order

Isomorphisms of scattered automatic linear orders (DK), pp. 455–469.

LICS-2012-Mazza #λ-calculus

An Infinitary Affine λ-Calculus Isomorphic to the Full λ-Calculus (DM), pp. 471–480.

ASE-2011-EdwardsBM #editing #morphism #tool support

Isomorphism in model tools and editors (GE, YB, NM), pp. 460–463.

ICALP-v2-2011-LohreyM #morphism #word

Isomorphism of Regular Trees and Words (ML, CM), pp. 210–221.

SAC-2011-Jamil #graph #query #unification #using

Computing subgraph isomorphic queries using structural unification and minimum graph structures (HMJ), pp. 1053–1058.

LICS-2011-Clairambault #higher-order #morphism

Isomorphisms of Types in the Presence of Higher-Order References (PC), pp. 152–161.

SIGMOD-2010-ChengFL #morphism #named #network #privacy

K-isomorphism: privacy preserving network publication against structural attacks (JC, AWCF, JL), pp. 459–470.

SAC-2010-AminBJ #framework #interactive #performance

A cytoscape based framework for efficient sub-graph isomorphic protein-protein interaction motif lookup (MSA, AB, HMJ), pp. 1572–1576.

CSL-2010-KuskeLL #morphism #problem

The Isomorphism Problem for ω-Automatic Trees (DK, JL, ML), pp. 396–410.

LICS-2010-KuskeLL #automation #morphism #problem

The Isomorphism Problem on Classes of Automatic Structures (DK, JL, ML), pp. 160–169.

SAC-2009-Tarau #data type #finite #haskell #morphism

Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell (PT), pp. 1898–1902.

SAC-2009-WangT #algorithm #morphism

An algorithm for optimal comma free codes with isomorphism rejection (HW, VDT), pp. 1007–1008.

VLDB-2008-ShangZLY #algorithm #morphism #performance #testing #verification

Taming verification hardness: an efficient algorithm for testing subgraph isomorphism (HS, YZ, XL, JXY), pp. 364–375.

STOC-2008-KawarabayashiM #graph #linear #morphism

Graph and map isomorphism and all polyhedral embeddings in linear time (KiK, BM), pp. 471–480.

ICALP-A-2008-ChenTW #complexity #comprehension #morphism

Understanding the Complexity of Induced Subgraph Isomorphisms (YC, MT, MW), pp. 587–596.

CSL-2008-Dezani-CiancagliniCGT #morphism #on the

On Isomorphisms of Intersection Types (MDC, RDC, EG, MT), pp. 461–477.

STOC-2007-MooreRS #algorithm #graph #morphism #on the #quantum

On the impossibility of a quantum sieve algorithm for graph isomorphism (CM, AR, PS), pp. 536–545.

TLCA-2007-Nakazawa #morphism #proving #reduction

An Isomorphism Between Cut-Elimination Procedure and Proof Reduction (KN), pp. 336–350.

STOC-2006-HallgrenMRRS #graph #morphism #quantum

Limitations of quantum coset states for graph isomorphism (SH, CM, MR, AR, PS), pp. 604–617.

ICALP-v1-2006-GroheV #game studies #graph #morphism #parallel #testing

Testing Graph Isomorphism in Parallel by Playing a Game (MG, OV), pp. 3–14.

IJCAR-2006-JiaZ #finite #morphism

A Powerful Technique to Eliminate Isomorphism in Finite Model Search (XJ, JZ), pp. 318–331.

STOC-2004-Fischer #graph #morphism #testing

The difficulty of testing for isomorphism against a graph that is given in advance (EF), pp. 391–397.

POPL-2004-Fiore #morphism #polynomial #recursion

Isomorphisms of generic recursive polynomial types (MPF), pp. 77–88.

POPL-2003-ZibinGC #algorithm #morphism #performance

Efficient algorithms for isomorphisms of simple types (YZ, JYG, JC), pp. 160–171.

CSL-2002-BohlerHRV #constraints #equivalence #morphism

Equivalence and Isomorphism for Boolean Constraint Satisfaction (EB, EH, SR, HV), pp. 412–426.

LICS-2002-FioreCB #morphism #λ-calculus

Remarks on Isomorphisms in Typed λ Calculi with Empty and Sum Types (MPF, RDC, VB), p. 147–?.

FoSSaCS-2001-BartheP #dependent type #morphism #proving #reuse #type system

Type Isomorphisms and Proof Reuse in Dependent Type Theory (GB, OP), pp. 57–71.

STOC-2000-Grohe #graph #morphism #testing

Isomorphism testing for embeddable graphs through definability (MG), pp. 63–72.

CHI-2000-PoupyrevWF #3d

Non-isomorphic 3D rotational techniques (IP, SW, SF), pp. 540–547.

ICPR-v4-2000-FolkersSS #multi #query #using

Processing Pictorial Queries with Multiple Instances Using Isomorphic Subgraphs (AF, HS, AS), pp. 4051–4054.

STOC-1999-Luks #equivalence #morphism

Hypergraph Isomorphism and Structural Equivalence of Boolean Functions (EML), pp. 652–658.

FLOPS-1999-Ohori #automaton #logic #morphism

The Logical Abstract Machine: A Curry-Howard Isomorphism for Machine Code (AO), pp. 300–318.

HCI-EI-1999-EdwardsEA

Isomorphic Sonification of Spatial Relations (ADNE, GEE, AVA), pp. 526–530.

CSL-1999-BalatC #linear #logic #morphism

A Linear Logical View of Linear Type Isomorphisms (VB, RDC), pp. 250–265.

TLCA-1999-Ohori #compilation #execution #morphism

A Curry-Howard Isomorphism for Compilation and Program Execution (AO), pp. 280–294.

PODS-1998-Etessami #first-order #morphism

Dynamic Tree Isomorphism via First-Order Updates (KE), pp. 235–243.

STOC-1996-Spielman #graph #morphism #performance #testing

Faster Isomorphism Testing of Strongly Regular Graphs (DAS), pp. 576–584.

PLILP-1996-AponteC #morphism

Type Isomorphisms for Module Signatures (MVA, RDC), pp. 334–346.

POPL-1996-JacksonJD #performance #specification

Faster Checking of Software Specifications by Eliminating Isomorphs (DJ, SJ, CD), pp. 79–90.

SAC-1995-AbualiWS95a #algorithm #morphism #problem #search-based #using

Solving the three-star tree isomorphism problem using genetic algorithms (FNA, RLW, DAS), pp. 337–344.

DAC-1993-OhlrichEGS #algorithm #identification #morphism #named #performance #using

SubGemini: Identifying SubCircuits using a Fast Subgraph Isomorphism Algorithm (MO, CE, EG, LS), pp. 31–37.

POPL-1992-Cosmo #framework #morphism

Type Isomorphisms in a Type-Assignment Framework (RDC), pp. 200–210.

FPCA-1991-Thatte #morphism

Coercive Type Isomorphism (SRT), pp. 29–49.

CADE-1990-Basin #commutative #morphism #similarity

Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators in Isomorphism Complete (DAB), pp. 251–260.

STOC-1989-KurtzMR #morphism #random

The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract) (SAK, SRM, JSR), pp. 157–166.

DAC-1988-TakashimaIKTSS #comparison #functional #morphism #rule-based

A Circuit Comparison System with Rule-Based Functional Isomorphism Checking (MT, AI, SK, TT, TS, JiS), pp. 512–516.

ICALP-1988-LingasS #algorithm #graph #morphism #polynomial

A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs (AL, MMS), pp. 394–409.

STOC-1986-KoLD #morphism #polynomial

A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract) (KIK, TJL, DZD), pp. 295–303.

STOC-1985-BruceL #equation #modelling #morphism

Provable Isomorphisms and Domain Equations in Models of Typed Languages (Preliminary Version) (KBB, GL), pp. 263–272.

ICALP-1983-SpinradV #2d #morphism #partial order #recognition

Recognition and Isomorphism of Two Dimensional Partial Orders (JPS, JV), pp. 676–686.

STOC-1982-BabaiGM #bound #graph #morphism #multi

Isomorphism of Graphs with Bounded Eigenvalue Multiplicity (LB, DYG, DMM), pp. 310–324.

ICALP-1982-GoralcikovaGK #bound #morphism #pseudo

A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties (AG, PG, VK), pp. 292–299.

GG-1982-Schnitzler #graph #morphism #problem

The isomorphism problem is polynomially solvable for certain graph languages (MS), pp. 369–379.

STOC-1980-FilottiM #algorithm #graph #morphism #polynomial

A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus (Working Paper) (ISF, JNM), pp. 236–243.

STOC-1980-Hoffmann #graph #morphism #testing

Testing Isomorphism on Cone Graphs (Extended Abstract) (CMH), pp. 244–251.

STOC-1980-Lichtenstein #graph #morphism

Isomorphism for Graphs Embeddable on the Projective Plane (DL), pp. 218–224.

STOC-1980-Miller #bound #graph #morphism #testing

Isomorphism Testing for Graphs of Bounded Genus (GLM), pp. 225–235.

STOC-1978-Miller #morphism #on the

On the n^log n Isomorphism Technique: A Preliminary Report (GLM), pp. 51–58.

STOC-1977-Miller #graph #morphism

Graph Isomorphism, General Remarks (GLM), pp. 143–150.

STOC-1976-HartmanisB #morphism #on the #set

On Isomorphisms and Density of NP and Other Complete Sets (JH, LB), pp. 30–40.

ICALP-1976-Fontet #algorithm #graph #linear #morphism #testing

A Linear Algorithm for Testing Isomorphism of Planar Graphs (MF), pp. 411–424.

STOC-1974-HopcroftW #algorithm #graph #linear #morphism

Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report) (JEH, JKW), pp. 172–184.