BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
graph (11)
languag (8)
preserv (6)
encrypt (6)
unif (5)

Stem homomorph$ (all stems)

49 papers:

DATEDATE-2015-KonstantinouKM #encryption #functional #privacy #verification
Privacy-preserving functional IP verification utilizing fully homomorphic encryption (CK, AK, MM), pp. 333–338.
STOCSTOC-2015-GorbunovVW #standard
Leveled Fully Homomorphic Signatures from Standard Lattices (SG, VV, DW), pp. 469–477.
ICALPICALP-v1-2015-0001GR #graph #morphism
Counting Homomorphisms to Square-Free Graphs, Modulo 2 (AG, LAG, DR), pp. 642–653.
ICALPICALP-v1-2015-FominGKM #bound #graph #morphism #problem
Lower Bounds for the Graph Homomorphism Problem (FVF, AG, ASK, IM), pp. 481–493.
DATEDATE-2014-TsoutsosM #named
HEROIC: Homomorphically EncRypted One Instruction Computer (NGT, MM), pp. 1–6.
PPDPPPDP-2014-YangEMMN #encryption #finite #unification
Theories of Homomorphic Encryption, Unification, and the Finite Variant Property (FY, SE, CM, JM, PN), pp. 123–133.
STOCSTOC-2013-AndoniGMP #sketching
Homomorphic fingerprints under misalignments: sketching edit and shift distances (AA, AG, AM, EP), pp. 931–940.
DLTDLT-J-2012-LehtinenO13 #context-free grammar #morphism
Homomorphisms Preserving Deterministic Context-Free Languages (TL, AO), pp. 1049–1066.
DocEngDocEng-2012-ChuangW #documentation #graph #morphism #xml
Structure-conforming XML document transformation based on graph homomorphism (TRC, HYW), pp. 99–102.
STOCSTOC-2012-Lopez-AltTV #encryption #multi #on the fly
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption (ALA, ET, VV), pp. 1219–1234.
DLTDLT-2012-LehtinenO #context-free grammar #morphism
Homomorphisms Preserving Deterministic Context-Free Languages (TL, AO), pp. 154–165.
AFLAFL-2011-PiaoSV #morphism
Tree Homomorphisms for Unranked Trees (XP, KS, SV), pp. 343–357.
ICFPICFP-2011-MuM #functional #morphism #theorem
Generalising and dualising the third list-homomorphism theorem: functional pearl (SCM, AM), pp. 385–391.
PPDPPPDP-2011-EscobarKLMMNS #analysis #encryption #protocol #unification #using
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption (SE, DK, CL, CM, JM, PN, RS), pp. 65–76.
CADECADE-2011-LiuL #morphism #performance #unification
Efficient General Unification for XOR with Homomorphism (ZL, CL), pp. 407–421.
VLDBVLDB-2010-FanLMWW #graph #morphism
Graph Homomorphism Revisited for Graph Matching (WF, JL, SM, HW, YW), pp. 1161–1172.
ICALPICALP-v1-2010-CaiCL #graph #morphism #theorem
Graph Homomorphisms with Complex Values: A Dichotomy Theorem (JyC, XC, PL), pp. 275–286.
STOCSTOC-2009-Gentry #encryption #using
Fully homomorphic encryption using ideal lattices (CG), pp. 169–178.
ICALPICALP-v1-2009-AminiFS #morphism
Counting Subgraphs via Homomorphisms (OA, FVF, SS), pp. 71–82.
POPLPOPL-2009-MorihataMHT #divide and conquer #morphism #theorem
The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer (AM, KM, ZH, MT), pp. 177–185.
FoSSaCSFoSSaCS-2008-GodoyMT #decidability #morphism
Classes of Tree Homomorphisms with Decidable Preservation of Regularity (GG, SM, ST), pp. 127–141.
STOCSTOC-2008-BartoKN #complexity #graph #morphism #problem
Graphs, polymorphisms and the complexity of homomorphism problems (LB, MK, TN), pp. 789–796.
STOCSTOC-2008-DinurGKS #bound #morphism
Decodability of group homomorphisms beyond the johnson bound (ID, EG, SK, MS), pp. 275–284.
AFLAFL-2008-JurgensenM #morphism
Homomorphisms Preserving Types of Density (HJ, IM), pp. 183–194.
ICALPICALP-C-2008-PrabhakaranR #encryption #security
Homomorphic Encryption with CCA Security (MP, MR), pp. 667–678.
LATALATA-2008-KlimaP #morphism
Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups (OK, LP), pp. 299–310.
ICALPICALP-v1-2006-DyerGP #graph #morphism #on the
On Counting Homomorphisms to Directed Acyclic Graphs (MED, LAG, MP), pp. 38–49.
ICALPICALP-v2-2006-DelauneLLT #analysis #morphism #protocol
Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or (SD, PL, DL, RT), pp. 132–143.
RTARTA-2005-LafourcadeLT #deduction #equation #morphism
Intruder Deduction for AC-Like Equational Theories with Homomorphisms (PL, DL, RT), pp. 308–322.
PODSPODS-2004-AtseriasDK #morphism #on the #query
On Preservation under Homomorphisms and Unions of Conjunctive Queries (AA, AD, PGK), pp. 319–329.
STOCSTOC-2004-ShpilkaW #morphism #testing
Derandomizing homomorphism testing in general groups (AS, AW), pp. 427–435.
IFLIFL-2004-ShafarenkoS
General Homomorphic Overloading (AVS, SBS), pp. 195–210.
CADECADE-2003-AnantharamanNR #morphism #unification
Unification Modulo ACU I Plus Homomorphisms/Distributivity (SA, PN, MR), pp. 442–457.
LICSLICS-2003-FederV #morphism
Homomorphism Closed vs. Existential Positive (TF, MYV), pp. 311–320.
PPDPPPDP-2002-Shafarenko #morphism #type inference #type system
Coercion as homomorphism: type inference in a system with subtyping and overloading (AVS), pp. 14–25.
SATSAT-2002-BueningX #complexity #morphism #satisfiability
The complexity of homomorphisms and renamings of minimal unsatisfiable formulas (HKB, DX), p. 9.
ICPRICPR-v2-2000-BartoliPSZ #graph #morphism #using
Attributed Tree Homomorphism Using Association Graphs (MB, MP, KS, SWZ), pp. 2133–2136.
ICPRICPR-v2-2000-PerchantB #fuzzy #graph #morphism
Graph Fuzzy Homomorphism Interpreted as Fuzzy Association Graphs (AP, IB), pp. 6042–6045.
PPDPPPDP-2000-KollerM #abstract interpretation #component #morphism #performance #using
Efficient abstract interpretation using component-wise homomorphisms (JK, MM), pp. 226–234.
TOOLSTOOLS-USA-1997-Kuhne
The Translator Pattern — External Functionality with Homomorphic Mappings (TK), pp. 48–62.
RTARTA-1991-BaaderN #algebra #commutative #equation #how #morphism #unification
Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification (FB, WN), pp. 124–135.
SEKESEKE-1989-WuCZT #identification #morphism #novel #query #subclass
A Novel Way 1o Identify IneguaIity Query Subclasses Which possess the Homomorphism Property (TW, JLC, NZ, KT), pp. 158–163.
ICALPICALP-1982-EhrenfeuchtR #morphism
Repetitions in Homomorphisms and Languages (AE, GR), pp. 192–211.
ICGTGG-1982-Pfaltz #morphism
Transformation of structures by convex homomorphisms (JLP), pp. 297–313.
ICALPICALP-1981-Karhumaki #morphism
Generalized Parikh Mappings and Homomorphisms (JK), pp. 324–332.
ICALPICALP-1980-AlbertC #context-free grammar #equivalence #morphism #testing
Test Sets for Homomorphism Equivalence on Context Free Languages (JA, KCI), pp. 12–18.
ICALPICALP-1980-AlbertW
Languages with Homomorphic Replacements (JA, LMW), pp. 19–29.
ICALPICALP-1979-Culik #on the #product line
On the Homomorphic Characterizations of Families of Languages (KCI), pp. 161–170.
ICALPICALP-1974-EhrenfeuchtR #morphism #term rewriting #trade-off
Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems (AE, GR), pp. 473–480.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.