|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 530 occurrences of 340 keywords
|
|
|
Results
Found 1239 publication records. Showing 1239 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
119 | Sebastian Unger, Frank Mueller 0001 |
Handling irreducible loops: optimized node splitting versus DJ-graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 24(4), pp. 299-333, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
irreducible flowgraphs, reducible flowgraphs, compilation, instruction-level parallelism, Code optimization, loops, control flow graphs, node splitting |
111 | Francisco Rodríguez-Henríquez, Çetin Kaya Koç |
Parallel Multipliers Based on Special Irreducible Pentanomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 52(12), pp. 1535-1542, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
pentanomials, multipliers for GF(2^m), Finite fields arithmetic, parallel multipliers |
88 | Grant Pogosyan, Akihiro Nozaki |
Join-Irreducible Clones of Multiple-Valued Logic Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 25th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1995, Bloomington, Indiana, USA, May 23-25, 1995, Proceedings, pp. 194-199, 1995, IEEE Computer Society, 0-8186-7118-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
join-irreducible clones, multiple valued logic algebra, synthetic means, lattice elements, join irreducible elements, unary functions, constructive criteria, graph theoretical property, one variable function, k valued logic, graph theory, set theory, multivalued logic, group theory, monoids, join operation, generating system |
77 | Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima |
On Factoring Multi-Variate Polynomials over Algebraically Closed Fields (abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '90, Tokyo, Japan, August 20-24, 1990, pp. 297, 1990, ACM, 0-201-54892-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
73 | Grant Pogosyan, Ivo G. Rosenberg |
Generation of the Post Lattice by Irreducible Clones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 16-19 May 2003, Tokyo, Japan, pp. 309-314, 2003, IEEE Computer Society, 0-7695-1918-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
71 | Tong Zhang 0002, Keshab K. Parhi |
Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 50(7), pp. 734-749, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Finite (or Galois) field, standard basis, complexity, multiplication, VLSI architecture, irreducible polynomials, Toeplitz matrix |
71 | Torsten Minkwitz |
Extensions of irreducible representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 7(5), pp. 391-399, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Irreducible Ordinary Representations, Generalized Fourier Transforms, Group Theory |
63 | Paul Havlak |
Nesting of Reducible and Irreducible Loops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 19(4), pp. 557-567, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
reducible loops, strongly-connected regions |
61 | Ying Cheng 0006, S. Sitharama Iyengar, Rangasami L. Kashyap |
A New Method of Image Compression using Irreducible Covers of Maximum Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 14(5), pp. 651-658, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
irreducible covers, maximal rectangles, concurrent-read-exclusive write, parallel algorithm, parallel algorithms, data structures, data compression, computerised picture processing, image compression, pixels |
54 | José Luis Imaña, Román Hermida, Francisco Tirado |
Low Complexity Bit-Parallel Multipliers Based on a Class of Irreducible Pentanomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 14(12), pp. 1388-1393, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
54 | Juan A. Carrasco |
Solving dependability/performability irreducible Markov models using regenerative randomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 52(3), pp. 319-329, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
54 | Sebastian Unger, Frank Mueller 0001 |
Handling Irreducible Loops: Optimized Node Splitting vs. DJ-Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2001: Parallel Processing, 7th International Euro-Par Conference Manchester, UK August 28-31, 2001, Proceedings, pp. 207-220, 2001, Springer, 3-540-42495-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
54 | Toshiya Itoh |
Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynominals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGAL International Symposium on Algorithms ![In: Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings, pp. 181-190, 1990, Springer, 3-540-52921-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
52 | Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj |
On Irreducible Descriptive Sets of Attributes for Information Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSCTC ![In: Rough Sets and Current Trends in Computing, 6th International Conference, RSCTC 2008, Akron, OH, USA, October 23-25, 2008, Proceedings, pp. 21-30, 2008, Springer, 978-3-540-88423-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
maximal consistent extensions, irreducible descriptive sets, rough sets, information systems |
52 | Sun-Mi Park, Ku-Young Chang, Dowon Hong |
Efficient Bit-Parallel Multiplier for Irreducible Pentanomials Using a Shifted Polynomial Basis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 55(9), pp. 1211-1215, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
shifted polynomial basis, irreducible pentanomial, finite field arithmetic, Bit-parallel multiplier |
52 | José Luis Imaña, Juan Manuel Sánchez, Francisco Tirado |
Bit-Parallel Finite Field Multipliers for Irreducible Trinomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 55(5), pp. 520-533, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Finite (or Galois) fields, canonical basis, triangular basis, complexity, permutation, multiplication, cycles, matrix decomposition, transpositions, irreducible trinomials |
52 | Mikhail Ju. Moshkov |
On Construction of the Set of Irreducible Partial Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005, Proceedings, pp. 38-44, 2005, Springer, 3-540-29498-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Irreducible partial cover, totally polynomial algorithm |
52 | Yong Ho Hwang, Sang Gyoo Sim, Pil Joong Lee |
Bit-Serial Multipliers for Exponentiation and Division in GF(2m) Using Irreducible AOP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part I, pp. 442-450, 2004, Springer, 3-540-22054-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Irreducible AOP, Finite field, Exponentiation, Bit-serial multiplier |
52 | Alper Halbutogullari, Çetin Kaya Koç |
Mastrovito Multiplier for General Irreducible Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 49(5), pp. 503-518, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
complexity, Finite fields, multiplication, irreducible polynomials, polynomial basis |
50 | László Babai, Lajos Rónyai |
Computing Irreducible Representations of Finite Groups ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 93-98, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
deterministic polynomial time, matrices list, randomized polynomial time, Las Vegas polynomial time, generators set, bit complexity, inequivalent irreducible representations, multiplication table, polynomial-size description, absolutely irreducible constituents, polynomial-time algorithm, equivalence class, finite groups, complex numbers, exact computations, algebraic number fields |
46 | James N. Damon |
Tree Structure for Contractible Regions in R3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 74(2), pp. 103-116, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Blum medial axis, contractible region, irreducible medial components, essential and inessential fin curves, Y-network, top level and second level (directed) trees |
46 | Xia Wang, Jianmin Ma |
A Novel Approach to Attribute Reduction in Concept Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, First International Conference, RSKT 2006, Chongqing, China, July 24-26, 2006, Proceedings, pp. 522-529, 2006, Springer, 3-540-36297-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
partial relation, meet-irreducible element, Concept lattice, attribute reduction |
46 | Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong |
Compact Linear Systolic Arrays for Multiplication Using a Trinomial Basis in GF(2m) for High Speed Cryptographic Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part I, pp. 508-518, 2005, Springer, 3-540-25860-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
VLSI, finite field, systolic array, irreducible trinomial |
44 | Holger Boche, Slawomir Stanczak |
A note on some properties of the Perron root of nonnegative irreducible matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 18(4), pp. 369-378, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 15A48, 94A05 |
44 | Moulay A. Barkatou, Eckhard Pflügel |
Computing super-irreducible forms of systems of linear differential equations via moser-reduction: a new approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pp. 1-8, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
local analysis of linear differential systems, moser-reduction, super-reduction, computer algebra, singularities |
44 | Jacques Wolfmann |
Are 2-weight projective cyclic codes irreducible? ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(2), pp. 733-737, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Yves Aubry, Philippe Langevin |
On the Weights of Binary Irreducible Cyclic Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCC ![In: Coding and Cryptography, International Workshop, WCC 2005, Bergen, Norway, March 14-18, 2005. Revised Selected Papers, pp. 46-54, 2005, Springer, 978-3-540-35481-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Jong-Hak Hwang, Kyung-Jae Moon, Seung-Yong Park, Heung-Soo Kim |
A New Construction of the Irreducible Polynomial for parallel multiplier over GF(2m). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 16-19 May 2003, Tokyo, Japan, pp. 24-32, 2003, IEEE Computer Society, 0-7695-1918-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Systolic Multiplier, IPG, Trinomial, Finite Field |
44 | Grant Pogosyan |
Efficiently Irreducible Bases in Multiple-Valued Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 26th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1996, Santiago de Compostela, Spain, May 29-31, 1996, Proceedings, pp. 296-301, 1996, IEEE Computer Society, 0-8186-7392-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
efficiency, completeness, circuit design, logic functions, basis |
44 | Erich L. Kaltofen |
Computing the Irreducible Real Factors and Components of an Algebraic Curve. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbrücken, Germany, June 5-7, 1989, pp. 79-87, 1989, ACM, 0-89791-318-3. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
42 | Xia Wang, Wenxiu Zhang |
Knowledge Reduction in Concept Lattices Based on Irreducible Elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Comput. Sci. ![In: Transactions on Computational Science V, Special Issue on Cognitive Knowledge Representation, pp. 128-142, 2009, Springer, 978-3-642-02096-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
irreducible element, attribute characteristic, Concept lattice, knowledge reduction |
42 | Omran Ahmadi |
Self-Reciprocal Irreducible Pentanomials Over F2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 38(3), pp. 395-397, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
self-reciprocal irreducible polynomials, finite fields |
42 | Jeffrey S. Olson |
Subdirectly Irreducible Residuated Semilattices and Positive Universal Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 83(1-3), pp. 393-406, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
positive universal formulas, subdirectly irreducible algebras, contraction, linear logic, residuated lattices, Residuation |
42 | Tetsuo Saitou, Mitsugu Suzuki, Tan Watanabe |
Dominance analysis of irreducible CFGs by reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 40(4), pp. 10-19, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
dominance frontier, immediate dominator, reduction, control flow graph, dominator tree, irreducible |
42 | R. Alexander Milowski |
Computing irredundant irreducible decompositions of large scale monomial ideals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 235-242, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
alexander dual, irredundant irreducible decomposition, monomial ideals, scarf complex |
42 | Marcel Erné, Branimir Seselja, Andreja Tepavcevic |
Posets Generated by Irreducible Elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 20(1), pp. 79-89, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
(completely) irreducible, join-dense, completion, poset, complete lattice |
42 | Arnold Knopfmacher, J. N. Ridley, Gary L. Mullen |
Nets and Sequences Obtained from Irreducible Polynomials Over Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 9(3), pp. 265-269, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
(t, m, s)-net in base b, Finite field, Irreducible Polynomial |
42 | Igor E. Shparlinski |
On irreducible polynomials of small height over finite fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 7(6), pp. 427-431, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Distribution of prime numbers, Finite fields, Irreducible polynomials |
42 | W. M. Chu |
Construction of irreducible polynomials using cubic transformation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 7(1), pp. 15-19, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Finite fields, irreducible polynomials |
38 | J. Rafael Sendra, Juana Sendra |
Rationality Analysis and Direct Parametrization of Generalized Offsets to Quadrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 11(2), pp. 111-139, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Offset surfaces, Parametrization, Computer-aided geometric design, Rationality, Quadrics |
38 | Shreeram S. Abhyankar, Chandrajit L. Bajaj |
Automatic parameterization of rational curves and surfaces IV: algebraic space curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 8(4), pp. 325-334, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
37 | Anna Maria Bigatti, Eduardo Sáenz-de-Cabezón |
Computation of the (n-1)-st Koszul Homology of monomialideals and related algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pp. 31-38, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
cocoalib, irreducible decomposition, koszul homology, monomial ideal, stanley decomposition, betti numbers |
37 | Yoshihito Tanaka |
An Infinitary Extension of Jankov's Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 86(1), pp. 111-131, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Subdirectly irreducible algebra, Heyting algebra, Infinitary logic |
37 | Toshiya Nakajima, Tetsuya Izu, Tsuyoshi Takagi |
Reduction Optimal Trinomials for Efficient Software Implementation of the etaT Pairing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWSEC ![In: Advances in Information and Computer Security, Second International Workshop on Security, IWSEC 2007, Nara, Japan, October 29-31, 2007, Proceedings, pp. 44-57, 2007, Springer, 978-3-540-75650-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
reduction optimal trinomial, finite field, pairing, irreducible polynomial, software implementation, characteristic three |
37 | Gui-Lin Zhang, Xiao-Shan Gao |
Properties of Ascending Chains for Partial Difference Polynomial Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASCM ![In: Computer Mathematics, 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers, pp. 307-321, 2007, Springer, 978-3-540-87826-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Ascending chain, coherent chain, regular chain, irreducible chain, partial difference polynomial, characteristic set |
37 | Haining Fan, Yiqi Dai |
Fast Bit-Parallel GF(2^n) Multiplier for All Trinomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 54(4), pp. 485-490, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Finite field, multiplication, polynomial basis, irreducible trinomial |
37 | Marcel Erné |
Intervals in Lattices of alpha-Meet-Closed Subsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 21(2), pp. 137-153, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
(weakly) atomic, (strongly) coatomic, extremally detachable, meet-closed, interval, prime, semilattice, complete lattice, irreducible |
37 | Yves Diers |
Affine Algebraic Varieties Relative to an Algebraic Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 9(1), pp. 35-40, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
affine algebraic variety, irreducible algebra, algebraic theory |
35 | Chiou-Yng Lee, Jenn-Shyong Horng, I-Chang Jou, Erl-Huei Lu |
Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2m). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 54(9), pp. 1061-1070, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
irreducible AOP, finite field, montgomery multiplication, irreducible trinomial, Bit-parallel systolic multiplier |
34 | Cunsheng Ding |
The Weight Distribution of Some Irreducible Cyclic Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 55(3), pp. 955-960, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Marta Giorgetti |
Interesting Examples on Maximal Irreducible Goppa Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 18th International Symposium, AAECC-18 2009, Tarragona, Catalonia, Spain, June 8-12, 2009. Proceedings, pp. 215-218, 2009, Springer, 978-3-642-02180-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Solomon W. Golomb, Pey-Feng Lee |
Irreducible Polynomials Which Divide Trinomials Over GF, (2). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(2), pp. 768-774, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Yde Venema |
A Dual Characterization of Subdirectly Irreducible BAOs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 77(1), pp. 105-115, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Boolean algebras with operators, subdirect irreducibility, duality |
34 | Solomon W. Golomb, Pey-Feng Lee |
Which Irreducible Polynomials Divide Trinomials over GF(2)? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETA ![In: Sequences and Their Applications - SETA 2004, Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers, pp. 414-424, 2004, Springer, 3-540-26084-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Grant Pogosyan, Ivo G. Rosenberg |
Algebraic Properties of Totally Irreducible Elements of Clone Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), 19-22 May 2004, Toronto, Canada, pp. 109-114, 2004, IEEE Computer Society, 0-7695-2130-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Arturas Dubickas |
Polynomials Irreducible by Eisenstein's Criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 14(2), pp. 127-132, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Ioan Tomescu |
On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 544-553, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Jaemoon Kim, Ikkwon Yie, Seung Ik Oh, Hyung-Don Kim, Jado Ryu |
Fast Generation of Cubic Irreducible Polynomials for XTR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INDOCRYPT ![In: Progress in Cryptology - INDOCRYPT 2001, Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001, Proceedings, pp. 73-78, 2001, Springer, 3-540-43010-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Alper Halbutogullari, Çetin Kaya Koç |
Mastrovito Multiplier for General Irreducible Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 13th International Symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999, Proceedings, pp. 498-507, 1999, Springer, 3-540-66723-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Joachim von zur Gathen |
Irreducible Polynomials over Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings, pp. 252-262, 1986, Springer, 3-540-17179-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
32 | Victor Shoup |
New Algorithms for Finding Irreducible Polynomials over Finite Fields ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 283-290, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
specified degree, finite fields, polynomial time, irreducible polynomials, deterministic |
30 | Zhicheng Gao |
Improved Error Bounds for the Number of Irreducible Polynomials and Self-Reciprocal Irreducible Monic Polynomials with Prescribed Coefficients over a Finite Field. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AofA ![In: 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2022, June 20-24, 2022, Philadelphia, PA, USA., pp. 9:1-9:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-230-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
30 | Kondwani Magamba, John A. Ryan |
Enumeration of irreducible and extended irreducible Goppa codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.02791, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
30 | Harald Niederreiter |
An Enumeration Formula for Certain Irreducible Polynomials with an Application to the Construction of Irreducible Polynomials over the Binary Field. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 1, pp. 119-124, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
29 | Huaming Zhang, Milind Vaidya |
On Open Rectangle-of-Influence Drawings of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 123-134, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Andrew J. Sommese, Charles W. Wampler |
Exceptional Sets and Fiber Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 8(2), pp. 171-196, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Hari Krovi, Martin Rötteler |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MMICS ![In: Mathematical Methods in Computer Science, MMICS 2008, Karlsruhe, Germany, December 17-19, 2008 - Essays in Memory of Thomas Beth, pp. 70-88, 2008, Springer, 978-3-540-89993-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hidden subgroup problem, coset states, quantum algorithms |
29 | Jia Li 0023, Xiao-Shan Gao |
A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASCM ![In: Computer Mathematics, 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers, pp. 246-262, 2007, Springer, 978-3-540-87826-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
zero dimensional variety, irredundant decomposition, resultant, Algebraic variety |
29 | Adrian Craciun, Madalina Hodorog |
Decompositions of Natural Numbers: From a Case Study in Mathematical Theory Exploration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SYNASC ![In: Proceedings of the Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2007, Timisoara, Romania, September 26-29, 2007, pp. 41-47, 2007, IEEE Computer Society, 978-0-7695-3078-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Joachim von zur Gathen |
Counting reducible and singular bivariate polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pp. 369-376, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
bivariate polynomials, combinatorics on polynomials, reducible polynomials, singular polynomials, finite fields, counting problems |
29 | Xiao-Shan Gao, Chun-Ming Yuan |
Resolvent systems of difference polynomial ideals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pp. 101-108, 2006, ACM, 1-59593-276-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
difference ascending chain, difference polynomial, difference variety, unmixed decomposition, resolvent |
29 | Kosaku Nagasaka |
Towards More Accurate Separation Bounds of Empirical Polynomials II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, Kalamata, Greece, September 12-16, 2005, Proceedings, pp. 318-329, 2005, Springer, 3-540-28966-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Huapeng Wu |
Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 51(7), pp. 750-758, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
hardware architecture, Finite fields arithmetic, polynomial basis |
29 | Arash Reyhani-Masoleh, M. Anwarul Hasan |
A New Construction of Massey-Omura Parallel Multiplier over GF(2m). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 51(5), pp. 511-520, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
optimal normal bases, Finite field, Massey-Omura multiplier, all-one polynomial |
29 | David McSherry |
Precision and Recall in Interactive Case-Based Reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCBR ![In: Case-Based Reasoning Research and Development, 4th International Conference on Case-Based Reasoning, ICCBR 2001, Vancouver, BC, Canada, July 30 - August 2, 2001, Proceedings, pp. 392-406, 2001, Springer, 3-540-42358-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Huapeng Wu |
On Complexity of Polynomial Basis Squaring in F2m. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography, 7th Annual International Workshop, SAC 2000, Waterloo, Ontario, Canada, August 14-15, 2000, Proceedings, pp. 118-129, 2000, Springer, 3-540-42069-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Huapeng Wu |
Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHES ![In: Cryptographic Hardware and Embedded Systems, First International Workshop, CHES'99, Worcester, MA, USA, August 12-13, 1999, Proceedings, pp. 280-291, 1999, Springer, 3-540-66646-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
29 | J. Robin B. Cockett, J. A. Hierrera |
Decision Tree Reduction ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 37(4), pp. 815-842, October 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
29 | Ravi Sethi |
Testing for the Church-Rosser Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 21(4), pp. 671-679, 1974. The full citation details ...](Pics/full.jpeg) |
1974 |
DBLP DOI BibTeX RDF |
|
27 | Jie Fang |
Ockham Algebras with Balanced Double Pseudocomplementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 90(2), pp. 189-209, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
double pseudocomplementation, Ockham algebra, Priestely duality, subdirectly irreducible |
27 | Guang Zeng, Yang Yang, Wenbao Han, Shuqin Fan |
Reducible Polynomial over F2 Constructed by Trinomial sigma-LFSR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inscrypt ![In: Information Security and Cryptology, 4th International Conference, Inscrypt 2008, Beijing, China, December 14-17, 2008, Revised Selected Papers, pp. 192-200, 2008, Springer, 978-3-642-01439-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Stickelberger-Swan Theorem, ??LFSR, Finite Field, Linear Feedback Shift Register(LFSR), Irreducible Polynomial |
27 | Jing Liu, Ju-Sheng Mi |
A Novel Approach to Attribute Reduction in Formal Concept Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, Third International Conference, RSKT 2008, Chengdu, China, May 17-19, 2008. Proceedings, pp. 426-433, 2008, Springer, 978-3-540-79720-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Meet-irreducible element, Concept lattice, Attribute reduction, Formal context |
27 | Omran Ahmadi |
The trace spectra of polynomial bases for F2n. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 18(4), pp. 391-396, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Polynomial bases, Finite fields, Irreducible polynomials |
27 | Peter Bürgisser, Peter Scheiblechner |
Differential forms in computational algebraic geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pp. 61-68, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
differential forms, irreducible components, complexity, connected components |
27 | Joel Berman, Willem J. Blok |
Algebras Defined from Ordered Sets and the Varieties they Generate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 23(1), pp. 65-88, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
equationally definable order relation, subdirectly irreducible, Hilbert algebra, order algebra, algebra, ordered set, semilattice, quasi-order, free algebra |
27 | Haining Fan, M. Anwar Hasan |
Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 55(9), pp. 1202-1206, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Montgomery multiplication algorithm, shifted polynomial basis, Finite field, multiplication, polynomial basis, irreducible trinomial |
27 | R. Padmanabhan, P. Penner |
Semilattice Operations Generated by Lattice Terms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 21(3), pp. 257-263, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
quasilattice, compatible orders, subdirectly irreducible, distributive multisemilattice, pseudomedian algebras, lattice, semilattice, modular lattice |
27 | Jun-Cheol Jeon, Kee-Young Yoo |
An Evolutionary Approach to the Design of Cellular Automata Architecture for Multiplication in Elliptic Curve Cryptography over Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRICAI ![In: PRICAI 2004: Trends in Artificial Intelligence, 8th Pacific Rim International Conference on Artificial Intelligence, Auckland, New Zealand, August 9-13, 2004, Proceedings, pp. 241-250, 2004, Springer, 3-540-22817-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Evolutionary Computation, Cellular Automata, Finite Fields, Elliptic Curve Cryptography, Multiplication, Irreducible Polynomial |
27 | Yasuyuki Nogami, Yoshitaka Morikawa |
A Method for Distinguishing the Two Candidate Elliptic Curves in CM Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICISC ![In: Information Security and Cryptology - ICISC 2004, 7th International Conference, Seoul, Korea, December 2-3, 2004, Revised Selected Papers, pp. 249-260, 2004, Springer, 3-540-26226-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
CM method, irreducible cubic polynomial, quadratic power residue/non residue |
27 | Jan Verschelde |
Numerical algebraic geometry and symbolic computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 3, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
irreducible decomposition, numerical homotopy continuation, polynomial systems, approximate factorization |
27 | G. Ramalingam |
On loops, dominators, and dominance frontiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 24(5), pp. 455-490, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
irreducible graph, iterated dominance frontier, least common ancestor, loop nesting forest, sparse evaluation, graph transformation, Dominator, loop |
27 | Sabrina A. Hessinger |
Computing the Galois Group of a Linear Differential Equation of Order Four. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 11(6), pp. 489-536, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Algebraic Group, Differential Galois Group, Imprimitive, Monomial, Linear Group, Representation, Primitive, Irreducible |
27 | Branimir Seselja, Andreja Tepavcevic |
Collection of Finite Lattices Generated by a Poset. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 17(2), pp. 129-139, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
finite distributive lattice, finite lattice, meet-irreducible, representation of lattices |
27 | M. R. Darafsheh, Mohammad Reza Pournaki |
Computation of the Dimensions of Symmetry Classes of Tensors Associated with the Finite two Dimensional Projective Special Linear Group. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 10(3), pp. 237-250, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Symmetry classes of tensors, Actions of symmetric groups, Irreducible characters, Projective special linear group |
27 | Clifford Bergman, Giora Slutzki |
Computational Complexity of Some Problems Involving Congruences on Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pp. 168-174, 2000, IEEE Computer Society, 0-7695-0725-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
fully invariant, subdirectly irreducible, nondeterministic log-space, nondeterministic polynomial time, congruence, simple |
27 | G. Ramalingam |
Identifying Loops in Almost Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 21(2), pp. 175-188, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
irreducible flowgraphs, loops |
27 | Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee |
Identifying Loops Using DJ Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 18(6), pp. 649-658, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
DJ graphs, Tarjan's interval, irreducible flowgraphs, reducible flowgraphs, dominator trees |
27 | Albrecht P. Stroele |
Signature analysis and aliasing for sequential circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 13th IEEE VLSI Test Symposium (VTS'95), April 30 - May 3, 1995, Princeton, New Jersey, USA, pp. 118-124, 1995, IEEE Computer Society, 0-8186-7000-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
built-in self-test techniques, test registers, subcircuits, irreducible characteristic polynomial, limiting value, fault diagnosis, logic testing, built-in self test, integrated circuit testing, sequential circuits, sequential circuits, aliasing, signature analysis, shift registers, test lengths |
27 | John R. B. Whittlesey |
A comparison of the correlational behavior of random number generators for the IBM 360. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 11(9), pp. 641-644, 1968. The full citation details ...](Pics/full.jpeg) |
1968 |
DBLP DOI BibTeX RDF |
32-bit versus 36-bit word size, IBM 360, congruential generators, digital shift-register generators, linear recurrence modulo two, primitive trinomials modulo two, serial correlation, statistical tests for randomness, random numbers, irreducible polynomials, pseudorandom number generators, prime numbers, autocorrelation function |
25 | Snehal Udar, Dimitri Kagaris |
LFSR Reseeding with Irreducible Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IOLTS ![In: 13th IEEE International On-Line Testing Symposium (IOLTS 2007), 8-11 July 2007, Heraklion, Crete, Greece, pp. 293-298, 2007, IEEE Computer Society, 0-7695-2918-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 1239 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|