|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 205 occurrences of 167 keywords
|
|
|
Results
Found 793 publication records. Showing 793 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
77 | Elena Grigorescu, Swastik Kopparty, Madhu Sudan 0001 |
Local Decoding and Testing for Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 375-385, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
77 | Jirí Fiala 0001, Daniël Paulusma, Jan Arne Telle |
Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 340-351, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
65 | Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan 0001 |
Decodability of group homomorphisms beyond the johnson bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 275-284, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hadamard codes, list decoding, sublinear time algorithms |
64 | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson |
On counting homomorphisms to directed acyclic graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(6), pp. 27, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
directed acyclic graphs, homomorphisms, Counting |
64 | Albert Atserias, Anuj Dawar, Phokion G. Kolaitis |
On preservation under homomorphisms and unions of conjunctive queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(2), pp. 208-237, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Datalog, first-order logic, Conjunctive queries, preservation, homomorphisms, finite model theory, graph minors, infinitary logic |
61 | Stefan Szeider |
The Complexity of Resolution with Generalized Symmetry Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(2), pp. 171-188, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
61 | Stefan Szeider |
The Complexity of Resolution with Generalized Symmetry Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 475-486, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
53 | Omid Amini, Fedor V. Fomin, Saket Saurabh 0001 |
Counting Subgraphs via Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 71-82, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
53 | Albert Atserias, Anuj Dawar, Phokion G. Kolaitis |
On Preservation under Homomorphisms and Unions of Conjunctive Queries. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 14-16, 2004, Paris, France, pp. 319-329, 2004, ACM, 1-58113-858-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
53 | Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi |
Formal Derivation of Efficient Parallel Programs by Construction of List Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 19(3), pp. 444-461, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
list homomorphism, parallel functional programming, program transformation and derivation |
53 | Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi |
Construction of List Homomorphisms by Tupling and Fusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings, pp. 407-418, 1996, Springer, 3-540-61550-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
51 | Libor Polák |
On Pseudovarieties of Semiring Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 635-647, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Varieties of languages, pseudovarieties of homomorphisms |
49 | Kazutaka Morita, Akimasa Morihata, Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi |
Automatic inversion generates divide-and-conquer parallel programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, San Diego, California, USA, June 10-13, 2007, pp. 146-155, 2007, ACM, 978-1-59593-633-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
divide-and-conquer parallelism, third homomorphism theorem, program transformation, inversion |
49 | Roman Fric |
Measures on MV-algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 7(2), pp. 130-137, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Semisimple M V -algebra, Initial sequential convergence, I -sequential M V -algebra, Sequential continuity, Absolutely sequentially closed object, Epireflection, Sequentially continuous measure, ?-completion, Extension of measures, Natural equivalence, Bold algebra, ?ukasiewicz tribe, Measurable map, Probability event, D -poset, Coproduct, Quantum structure, Observable, Duality, Measurable space |
49 | Bruce L. Bauslaugh |
List-Compactness of Infinite Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 17(1), pp. 17-38, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
49 | Franz-Josef Brandenburg |
A Truely Morphic Characterization of Recursively Enumerable Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings, pp. 205-213, 1984, Springer, 3-540-13372-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
48 | Benjamin Rossman |
Homomorphism preservation theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 55(3), pp. 15:1-15:53, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
preservation theorems, quantifier-rank, tree-depth, first-order logic, conjunctive queries, homomorphisms, Finite model theory |
48 | Josep Domingo-Ferrer |
A Provably Secure Additive and Multiplicative Privacy Homomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISC ![In: Information Security, 5th International Conference, ISC 2002 Sao Paulo, Brazil, September 30 - October 2, 2002, Proceedings, pp. 471-483, 2002, Springer, 3-540-44270-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Encrypted data processing, Delegation of computing and data, E-gambling, Cryptography, Multilevel security, Privacy homomorphisms |
48 | Peter Ochsenschläger, Jürgen Repp, Roland Rieke, Ulrich Nitsche |
The SH-Verification Tool - Abstraction-Based Verification of Co-operating Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 10(4), pp. 381-404, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Simple language homomorphisms, Asynchronous product automata, Approximate satisfaction of safety and liveness properties, Model checking, Verification tools |
44 | Ilijas Farah |
Approximate Homomorphisms II: Group Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 20(1), pp. 47-60, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05D99, 20D99, 28A35, 28A60 |
41 | Qiong Cheng, Robert W. Harrison, Alexander Zelikovsky |
Homomorphisms of Multisource Trees into Networks with Applications to Metabolic Pathways. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBE ![In: Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2007, October 14-17, 2007, Harvard Medical School, Boston, MA, USA, pp. 350-357, 2007, IEEE Computer Society, 978-1-4244-1509-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
41 | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson |
On Counting Homomorphisms to Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 38-49, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
41 | Michal Walicki, Adis Hodzic, Sigurd Meldal |
Compositional Homomorphisms of Relational Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 359-371, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
41 | Sergei Gorlatch |
Systematic Efficient Parallelization of Scan and Other List Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par, Vol. II ![In: Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume II, pp. 401-408, 1996, Springer, 3-540-61627-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
37 | Alexej P. Pynko |
A relative interpolation theorem for infinitary universal Horn logic and its applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 45(3), pp. 267-305, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Universal Horn theory, Interpolation theorem, Preservation theorem, Definability theorem |
37 | Deepak Kapur, Paliath Narendran, Lida Wang |
A Unification Algorithm for Analysis of Protocols with Blinded Signatures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mechanizing Mathematical Reasoning ![In: Mechanizing Mathematical Reasoning, Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday, pp. 433-451, 2005, Springer, 3-540-25051-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Endre Bangerter, Jan Camenisch, Ueli M. Maurer |
Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography - PKC 2005, 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23-26, 2005, Proceedings, pp. 154-171, 2005, Springer, 3-540-24454-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Michal Walicki |
Bireachability and Final Multialgebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALCO ![In: Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings, pp. 408-423, 2005, Springer, 3-540-28620-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Sergei Gorlatch |
Systematic Extraction and Implementation of Divide-and-Conquer Parallelism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLILP ![In: Programming Languages: Implementations, Logics, and Programs, 8th International Symposium, PLILP'96, Aachen, Germany, September 24-27, 1996, Proceedings, pp. 274-288, 1996, Springer, 3-540-61756-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
35 | Jan Hubicka, Jaroslav Nesetril |
Finite Paths are Universal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 21(3), pp. 181-200, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
universal posets, universal graphs, embeddings, on line, homomorphisms |
35 | Bernhard Banaschewski, Ales Pultr |
Adjointness Aspects of the Down-Set Functor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 9(4), pp. 419-436, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
down-set frames, open and similar types of homomorphisms, adjunction, Booleanization |
32 | Olga Martynova 0001, Alexander Okhotin |
Homomorphisms and inverse homomorphisms on graph-walking automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 979, pp. 114197, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
32 | Michael O. Albertson, Lily Chan, Ruth Haas |
Independence and graph homomorphisms graph homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 17(5), pp. 581-588, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
28 | Jonathan Sorg, Satinder Singh 0001 |
Transfer via soft homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS (2) ![In: 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, Hungary, May 10-15, 2009, Volume 2, pp. 741-748, 2009, IFAAMAS, 978-0-9817381-7-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
Markov decision process, homomorphism, transfer learning |
28 | Ondrej Klíma 0001, Libor Polák |
Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers, pp. 299-310, 2008, Springer, 978-3-540-88281-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
MSC 2000 Classification 68Q45 Formal languages and automata |
28 | Steven D. Galbraith, Michael Scott |
Exponentiation in Pairing-Friendly Groups Using Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pairing ![In: Pairing-Based Cryptography - Pairing 2008, Second International Conference, Egham, UK, September 1-3, 2008. Proceedings, pp. 211-224, 2008, Springer, 978-3-540-85503-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
pairings |
28 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
Exact Algorithms for Graph Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(2), pp. 381-393, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Changzhong Wang, Congxin Wu, Degang Chen 0002 |
Homomorphisms Between Relation Information Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, Second International Conference, RSKT 2007, Toronto, Canada, May 14-16, 2007, Proceedings, pp. 68-75, 2007, Springer, 978-3-540-72457-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Consistent functions, relation mappings, relation information systems, reduction, homomorphism |
28 | Jirí Fiala 0001, Daniël Paulusma, Jan Arne Telle |
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 115-126, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
Exact Algorithms for Graph Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 161-171, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Walter Dosch |
Designing Combinational Circuits with List Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SERA ![In: Third ACIS International Conference on Software Engineering, Research, Management and Applications (SERA 2005), 11-13 August 2005, Mt. Pleasant, MI, USA, pp. 288-297, 2005, IEEE Computer Society, 0-7695-2297-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
functional hardware description, list homomorphism, iterative network, parity generator, priority resolution, High-level synthesis, comparator, tree network |
28 | Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso |
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings, pp. 427-439, 2005, Springer, 3-540-26224-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch |
Unification Modulo ACU I Plus Homomorphisms/Distributivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings, pp. 442-457, 2003, Springer, 3-540-40559-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
E-Unification, Rewrite reachability, Minskymachine, Complexity, Set constraints, Post correspondence problem |
28 | Tomás Feder, Pavol Hell, Jing Huang 0007 |
List Homomorphisms and Circular Arc Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(4), pp. 487-505, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C85, 68R10, 05C15, 05C75 |
28 | Mike Burmester |
Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12-16, 1996, Proceeding, pp. 96-106, 1996, Springer, 3-540-61186-X. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Peter K. Rathmann, Marianne Winslett, Mark S. Manasse |
Circumscription with Homomorphisms: Solving the Equality and Counterexample Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(5), pp. 819-873, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
common sense reasoning, circumscription |
28 | Ernest F. Brickell, Yacov Yacobi |
On Privacy Homomorphisms (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '87, Workshop on the Theory and Application of of Cryptographic Techniques, Amsterdam, The Netherlands, April 13-15, 1987, Proceedings, pp. 117-125, 1987, Springer, 3-540-19102-X. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
28 | Tobias Nipkow |
Are Homomorphisms Sufficient for Behavioural Implementations of Deterministic and Nondeterministic Data Types? ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings, pp. 260-271, 1987, Springer, 3-540-17219-X. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
28 | Juhani Karhumäki |
Generalized Parikh Mappings and Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings, pp. 324-332, 1981, Springer, 3-540-10843-2. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
24 | Václav Koubek, Jirí Sichler |
Almost ff-universality Implies Q-universality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 17(5), pp. 419-434, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) Primary 08C15, 18B15 |
24 | Xiaoying Wu, Dimitri Theodoratos, Wendy Hui Wang |
Answering XML queries using materialized views revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009, pp. 475-484, 2009, ACM, 978-1-60558-512-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
xpath query evaluation, XML, materialized views |
24 | Andreas Fuchs 0002, Sigrid Gürgens, Carsten Rudolph |
On the Security Validation of Integrated Security Solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEC ![In: Emerging Challenges for Security, Privacy and Trust, 24th IFIP TC 11 International Information Security Conference, SEC 2009, Pafos, Cyprus, May 18-20, 2009. Proceedings, pp. 190-201, 2009, Springer, 978-3-642-01243-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Joshua D. Guttman |
Cryptographic Protocol Composition via the Authentication Tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 303-317, 2009, Springer, 978-3-642-00595-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Steven D. Galbraith, Xibin Lin, Michael Scott |
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26-30, 2009. Proceedings, pp. 518-535, 2009, Springer, 978-3-642-01000-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
GLV method, elliptic curves, point multiplication, isogenies |
24 | Pawel Placek, Dimitri Theodoratos, Stefanos Souldatos, Theodore Dalamagas 0001, Timos K. Sellis |
A heuristic approach for checking containment of generalized tree-pattern queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008, pp. 551-560, 2008, ACM, 978-1-59593-991-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
partial tree-pattern query, xml, query containment |
24 | Jirí Fiala 0001, Daniël Paulusma |
Comparing Universal Covers in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings, pp. 158-167, 2008, Springer, 978-3-540-79708-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Jérémie Chalopin, Antoni W. Mazurkiewicz, Yves Métivier |
Labelled (Hyper)Graphs, Negotiations and the Naming Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGT ![In: Graph Transformations, 4th International Conference, ICGT 2008, Leicester, United Kingdom, September 7-13, 2008. Proceedings, pp. 54-68, 2008, Springer, 978-3-540-87404-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Anthony W. Hager, D. G. Johnson |
Adjoining an Identity to a Reduced Archimedean f -ring, II: Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 15(1-2), pp. 35-47, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) Primary 06F20, 13B10, Secondary 18A40, 54H10, 46A40, 54C30, 06F25 |
24 | Richard N. Ball, Anthony W. Hager |
Epi-topology and Epi-convergence for Archimedean Lattice-ordered Groups with Unit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 15(1-2), pp. 81-107, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 06F20, 18A20, 22A30, 46H15, 54C35, 54A20 |
24 | Themba Dube, Joanne Walters-Wayland |
Coz-onto Frame Maps and Some Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 15(1-2), pp. 119-133, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification 06D22, 54B05, 54C45, 54G05 |
24 | Sergei Evdokimov 0002, Matthias Fischmann, Oliver Günther 0001 |
Provable Security for Outsourcing Database Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, 3-8 April 2006, Atlanta, GA, USA, pp. 117, 2006, IEEE Computer Society, 0-7695-2570-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Benjamin Rossman |
Existential Positive Types and Preservation under Homomorphisisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings, pp. 467-476, 2005, IEEE Computer Society, 0-7695-2266-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Jean-Michel Couvreur, Yann Thierry-Mieg |
Hierarchical Decision Diagrams to Exploit Model Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORTE ![In: Formal Techniques for Networked and Distributed Systems - FORTE 2005, 25th IFIP WG 6.1 International Conference, Taipei, Taiwan, October 2-5, 2005, Proceedings, pp. 443-457, 2005, Springer, 3-540-29189-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
List Partitions of Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 100-108, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Martin E. Dyer, Mark Jerrum, Eric Vigoda |
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings, pp. 68-77, 2002, Springer, 3-540-44147-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Robert Johnson, David Molnar, Dawn Xiaodong Song, David A. Wagner 0001 |
Homomorphic Signature Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CT-RSA ![In: Topics in Cryptology - CT-RSA 2002, The Cryptographer's Track at the RSA Conference, 2002, San Jose, CA, USA, February 18-22, 2002, Proceedings, pp. 244-262, 2002, Springer, 3-540-43224-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Claus Boyens, Oliver Günther 0001 |
Trust Is not Enough: Privacy and Security in ASP and Web Service Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADBIS ![In: Advances in Databases and Information Systems, 6th East European Conference, ADBIS 2002, Bratislava, Slovakia, September 8-11, 2002, Proceedings, pp. 8-22, 2002, Springer, 3-540-44138-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Sava Krstic, John Launchbury, Dusko Pavlovic |
Categories of Processes Enriched in Final Coalgebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings, pp. 303-317, 2001, Springer, 3-540-41864-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Franz Baader, Werner Nutt |
Combination problems for commutative/monoidal theories or how algebra can help in equational unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 7(4), pp. 309-337, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Equational unification, Semiadditive categories, Semirings, Equational theories |
24 | Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi |
Formal Derivation of Parallel Program for 2-Dimensional Maximum Segment Sum Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par, Vol. I ![In: Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume I, pp. 553-562, 1996, Springer, 3-540-61626-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | André Arnold, Anne Dicky |
Equivalences and Preorders of Transition Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings, pp. 20-31, 1993, Springer, 3-540-57182-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
temporal logic, bisimulation, transition system |
24 | Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya |
Any Language in IP Has a Divertable ZKIP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT '91, International Conference on the Theory and Applications of Cryptology, Fujiyoshida, Japan, November 11-14, 1991, Proceedings, pp. 382-396, 1991, Springer, 3-540-57332-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Zamir Bavel, Jerzy W. Grzymala-Busse, Yen-Teh Hsia |
New communication protocols from old. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Commun. Rev. ![In: Comput. Commun. Rev. 17(5), pp. 136-150, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Jürgen Albert |
On the Ehrenfeucht Conjecture on Test Sets and Its Dual Version. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings, pp. 176-184, 1984, Springer, 3-540-13372-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
24 | Jürgen Albert, Karel Culík II |
Test Sets for Homomorphism Equivalence on Context Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherlands, July 14-18, 1980, Proceedings, pp. 12-18, 1980, Springer, 3-540-10003-2. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
24 | Matthias Höpner, Manfred Opp |
Renaming and Erasing in Szilard Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, Fourth Colloquium, University of Turku, Finland, July 18-22, 1977, Proceedings, pp. 244-257, 1977, Springer, 3-540-08342-1. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
23 | István Juhos, Jano I. van Hemert |
Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Recent Advances in Evolutionary Computation for Combinatorial Optimization ![In: Recent Advances in Evolutionary Computation for Combinatorial Optimization, pp. 167-184, 2008, Springer, 978-3-540-70806-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Graph Contraction, Evolutionary Computation, Heuristics, Graph Colouring, Graph Representation, Graph Homomorphisms |
23 | Martin Grohe |
The complexity of homomorphism and constraint satisfaction problems seen from the other side. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(1), pp. 1:1-1:24, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Complexity, constraint satisfaction, conjunctive queries, homomorphisms, parameterized complexity |
23 | Peter Jonsson, Gustav Nordh, Johan Thapper |
The Maximum Solution Problem on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 228-239, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
computational complexity, optimisation, Constraint satisfaction, homomorphisms |
23 | George Voutsadakis |
Categorical Abstract Algebraic Logic: Partially Ordered Algebraic Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 14(1), pp. 81-98, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
quasi-varieties, order homomorphisms, order isomorphisms, polarity translations, order translations, algebraic systems, protoalgebraic -institutions, institutions, polarities, varieties, algebraizable logics, protoalgebraic logics |
23 | Shin-ya Katsumata, Susumu Nishimura |
Algebraic fusion of functions with an accumulating parameter and its improvement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming, ICFP 2006, Portland, Oregon, USA, September 16-21, 2006, pp. 227-238, 2006, ACM, 1-59593-309-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
accumulating parameter, data contexts, higher-order removal, monoids and monoid homomorphisms, partial and infinite data structures, shortcut fusion |
23 | Simon St. James, Ulrich Ultes-Nitsche |
Computing property-preserving behaviour abstractions from trace reductions: abstraction-based verification of linear-time properties under fairness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001, pp. 238-245, 2001, ACM, 1-58113-383-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
behaviour abstraction, satisfaction within fairness, weakly continuation-closed homomorphisms, partial-order methods, trace reduction |
23 | Sergei Gorlatch |
Toward Formally-Based Design of Message Passing Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 26(3), pp. 276-288, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
systematic program design, maximum segment sum, MPI, Message passing, program transformations, skeletons, reduction, scan, homomorphisms, collective operations |
23 | Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan 0001 |
Linearity Testing in Characteristic Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 432-441, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
characteristic two, relative distance, rejection probability, Max3SAT, MaxSNP problems, lower bounds, lower bound, probability, theorem proving, upper bound, homomorphisms, Fourier analysis, Fourier analysis, linearity testing, linear functions |
16 | Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma |
An Algorithmic Framework for Locally Constrained Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 38(2), pp. 1315-1350, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Santiago Guzmán-Pro |
Full-homomorphisms to paths and cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 347(3), pp. 113800, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Hanbaek Lyu, Facundo Mémoli, David Sivakoff |
Sampling random graph homomorphisms and applications to network data analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Mach. Learn. Res. ![In: J. Mach. Learn. Res. 24, pp. 9:1-9:79, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
16 | Wolfgang Poiger, Bruno Teheux |
The Minor Order of Homomorphisms via Natural Dualities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 40(1), pp. 99-125, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Piotr Borodulin-Nadzieja, Damian Sobota |
On Sequences of Homomorphisms Into Measure Algebras and the Efimov Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 88(1), pp. 191-218, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Sophie MacDonald |
The road problem and homomorphisms of directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 968, pp. 113981, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Azzh Saad Alshehry, Rashid Abu-Dawwas, Mahmoud AlBashayreh |
On Properties of Graded Rings with respect to Group Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Math. Math. Sci. ![In: Int. J. Math. Math. Sci. 2023, pp. 3803873:1-3803873:7, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Artem Govorov, Jin-Yi Cai, Martin E. Dyer |
A dichotomy for bounded degree graph homomorphisms with nonnegative weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 132, pp. 1-15, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Benjamin Scheidt, Nicole Schweikardt |
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.10980, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | M. A. Shalu, Cyriac Antony |
Star colouring and locally constrained graph homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.00086, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková |
List homomorphisms to separable signed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.06449, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Jin-Yi Cai, Ashwin Maran |
The complexity of counting planar graph homomorphisms of domain size 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.08570, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Pascal Welke, Maximilian Thiessen, Fabian Jogl, Thomas Gärtner 0001 |
Expectation-Complete Graph Representations with Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.05838, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Xiuzhan Guo, Wei Huang, Min Luo, Priya Rangarajan |
Transforming Geospatial Ontologies by Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.13135, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Delia Garijo, Andrew J. Goodall, Lluís Vena |
Homomorphisms between graphs embedded on surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.03107, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard |
Complexity of conjunctive regular path query homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.07271, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 793 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ >>] |
|