Search results for "homomorphisms"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
12	Craig Gentry	Fully homomorphic encryption using ideal lattices.	STOC	2009	DBLP DOI BibTeX RDF	fully homomorphic encryption
12	Joshua D. Guttman	Transformations between Cryptographic Protocols.	ARSPA-WITS	2009	DBLP DOI BibTeX RDF
12	Siva Anantharaman, Hai Lin 0005, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch	Unification Modulo Homomorphic Encryption.	FroCoS	2009	DBLP DOI BibTeX RDF
12	Martin Papco	On effect algebras of fuzzy sets.	Soft Comput.	2008	DBLP DOI BibTeX RDF	D-poset, Convergence Sequentially continuous D-homomorphism, Convergence effect algebra, Sequentially continuous EA-homomorphism, D-poset of fuzzy sets, Pointwise convergence, ID-poset, Effect algebra of fuzzy sets, IE-algebra, Sober IE-algebra, Closed IE-algebra, IE-measurable space, Measurable map, Natural equivalence, Monocoreflective subcategory, Epireflective subcategory, Coproduct, Generalized elementary event, Generalized measurable space, Generalized probability measure, Product, Observable, Duality, State, Effect algebra, Fuzzy random variable
12	Toon Calders, Jan Ramon, Dries Van Dyck	Anti-monotonic Overlap-Graph Support Measures.	ICDM	2008	DBLP DOI BibTeX RDF
12	Andrei A. Bulatov, Andrei A. Krokhin, Benoît Larose	Dualities for Constraint Satisfaction Problems.	Complexity of Constraints	2008	DBLP DOI BibTeX RDF
12	Alexandre Hamez, Yann Thierry-Mieg, Fabrice Kordon	Hierarchical Set Decision Diagrams and Automatic Saturation.	Petri Nets	2008	DBLP DOI BibTeX RDF	Hierarchical Decision Diagrams, Model Checking, Saturation
12	Anuj Dawar, Stephan Kreutzer	On Datalog vs. LFP.	ICALP (2)	2008	DBLP DOI BibTeX RDF
12	Andrei A. Bulatov	The Complexity of the Counting Constraint Satisfaction Problem.	ICALP (1)	2008	DBLP DOI BibTeX RDF
12	Roberto Passerone, Alberto L. Sangiovanni-Vincentelli	Approximating Behaviors in Embedded System Design.	Concurrency, Graphs and Models	2008	DBLP DOI BibTeX RDF
12	Vladimir Shpilrain, Alexander Ushakov	An Authentication Scheme Based on the Twisted Conjugacy Problem.	ACNS	2008	DBLP DOI BibTeX RDF
12	Ilya Averbouch, Benny Godlin, Johann A. Makowsky	A Most General Edge Elimination Polynomial.	WG	2008	DBLP DOI BibTeX RDF
12	Ralph L. Wojtowicz	On Transformations between Belief Spaces.	SMPS	2008	DBLP DOI BibTeX RDF	Belief state, Voorbraak map, pignistic transformation, absolute continuity, category, adjoint
12	Jonathan J. Davies, Alastair R. Beresford, Alan Mycroft	Language-Based Optimisation of Sensor-Driven Distributed Computing Applications.	FASE	2008	DBLP DOI BibTeX RDF
12	Anthony W. Hager, Jorge Martinez 0001	Patch-generated Frames and Projectable Hulls.	Appl. Categorical Struct.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 06D22, 16E50, 54G05, 06F25
12	Kazuhiro Yokoyama	On systems of algebraic equations with parametric exponents II.	Appl. Algebra Eng. Commun. Comput.	2007	DBLP DOI BibTeX RDF	Ideals with parametric exponents, Gröbner basis
12	Yoshihito Tanaka	An Infinitary Extension of Jankov's Theorem.	Stud Logica	2007	DBLP DOI BibTeX RDF	Subdirectly irreducible algebra, Heyting algebra, Infinitary logic
12	Sven Hartmann, Sebastian Link, Thu Trinh	Efficient Reasoning About XFDs with Pre-image Semantics.	DASFAA	2007	DBLP DOI BibTeX RDF
12	Mikolaj Bojanczyk, Piotr Hoffman	Reachability in Unions of Commutative Rewriting Systems Is Decidable.	STACS	2007	DBLP DOI BibTeX RDF	Topic classification Logic in computer science, rewriting
12	Johan Glimming	Parametric (Co)Iteration vs. Primitive Direcursion.	CALCO	2007	DBLP DOI BibTeX RDF
12	Robert Goldblatt	Maps and Monads for Modal Frames.	Stud Logica	2006	DBLP DOI BibTeX RDF	modal map, bounded morphism, descriptive frame, equivalence of categories, reflective subcategory, Kleisli category, duality, monad
12	K. Cipková	On a quasiorder on the class of monounary algebras.	Soft Comput.	2006	DBLP DOI BibTeX RDF	Monounary algebra, Degree of element, endomorphism, Quasiorder, homomorphism
12	Ben Cohen, Martín Hötzel Escardó, Klaus Keimel	The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces.	TAMC	2006	DBLP DOI BibTeX RDF
12	Gunnar Gaubatz, Berk Sunar	Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography.	FDTC	2006	DBLP DOI BibTeX RDF	homomorphic embedding, modulus scaling, fault tolerance, error detection, public-key cryptography, arithmetic codes, Finite field arithmetic, cyclic codes, idempotency
12	Mikhail G. Stepanov, Sergey Bezzateev, Tae-Chul Jung	Privacy Homomorphism for Delegation of the Computations.	NEW2AN	2006	DBLP DOI BibTeX RDF
12	Bernd S. W. Schröder	The Automorphism Conjecture for Small Sets and Series Parallel Sets.	Order	2005	DBLP DOI BibTeX RDF	extremal, automorphism problem, weakly ordered, series-parallel, ordered set
12	Jan Hubicka, Jaroslav Nesetril	Finite Paths are Universal.	Order	2005	DBLP DOI BibTeX RDF
12	Antonio R. Garzón, A. del Río	Equivariant Extensions of Categorical Groups.	Appl. Categorical Struct.	2005	DBLP DOI BibTeX RDF	monoidal groupoid, graded categorical group, equivariant cohomology, groups with operators, obstruction, extensions
12	Bernhard Banaschewski	On the Function Ring Functor in Pointfree Topology.	Appl. Categorical Struct.	2005	DBLP DOI BibTeX RDF	completely regular frame, zero-dimensional frame, continuous functions in pointfree topology, left adjoint to the function ring functor, supports on f-rings, archimedean kernels
12	Warren Harrison	What Do Software Developers Need to Know about Business?	IEEE Softw.	2005	DBLP DOI BibTeX RDF	business knowledge, software economics, career path
12	Ronald Fagin, Phokion G. Kolaitis, Lucian Popa 0001	Data exchange: getting to the core.	ACM Trans. Database Syst.	2005	DBLP DOI BibTeX RDF	computational complexity, data integration, dependencies, data exchange, core, conjunctive queries, chase, query answering, Certain answers, universal solutions
12	Tomás Feder, Pavol Hell, Daniel Král, Jirí Sgall	Two algorithms for general list matrix partitions.	SODA	2005	DBLP BibTeX RDF
12	Jean Monnerat, Yvonne Anne Oswald, Serge Vaudenay	Optimization of the MOVA Undeniable Signature Scheme.	Mycrypt	2005	DBLP DOI BibTeX RDF	optimization, Undeniable signatures
12	Gregor Engels, Reiko Heckel, Alexey Cherchago	Flexible Interconnection of Graph Transformation Modules.	Formal Methods in Software and Systems Modeling	2005	DBLP DOI BibTeX RDF
12	Alex Tsow, Steven D. Johnson	Data Refinement for Synchronous System Specification and Construction.	CHARME	2005	DBLP DOI BibTeX RDF
12	Franz Baader, Silvio Ghilardi	Connecting Many-Sorted Theories.	CADE	2005	DBLP DOI BibTeX RDF
12	Zhenjiang Hu, Tetsuo Yokoyama, Masato Takeichi	Program Optimizations and Transformations in Calculation Form.	GTTSE	2005	DBLP DOI BibTeX RDF	Program Transformation, Functional Programming, Program Optimization, Meta Programming, Program Calculation
12	Mithun Acharya, Joao Girão, Dirk Westhoff	Secure Comparison of Encrypted Data in Wireless Sensor Networks.	WiOpt	2005	DBLP DOI BibTeX RDF
12	Franz Baader, Silvio Ghilardi	Connecting Many-Sorted Structures and Theories Through Adjoint Functions.	FroCoS	2005	DBLP DOI BibTeX RDF
12	Barbara Landau	Spatial Language, Spatial Thought: Parallels in Path Structure.	COSIT	2005	DBLP DOI BibTeX RDF
12	Hossein Hajiabolhassan, Xuding Zhu	Sparse H-Colourable Graphs of Bounded Maximum Degree.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Uniquely H-colourable graphs, Bounded maximum degree, Girth
12	Alexander Budkin	Dominions in quasivarieties of universal algebras.	Stud Logica	2004	DBLP DOI BibTeX RDF	dominion, free amalgamated product, lattice, group, universal algebra, Quasivariety, amalgam
12	Sergei P. Odintsov	On the Representation of N4-Lattices.	Stud Logica	2004	DBLP DOI BibTeX RDF	N4-lattice, paraconsistent logic, strong negation
12	Peter McMullen	Mixed Fibre Polytopes.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
12	Andrei A. Bulatov, Martin Grohe	The Complexity of Partition Functions.	ICALP	2004	DBLP DOI BibTeX RDF
12	Jean Monnerat, Serge Vaudenay	Generic Homomorphic Undeniable Signatures.	ASIACRYPT	2004	DBLP DOI BibTeX RDF
12	Ralph Kummetz	Function Spaces of Posets with Projections.	Appl. Categorical Struct.	2003	DBLP DOI BibTeX RDF	poset with projections, pop uniformity, pop technology, pop homomorphism, dcpo, model for the untyped -calculus, Cartesian closed category
12	Feng Gao 0017, John P. Hayes	On-Line Monitor Design of Finite-State Machines.	J. Electron. Test.	2003	DBLP DOI BibTeX RDF	finite-state machine, homomorphism, on-line monitoring
12	Jan Jakubik	Torsion classes of MV-algebras.	Soft Comput.	2003	DBLP DOI BibTeX RDF	Radical class, Torsion class, MV -algebra, Variety
12	Tomás Feder, Moshe Y. Vardi	Homomorphism Closed vs. Existential Positive.	LICS	2003	DBLP DOI BibTeX RDF
12	Andrei A. Bulatov, Víctor Dalmau	Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem.	FOCS	2003	DBLP DOI BibTeX RDF
12	Ronald Fagin, Phokion G. Kolaitis, Lucian Popa 0001	Data exchange: getting to the core.	PODS	2003	DBLP DOI BibTeX RDF
12	Waldemar Korczynski, José de Jesús Cruz Guzmán, Zbigniew Oziewicz	Multilevel System as Multigraph.	International Conference on Computational Science	2003	DBLP DOI BibTeX RDF
12	Claus Boyens, Matthias Fischmann	Profiting from Untrusted Parties in Web-Based Applications.	EC-Web	2003	DBLP DOI BibTeX RDF
12	Sven Hartmann, Sebastian Link	More Functional Dependencies for XML.	ADBIS	2003	DBLP DOI BibTeX RDF
12	Sigrid Gürgens, Peter Ochsenschläger, Carsten Rudolph	Authenticity and Provability - A Formal Framework.	InfraSec	2002	DBLP DOI BibTeX RDF
12	David A. Schmidt	Structure-Preserving Binary Relations for Program Abstraction.	The Essence of Computation	2002	DBLP DOI BibTeX RDF
12	Feng Gao 0017, John P. Hayes	On-Line Monitor Design of Finite-State Machines.	IOLTW	2002	DBLP DOI BibTeX RDF
12	Ivan Damgård, Jesper Buus Nielsen	Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor.	CRYPTO	2002	DBLP DOI BibTeX RDF
12	Robin N. Banerjee, Andrés Bujosa	Implementing Term Algebra Syntactic Unification in Free Modules over Certain Rings.	FoIKS	2002	DBLP DOI BibTeX RDF
12	Balaraman Ravindran, Andrew G. Barto	Model Minimization in Hierarchical Reinforcement Learning.	SARA	2002	DBLP DOI BibTeX RDF
12	Henning Fernau	Parallel communicating grammar systems with terminal transmission.	Acta Informatica	2001	DBLP DOI BibTeX RDF
12	Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker	Many-to-many Matching of Attributed Trees Using Association Graphs and Game Dynamics.	IWVF	2001	DBLP DOI BibTeX RDF
12	Helmut Röhrl	Completeness and Cocompleteness of RSmod1 N.	Appl. Categorical Struct.	2000	DBLP DOI BibTeX RDF	prenormed semimodule, N-summation, cocomplete, free objects, complete
12	Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker	Attributed Tree Homomorphism Using Association Graphs.	ICPR	2000	DBLP DOI BibTeX RDF
12	Elena Trichina	Compositional Style of Programming FPGAs.	Ershov Memorial Conference	1999	DBLP DOI BibTeX RDF
12	Holger Petersen 0001	Fooling Rebound Automata.	MFCS	1999	DBLP DOI BibTeX RDF
12	Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajamani	You Assume, We Guarantee: Methodology and Case Studies.	CAV	1998	DBLP DOI BibTeX RDF
12	Ronald Cramer, Ivan Damgård	Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?	CRYPTO	1998	DBLP DOI BibTeX RDF
12	Alfons Geser, Sergei Gorlatch	Parallelizing Functional Programs by Generalization.	ALP/HOA	1997	DBLP DOI BibTeX RDF
12	Luca Bernardinello, Lucia Pomello	A Category of Transition Systems and Its Relations with Orthomodular Posets.	MFCS	1997	DBLP DOI BibTeX RDF
12	Xiao Jun Chen, Rocco De Nicola	Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures.	ICALP	1996	DBLP DOI BibTeX RDF
12	Ian Glaister, Jeffrey O. Shallit	Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract).	MFCS	1996	DBLP DOI BibTeX RDF
12	Ivo G. Rosenberg	An Algebraic Approach to Hyperalgebras.	ISMVL	1996	DBLP DOI BibTeX RDF	hyperalgebras, hypergroups theory, universal-algebra type theory, nonvoid subsets, hyperclones, inclusion-isotone clones, subuniverses, algebra, type theory, Boolean algebra, Boolean algebra, congruences, algebraic approach
12	Serdar Tasiran, Rajeev Alur, Robert P. Kurshan, Robert K. Brayton	Verifying Abstractions of Timed Systems.	CONCUR	1996	DBLP DOI BibTeX RDF
12	Andreas Potthoff	First-Order Logic on Finite Trees.	TAPSOFT	1995	DBLP DOI BibTeX RDF
12	Volker Diekert, Anca Muscholl, Klaus Reinhardt	On Codings of Traces.	STACS	1995	DBLP DOI BibTeX RDF	Topics Formal languages, concurrency
12	Ronald Cramer, Ivan Damgård	Secure Signature Schemes based on Interactive Protocols.	CRYPTO	1995	DBLP DOI BibTeX RDF
12	André Arnold	Verification and Comparison of Transition Systems.	TAPSOFT	1993	DBLP DOI BibTeX RDF
12	Simon Ambler, Marta Z. Kwiatkowska, Nicholas Measor	On Duality for the Modal µ-Calculus.	CSL	1993	DBLP DOI BibTeX RDF
12	Uwe Wolter, Michael Löwe	Beyond Conditional Equations: Quasi-Initial Semantics for Parametric Algebraic Specifications.	CAAP	1992	DBLP DOI BibTeX RDF
12	Marianne Winslett, Seng-cho Timothy Chou	Updates with Equality: Beyond the Herbrand Universe Assumption.	ISMIS	1991	DBLP DOI BibTeX RDF
12	Reinder J. Bril	A Model-Oriented Method for Algebraic Specification using COLD-1 as Notation.	VDM Europe (1)	1991	DBLP DOI BibTeX RDF	Model-oriented methods, method support, algebraic specifications, wide-spectrum languages
12	Mike Burmester	Yvo Desmedt: All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions.	EUROCRYPT	1990	DBLP DOI BibTeX RDF
12	Rocco De Nicola, Ugo Montanari, Frits W. Vaandrager	Back and Forth Bisimulations.	CONCUR	1990	DBLP DOI BibTeX RDF
12	Gilles Brassard, Claude Crépeau, Moti Yung	Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds.	ICALP	1989	DBLP DOI BibTeX RDF
12	Anthony C. Klug	On conjunctive queries containing inequalities.	J. ACM	1988	DBLP DOI BibTeX RDF
12	Neil C. Rowe	Absolute Bounds on Set Intersection and Union Sizes from Distribution Information.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	union sizes, distribution information, closed-form bounds, rule-based system architecture, statistical analysis, statistical analysis, database theory, set theory, set theory, Boolean algebra, Boolean algebra, file organisation, file organisation, set intersection, database access
12	Klaus-Jörn Lange	Decompositions of Nondeterministic Reductions (Extended Abstract).	ICALP	1986	DBLP DOI BibTeX RDF
12	Franz-Josef Brandenburg	Extended Chomsky-Schützenberger Theorems.	ICALP	1982	DBLP DOI BibTeX RDF
12	Karel Culík II, Ivan Fris	The Sequence Equivalence Problem for D0L Systems is Decidable.	ICALP	1977	DBLP DOI BibTeX RDF
12	Zamir Bavel	Structure and Transition-Preserving Functions of Finite Automata.	J. ACM	1968	DBLP DOI BibTeX RDF
12	Claus-Peter Schnorr	Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen.	Computing	1968	DBLP DOI BibTeX RDF