|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 117 occurrences of 85 keywords
|
|
|
Results
Found 273 publication records. Showing 273 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
87 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson |
Uniform direct product theorems: simplified, optimized, and derandomized. ![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. 579-588, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
direct product code, xor code, direct product theorem |
59 | Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Cook |
Faster computation of the direct product kernel for graph classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIDM ![In: Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2009, part of the IEEE Symposium Series on Computational Intelligence 2009, Nashville, TN, USA, March 30, 2009 - April 2, 2009, pp. 267-274, 2009, IEEE, 978-1-4244-2765-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
57 | Rahul Jain 0001, Hartmut Klauck, Ashwin Nayak 0001 |
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. ![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. 599-608, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
rectangle bounds, subdistribution bounds, information theory, communication complexity, direct product |
53 | Ronen Shaltiel |
Towards Proving Strong Direct Product Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 107-117, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
48 | Andris Ambainis, Robert Spalek, Ronald de Wolf |
A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 618-633, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
lower bounds, quantum computing, time-space tradeoffs, direct product theorems |
47 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 187-196, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
45 | Troy Lee, Adi Shraibman, Robert Spalek |
A Direct Product Theorem for Discrepancy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 71-80, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
direct sum theorems, factorization norms, communication complexity, discrepancy, direct product theorems |
40 | Hartmut Klauck |
A strong direct product theorem for disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 77-86, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
communication-space tradeoffs, disjointness problem, lower bounds, communication complexity, complexity theory, direct product theorems |
37 | Irit Dinur, Or Meir |
Derandomized Parallel Repetition of Structured PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 16-27, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Low error, Direct Product Test, Derandomized Parallel Repetition, PCP, Direct Product, de-Bruijn |
37 | Bjarni Jónsson, Constantine Tsinakis |
Products of Classes of Residuated Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 77(2), pp. 267-292, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
residuated po-monoid, semi-direct product, wreath product, partially ordered group, residuated lattice, lattice-ordered group, direct product |
36 | Anindya De, Luca Trevisan |
Extractors Using Hardness Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 462-475, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Extractors, Direct product theorems, Hardness amplification |
31 | Jiazhi Xia, Ying He 0001, Xiaotian Yin, Shuchu Han, Xianfeng Gu |
Direct-Product Volumetric Parameterization of Handlebodies via Harmonic Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Shape Modeling International ![In: SMI 2010, Shape Modeling International Conference, Aix en Provence, France, June 21-23 2010, pp. 3-12, 2010, IEEE Computer Society, 978-0-7695-4072-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
volume parameterization, polycube, harmonic fields, handlebody, Solid modeling, hexahedral mesh, direct-product |
31 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
Chernoff-Type Direct Product Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 22(1), pp. 75-92, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Challenge-response protocols, Parallel repetition with threshold, Direct product theorem |
31 | Falk Unger |
A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 221-229, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Concentration inequality, XOR Lemma, Direct-product Theorem, Chernoff bound |
31 | P. J. Claringbold |
Algorithm 366: regression using certain direct product matrices [G2]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 12(12), pp. 687-688, 1969. The full citation details ...](Pics/full.jpeg) |
1969 |
DBLP DOI BibTeX RDF |
analysis of covariance, matrix direct product, experimental design, regression analysis, projection operator, analysis of variance, orthogonal matrix |
30 | Andris Ambainis, Robert Spalek, Ronald de Wolf |
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(3), pp. 422-461, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Quantum lower bounds, Boolean functions, Quantum computing, Quantum algorithms, Time-space tradeoffs |
30 | Ronen Shaltiel |
Towards proving strong direct product theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(1-2), pp. 1-22, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 68Q17, 68Q15 |
26 | Troy Lee, Rajat Mittal 0001 |
Product Theorems Via Semidefinite Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 674-685, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Alexander Gamburd, Igor Pak |
Expansion of product replacement graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 691-696, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
25 | Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki |
On total coloring the direct product of cycles and bipartite direct product of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(6), pp. 113340, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Zengti Li |
Direct Sum, Direct Product and Lexicographic Product of Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 101, pp. 209-215, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
24 | Robert Spalek |
The Multiplicative Quantum Adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 237-248, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
quantum query lower bounds, quantum adversary method, multiplicative adversary, combinatorial matrices, direct product theorems |
24 | Hartmut Klauck, Robert Spalek, Ronald de Wolf |
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 12-21, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Irit Dinur, Elazar Goldenberg |
Locally Testing Direct Product in the Low Error Range. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 613-622, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Aleksander Kelenc, Iztok Peterin |
On some metric properties of direct-co-direct product. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 457, pp. 128152, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Aleksander Kelenc, Iztok Peterin |
Distance formula for direct-co-direct product in the case of disconnected factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Art Discret. Appl. Math. ![In: Art Discret. Appl. Math. 6(2), pp. 2, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Song-Chol Han, Hong-Xing Li |
Notes on "pseudo-t-norms and implication operators on a complete Brouwerian lattice" and "pseudo-t-norms and implication operators: direct products and direct product decompositions". ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 153(2), pp. 289-294, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Zhudeng Wang, Yandong Yu |
Pseudo-t-norms and implication operators: direct products and direct product decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 139(3), pp. 673-683, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Alexander A. Sherstov |
The Intersection of Two Halfspaces Has High Threshold Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 343-362, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
intersections of halfspaces, polynomial representations of Boolean functions, PAC learning, rational approximation, direct product theorems |
19 | Peter Che Bor Lam, Wensong Lin, Jianzhuan Wu |
L ( j , k )- and circular L ( j , k )-labellings for the products of complete graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(2-3), pp. 219-227, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
? j, k -number, ? j, k -number, Cartesian product, Direct product |
19 | Antonio Di Nola, Mirko Navara |
MV-Algebras with the Cantor-Bernstein Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFSA (2) ![In: Theoretical Advances and Applications of Fuzzy Logic and Soft Computing, Selection of Papers from IFSA 2007, pp. 861-868, 2007, Springer, 978-3-540-72433-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Cantor-Bernstein theorem, boolean element of an MV-algebra, partition of unity, direct product decomposition, ?-complete MV-algebra, multiplicative MV-algebra, MV-algebra |
19 | Jan Jakubik |
Basic elements in a pseudo MV-algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 5(5), pp. 372-375, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Basic element, B-atomicity, Direct product decomposition, Strong subdirect product, Pseudo MV-algebra |
18 | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson |
New direct-product testers and 2-query PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 131-140, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
testing, PCP, parallel repetition, direct products |
18 | Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson |
A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 15(4), pp. 391-432, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
06D15, 68Q17, 68Q15, 06E30, Subject classification. 68Q10 |
18 | Jun Geng, Rina Wang, Ziwen Chen |
Construction of non-direct product triangular norms on product lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 469, pp. 108637, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Chao Yang 0003, Jun-Ming Xu 0001 |
Connectivity of lexicographic product and direct product of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 111, pp. 3-12, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
18 | Noga Alon, Alexander Lubotzky, Avi Wigderson |
Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada, USA, pp. 630-637, 2001, IEEE Computer Society, 0-7695-1390-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
17 | Luca Trevisan |
List-Decoding Using The XOR Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 126-135, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Venkatesan Guruswami, Valentine Kabanets |
Hardness Amplification Via Space-Efficient Direct Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 556-568, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
error-correcting codes, expanders, Direct products, hardness amplification |
14 | Zhudeng Wang |
On the Direct Decomposability of QL-Implication Operators on Product Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (1) ![In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, 24-27 August 2007, Haikou, Hainan, China, Proceedings, Volume 1, pp. 201-203, 2007, IEEE Computer Society, 0-7695-2874-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
12 | Briana Foster-Greenwood, Christine Uhl |
Metric Dimension of a Direct Product of Three Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 31(2), 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Mitali Bafna, Noam Lifshitz, Dor Minzer |
Constant Degree Direct Product Testers with Small Soundness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR24, pp. TR24-020, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
12 | Mitali Bafna, Noam Lifshitz, Dor Minzer |
Constant Degree Direct Product Testers with Small Soundness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.00850, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Adela Khamis, Abd Ghafur Ahmad |
A note on direct product of complex intuitionistic fuzzy subfield. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Fuzzy Syst. ![In: J. Intell. Fuzzy Syst. 45(2), pp. 2111-2132, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Büsra Özden, Oguz Yayla |
Partial direct product difference sets and almost quaternary sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Math. Commun. ![In: Adv. Math. Commun. 17(3), pp. 572-588, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Neeta Shinde, Smruti Mane, Baloo Waphare |
Identifying codes in the direct product of a path and a complete graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 43(2), pp. 463-486, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Minglu Bai, Yingzhi Tian, Jiaqiong Yin |
The Super Restricted Edge-connectedness of Direct Product Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Process. Lett. ![In: Parallel Process. Lett. 33(3), pp. 2350008:1-2350008:7, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Eman Bakhdher, Ahmad M. Alghamdi |
Modular Conjectures for Direct Product of Finite Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 15(12), pp. 2143, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Luca Calderoni, Luciano Margara, Moreno Marzolla |
A Heuristic for Direct Product Graph Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 27(7), pp. 581-601, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yanita Yanita, Budi Rudianto |
The Picture on the Presentation of Direct Product Group of Two Cyclic Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Math. ![In: J. Appl. Math. 2023, pp. 8018645:1-8018645:6, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mitali Bafna, Dor Minzer |
Characterizing Direct Product Testing via Coboundary Expansion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
12 | Mitali Bafna, Dor Minzer |
Characterizing Direct Product Testing via Coboundary Expansion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.09668, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Jiaqi Liu, Fang-Wei Fu 0001 |
Learning with Errors over Group Rings Constructed by Semi-direct Product. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.15868, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Huiwen Cheng, Rezvan Varmazyar, Mohsen Ghasemi |
On k-restricted connectivity of direct product of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 15(8), pp. 2250175:1-2250175:7, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Jiaqi Liu, Fang-Wei Fu 0001 |
Learning with Errors over Group Rings Constructed by Semi-direct Product. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2023, pp. 1824, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
12 | Farnaz Soliemany, Mohsen Ghasemi, Rezvan Varmazyar |
On the super connectivity of direct product of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Oper. Res. ![In: RAIRO Oper. Res. 56(4), pp. 2767-2773, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jiaqiong Yin, Yingzhi Tian |
Super Connected Direct Product of Graphs and Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Axioms ![In: Axioms 11(6), pp. 277, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Nicola Rizzo 0001, Alexandru I. Tomescu, Alberto Policriti |
Solving String Problems on Graphs Using the Labeled Direct Product. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(10), pp. 3008-3033, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Farnaz Soliemany, Mohsen Ghasemi, Rezvan Varmazyar |
Super connectivity of a family of direct product graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. Comput. Syst. Theory ![In: Int. J. Comput. Math. Comput. Syst. Theory 7(1), pp. 1-5, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Raúl M. Falcón, M. Venkatachalam, S. Gowri, G. Nandini |
On the r-dynamic coloring of the direct product of a path and a k-subdivision of a star graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 14(3), pp. 2150121:1-2150121:19, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mun See Chang, Christopher Jefferson |
Disjoint direct product decompositions of permutation groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 108, pp. 1-16, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Markus Holzer 0001, Christian Rauch 0001 |
On the Descriptional Complexity of the Direct Product of Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCFS ![In: Descriptional Complexity of Formal Systems - 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings, pp. 100-111, 2022, Springer, 978-3-031-13256-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Luca Calderoni, Luciano Margara, Moreno Marzolla |
Direct product primality testing of graphs is GI-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 860, pp. 72-83, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Rahul Jain 0001, Srijita Kundu |
A direct product theorem for quantum communication complexity with applications to device-independent QKD. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Luca Calderoni, Luciano Margara, Moreno Marzolla |
A Heuristic for Direct Product Graph Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.03133, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki |
Most direct product of graphs are Type 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.14453, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Rahul Jain 0001, Srijita Kundu |
A direct product theorem for quantum communication complexity with applications to device-independent QKD. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.04299, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Nicola Rizzo 0001, Alexandru I. Tomescu, Alberto Policriti |
The Labeled Direct Product Optimally Solves String Problems on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.05290, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | David Lanzenberger, Ueli Maurer |
Direct Product Hardness Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2021, pp. 1229, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Amanda Burcroff |
Tightness of domination inequalities for direct product graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 344(9), pp. 112495, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Mariusz Grech |
Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Math. Contemp. ![In: Ars Math. Contemp. 21(2), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Muhammad Gulzar, Muhammad Haris Mateen, Yu-Ming Chu 0001, Dilshad Alghazzawi, Ghazanfar Abbas |
Generalized Direct Product of Complex Intuitionistic Fuzzy Subrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Intell. Syst. ![In: Int. J. Comput. Intell. Syst. 14(1), pp. 582-593, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | David Lanzenberger, Ueli Maurer |
Direct Product Hardness Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC (2) ![In: Theory of Cryptography - 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part II, pp. 605-625, 2021, Springer, 978-3-030-90452-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Rahul Jain 0001, Srijita Kundu |
A direct product theorem for quantum communication complexity with applications to device-independent QKD. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pp. 1285-1295, 2021, IEEE, 978-1-6654-2055-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon |
On total coloring the direct product of complete graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LAGOS ![In: Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, Online Event / São Paulo, Brazil, May 2021., pp. 306-314, 2021, Elsevier. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Rahul Jain 0001, Srijita Kundu |
A Direct Product Theorem for One-Way Quantum Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 27:1-27:28, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Rahul Jain 0001, Srijita Kundu |
A Direct Product Theorem for One-Way Quantum Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR20, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Rahul Jain 0001, Srijita Kundu |
A Direct Product Theorem for One-Way Quantum Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2008.08963, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Büsra Özden, Oguz Yayla |
Partial direct product difference sets and sequences with ideal autocorrelation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.12497, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Luca Calderoni, Luciano Margara, Moreno Marzolla |
Direct Product Primality Testing of Graphs is GI-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.01591, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Nibedita Mandal, Pratima Panigrahi |
L(2, 1)-colorings and irreducible no-hole colorings of the direct product of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 280, pp. 186-200, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Ruizhi Lin, Heping Zhang, Weisheng Zhao |
Matching preclusion for direct product of regular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 277, pp. 221-230, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Elazar Goldenberg, Karthik C. S. |
Toward a General Direct Product Testing Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Theory ![In: ACM Trans. Comput. Theory 12(1), pp. 7:1-7:18, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Kyle MacKeigan, Jeannette C. M. Janssen |
Total colouring of some cartesian and direct product graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Contributions Discret. Math. ![In: Contributions Discret. Math. 15(1), pp. 67-71, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Emel Asici, Radko Mesiar |
Direct product of nullnorms on bounded lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Fuzzy Syst. ![In: J. Intell. Fuzzy Syst. 36(6), pp. 5745-5756, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Antonio G. García 0001, Miguel Angel Hernández-Medina, Gerardo Pérez-Villalón |
Sampling Associated with a Unitary Representation of a Semi-Direct Product of Groups: A Filter Bank Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 11(4), pp. 529, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Elazar Goldenberg, Karthik C. S. |
Towards a General Direct Product Testing Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.06220, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Mei Lu, Jiale Xu, Yi Zhang |
Identifying codes in the direct product of a complete graph and some special graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 254, pp. 175-182, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Mariusz Grech, Wilfried Imrich, Anna Dorota Krystek, Lukasz Jan Wojakowski |
Direct product of automorphism groups of digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Math. Contemp. ![In: Ars Math. Contemp. 17(1), pp. 89-101, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Huiwen Cheng, Xiaoxia Ma, Xiaojing Du |
Super edge connectivity of direct product of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 140, pp. 329-336, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
12 | C. Y. Chew, Angelina Y. M. Chin, C. S. Lim |
The number of subgroups of a direct product of cyclic p-groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 139, pp. 353-360, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
12 | Colin Defant, Sumun Iyer |
Domination and upper domination of direct product graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(10), pp. 2742-2752, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
12 | Elazar Goldenberg, Karthik C. S. |
Towards a General Direct Product Testing Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, December 11-13, 2018, Ahmedabad, India, pp. 11:1-11:17, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-093-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
12 | Christian Jäkel, Stefan E. Schmidt |
Rectangle and Square Coverings of Tolerance Spaces and Their Direct Product. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCA4AI@IJCAI ![In: Proceedings of the 6th International Workshop `What can FCA do for Artificial Intelligence`? co-located with International Joint Conference on Artificial Intelligence and European Conference on Artificial Intelligence (IJCAI/ECAI 2018), Stockholm, Sweden, July 13, 2018., pp. 57-68, 2018, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
12 | A. K. Bhuniya, Sajal Kumar Mukherjee |
On the power graph of the direct product of two groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 63, pp. 197-202, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Wojciech Dzik, Sándor Radeleczki |
Direct Product of ℓ-Algebras and Unification: An Application to Residuated Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Multiple Valued Log. Soft Comput. ![In: J. Multiple Valued Log. Soft Comput. 28(2-3), pp. 189-215, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
12 | Irit Dinur, Inbal Livni Navon |
Exponentially Small Soundness for the Direct Product Z-test. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR17, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
12 | Byeong Moon Kim, Yoomi Rho, Byung Chul Song |
Lambda number for the direct product of some family of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 33(4), pp. 1257-1265, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Christian Jäkel, Stefan E. Schmidt |
Blocks of the Direct Product of Tolerance Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems - 23rd International Symposium, ISMIS 2017, Warsaw, Poland, June 26-29, 2017, Proceedings, pp. 587-596, 2017, Springer, 978-3-319-60437-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Irit Dinur, Inbal Livni Navon |
Exponentially Small Soundness for the Direct Product Z-Test. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia, pp. 29:1-29:50, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-040-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 273 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ >>] |
|