Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
122 | S. Unnikrishna Pillai, Ben Liang 0001 |
Two-Dimensional Blind Deconvolution Using a Robust GCD Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (1) ![In: Proceedings 1997 International Conference on Image Processing, ICIP '97, Santa Barbara, California, USA, October 26-29, 1997, pp. 424-427, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
2D blind deconvolution, robust GCD approach, blind image deconvolution, two-dimensional polynomials, distorted images, FIR distortion filters, co-prime filters, 1D Sylvester-type GCD algorithms, support size, synthetically blurred images, real motion-blurred pictures, lD interpolation, discrete Fourier transform, experimental results, noisy images, noise robustness, deconvolution, greatest common divisor, deblurring, z-transforms, computational complexity reduction |
114 | Akira Terui |
An iterative method for calculating approximate GCD of univariate polynomials. ![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. 351-358, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximate polynomial gcd, gradient-projection method, optimization, ill-conditioned problem |
114 | George Havas, Jean-Pierre Seifert |
The Complexity of the Extended GCD Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings, pp. 103-113, 1999, Springer, 3-540-66408-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
computational problems of diophantine equations, extended gcd computations, Approximation algorithms, NP-hardness, probabilistically checkable proofs, interactive proof systems |
93 | Saurabh Agarwal, Gudmund Skovbjerg Frandsen |
Binary GCD Like Algorithms for Some Complex Quadratic Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings, pp. 57-71, 2004, Springer, 3-540-22156-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
87 | K. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal |
Lower Bounds for Group Covering Designs. ![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. 334-345, 1999, Springer, 3-540-66723-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
78 | Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi |
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pp. 169-176, 2006, ACM, 1-59593-276-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximate multiple root, approximate polynomial gcd, multivariate polynomial gcd, singular polynomial, linear constraint, symbolic/numeric hybrid method |
78 | Kenneth Weber |
The Accelerated Integer GCD Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 21(1), pp. 111-122, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
integer greatest common divisor, number-theoretic computations, GCD |
69 | Jennifer de Kleine, Michael B. Monagan, Allan D. Wittkopf |
Algorithms for the non-monic case of the sparse modular GCD algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 124-131, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Zippel's algorithm, polynomial greatest common divisors, sparse multivariate polynomials, probabilistic algorithms, modular algorithms |
69 | Joachim von zur Gathen, Igor E. Shparlinski |
GCD of Random Linear Forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 464-469, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
69 | Mark van Hoeij, Michael B. Monagan |
Algorithms for polynomial GCD computation over algebraic function fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 297-304, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
modular algorithms |
69 | Mark van Hoeij, Michael B. Monagan |
A modular GCD algorithm over number fields presented with multiple extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings, pp. 109-116, 2002, ACM, 1-58113-484-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
69 | S. Unnikrishna Pillai, Ben Liang 0001 |
Blind image deconvolution using a robust GCD approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 8(2), pp. 295-301, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
69 | Mohamed Omar Rayes, Paul S. Wang, Kenneth Weber |
Parallelization of the Sparse Modular GCD Algorithm for Multivariate Polynomials on Shared Memory Multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '94, Oxford, UK, July 20-22, 1994, pp. 66-73, 1994, ACM, 0-89791-638-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
69 | Lars Langemyr |
An Asymptotically Fast Probabilitstic Algorithm for Computing Polynominal GCD's over an Algebraic Number Field. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 8th International Symposium, AAECC-8, Tokyo, Japan, August 20-24, 1990, Proceedings, pp. 222-233, 1990, Springer, 3-540-54195-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
65 | Saurabh Agarwal, Gudmund Skovbjerg Frandsen |
A New GCD Algorithm for Quadratic Number Rings with Unique Factorization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 30-42, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
quadratic number ring, quadratic form reduction, gcd |
64 | Abdulah Abdulah Zadeh |
High Speed Modular Divider Based on GCD Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICICS ![In: Information and Communications Security, 9th International Conference, ICICS 2007, Zhengzhou, China, December 12-15, 2007, Proceedings, pp. 189-200, 2007, Springer, 978-3-540-77047-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
GCD algorithm, Radix four, Finite Field, ECC |
64 | Seyed Mohammad Mahdi Javadi, Michael B. Monagan |
A sparse modular GCD algorithm for polynomials over algebraic function fields. ![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. 187-194, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
GCD algorithms, sparse interpolation, algebraic function fields |
64 | Dario Andrea Bini, Paola Boito |
Structured matrix-based methods for polynomial in-gcd: analysis and comparisons. ![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. 9-16, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
bézout matrix, cauchy matrices, displacement structure, polynomial gcd, sylvester matrix |
64 | Marc Joye, Pascal Paillier |
GCD-Free Algorithms for Computing Modular Inverses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHES ![In: Cryptographic Hardware and Embedded Systems - CHES 2003, 5th International Workshop, Cologne, Germany, September 8-10, 2003, Proceedings, pp. 243-253, 2003, Springer, 3-540-40833-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
RSA key generation, GCD algorithms, embedded software, efficient implementations, prime numbers, Modular inverses |
64 | Marc Moreno Maza, Renaud Rioboo |
Polynomial Gcd Computations over Towers of Algebraic Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995, Proceedings, pp. 365-382, 1995, Springer, 3-540-60114-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Polynomial gcd, zero dimensional systems, AXIOM, triangular sets, algebraic numbers, subresultants |
56 | Pramook Khungurn, Hiroshi Sekigawa, Kiyoshi Shirayanagi |
Minimum converging precision of the QR-factorization algorithm for real polynomial GCD. ![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. 227-234, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
algebraic algorithm stabilization, polynomial greatest common divisor |
56 | Joachim von zur Gathen, Igor E. Shparlinski |
GCD of Random Linear Combinations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 46(1), pp. 137-148, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
56 | Giovanni Cesari |
Parallel Implementation of Schönhage's Integer GCD Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, Third International Symposium, ANTS-III, Portland, Oregon, USA, June 21-25, 1998, Proceedings, pp. 64-76, 1998, Springer, 3-540-64657-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
53 | Joachim von zur Gathen, Igor E. Shparlinski |
Approximate Polynomial gcd: Small Degree and Small Height Perturbations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 276-283, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Euclidean algorithm, gcd, approximate computation |
52 | Daniel Lichtblau |
Half-GCD and fast rational recovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 231-236, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
integer gcd, rational recovery, subquadratic arithmetic |
49 | Yueming Wang, Gang Pan 0001, Zhaohui Wu 0001 |
3D Face Recognition in the Presence of Expression: A Guidance-based Constraint Deformation Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007), 18-23 June 2007, Minneapolis, Minnesota, USA, 2007, IEEE Computer Society, 1-4244-1179-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
49 | Erich L. Kaltofen, Lihong Zhi |
Hybrid symbolic-numeric computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pp. 7, 2006, ACM, 1-59593-276-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
symbolic/numeric hybrid methods |
46 | Tudor Jebelean |
Design of a systolic coprocessor for rational addition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASAP ![In: The International Conference on Application Specific Array Processors (ASAP'95), July 24-26, 1995, Strasbourg, France, pp. 282-289, 1995, IEEE Computer Society, 0-8186-7109-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
systolic coprocessor, rational addition, exact division, field programmable gate arrays, parallel architectures, systolic arrays, digital arithmetic, multiplication, addition, subtraction, rational numbers, GCD |
45 | Chang Hoon Kim, Soonhak Kwon, Jong Jin Kim, Chun Pyo Hong |
A Compact and Fast Division Architecture for a Finite Field. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2003, International Conference, Montreal, Canada, May 18-21, 2003, Proceedings, Part I, pp. 855-864, 2003, Springer, 3-540-40155-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Extended Binary GCD, VLSI, Finite Field, Division |
45 | Kleanthis Psarris, Santosh Pande |
Classical dependence analysis techniques: sufficiently accurate in practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 123-132, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
GCD test, Banerjee-Wolfe test, statement data dependence, automatic loop parallelization, Perfect benchmarks, exact test, program testing, data analysis, accuracy, parallelizing compilers, program diagnostics, sufficient conditions, program control structures, parallelising compilers, data dependence analysis, greatest common divisor, automatic vectorization |
44 | Zhonggang Zeng, Barry H. Dayton |
The approximate GCD of inexact polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 320-327, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
squarefree, polynomial, factorization, greatest common divisor |
44 | Ivan Damgård, Gudmund Skovbjerg Frandsen |
Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings, pp. 109-117, 2003, Springer, 3-540-40543-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Sidi Mohamed Sedjelmaci |
On a parallel Lehmer-Euclid GCD algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001, pp. 303-308, 2001, ACM, 1-58113-417-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
41 | Shuhong Gao, Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi |
Approximate factorization of multivariate polynomials via differential equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 167-174, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximate gcd, multivariate gcd, multivariate polynomial factorization, symbolic numeric hybrid method, singular value decomposition, approximate factorization |
39 | David Shallcross, Victor Y. Pan, Yu Lin-Kriz |
The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 557-564, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
NC equivalence, planar integer linear programming, Euclidean GCD, NC-reduction, remainder sequence, positive integers, Euclidean algorithm, P-completeness |
38 | Ahmet Ipek |
Upper bounds for the condition numbers of the GCD and the reciprocal GCD matrices in spectral norm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Math. Appl. ![In: Comput. Math. Appl. 63(3), pp. 645-651, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
38 | Weiduan Feng, Shaofang Hong, Jianrong Zhao |
Divisibility properties of power LCM matrices by power GCD matrices on gcd-closed sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(9), pp. 2627-2639, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
38 | André Weilert |
(1+i)-ary GCD Computation in Z[i] as an Analogue to the Binary GCD Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 30(5), pp. 605-617, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
38 | Rachid Bouraoui |
Calcul sur les grands nombres et VLSI : application au PGCD, au PGCD étendu et à la distance euclidienne. (Very large integer arithmetic in VLSI and its application to the gcd, entended gcd and euclidean distance algorithms). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1993 |
RDF |
|
38 | Alain Guyot |
OCAPI: architecture of a VLSI coprocessor for the GCD and the extended GCD of large numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Symposium on Computer Arithmetic ![In: 10th IEEE Symposium on Computer Arithmetic, ARITH 1991, Grenoble, France, June 26-28, 1991, pp. 226-231, 1991, IEEE, 0-8186-9151-4. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
38 | Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet |
GCDHEU: Heuristic Polynomial GCD Algorithm Based On Integer GCD Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 7(1), pp. 31-48, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
38 | Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet |
GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROSAM ![In: EUROSAM 84, International Symposium on Symbolic and Algebraic Computation, Cambridge, England, UK, July 9-11, 1984, Proceedings, pp. 285-296, 1984, Springer, 3-540-13350-X. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
37 | Loïck Lhote, Brigitte Vallée |
Gaussian Laws for the Main Parameters of the Euclid Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(4), pp. 497-554, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Euclid’s algorithms, Distributional analysis, Transfer operator, Asymptotic Gaussian laws, Tauberian theorems, Perron’s formula, Dynamical analysis of algorithms, Dynamical systems, Analysis of algorithms, Average-case analysis |
37 | Doreen Hertel, Alexander Pott |
Two results on maximum nonlinear functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 47(1-3), pp. 225-235, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
05B25, AMS Classifications 05B10 |
37 | Keyvan Zarifi, Alex B. Gershman |
Generalized Correlation Decomposition-Based Blind Channel Estimation in DS-CDMA Systems With Unknown Wide-Sense Stationary Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 56(11), pp. 5605-5617, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Khoongming Khoo, Guang Gong, Douglas R. Stinson |
A New Characterization of Semi-bent and Bent Functions on Finite Fields*. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 38(2), pp. 279-295, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
AMS Classification 11T71 |
37 | Howard Cheng, George Labahn |
On computing polynomial GCDs in alternate bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pp. 47-54, 2006, ACM, 1-59593-276-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Krylov matrices, fraction-free arithmetic, orthogonal polynomials, euclidean algorithm, subresultants |
37 | Hui Li 0002, Brian Williams 0001 |
Generalized Conflict Learning for Hybrid Discrete/Linear Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 415-429, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Michael B. Monagan, Allan D. Wittkopf |
On the design and implementation of Brown's algorithm over the integers and number fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, ISSAC 2000, St. Andrews, United Kingdom, August 6-10, 2000, pp. 225-233, 2000, ACM, 1-58113-218-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
37 | Mark J. Encarnación |
On a Modular Algorithm for Computing GCDs of Polynomials over Algebraic Number Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '94, Oxford, UK, July 20-22, 1994, pp. 58-65, 1994, ACM, 0-89791-638-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
34 | Xiangyun Kong, David Klappholz, Kleanthis Psarris |
The I Test: An Improved Dependence Test for Automatic Parallelization and Vectorization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 2(3), pp. 342-349, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
I test, subscript dependence test, Banerjee tests, parallel programming, program testing, program compilers, vectorization, automatic parallelization, loops, loop iterations, GCD |
33 | Masaru Sanuki, Tateaki Sasaki |
Computing Approximate GCDs in Ill-conditioned Cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNC ![In: Symbolic-Numeric Computation, SNC 2007, International Workshop, 25-27 July 2007, University of Western Ontario, London, Ontario, Canada, pp. 170-179, 2007, ACM, 978-1-59593-744-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
approximate GCD, stabilization, euclidean algorithm, ill-conditioned problem |
33 | Kleanthis Psarris, Xiangyun Kong, David Klappholz |
The Direction Vector I Test. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(11), pp. 1280-1290, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
direction vector I test, data dependence tests, Banerjee test, arbitrary direction vector, GCD test, parallelism detection, parallel programming, parallelization, algorithm theory |
31 | Laura Ruff, Tudor Jebelean |
Functional-Based Synthesis of a Systolic Array for GCD Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFL ![In: Implementation and Application of Functional Languages, 18th International Symp osium, IFL 2006, Budapest, Hungary, September 4-6, 2006, Revised Selected Papers, pp. 37-54, 2006, Springer, 978-3-540-74129-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Damien Stehlé, Paul Zimmermann |
A Binary Recursive Gcd Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings, pp. 411-425, 2004, Springer, 3-540-22156-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Andreas Maletti |
Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers, pp. 323-324, 2004, Springer, 3-540-24318-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Xukai Zou, Byrav Ramamurthy, Spyros S. Magliveras |
A GCD attack resistant CRTHACS for secure group communications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCC (2) ![In: International Conference on Information Technology: Coding and Computing (ITCC'04), Volume 2, April 5-7, 2004, Las Vegas, Nevada, USA, pp. 153-154, 2004, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Bogdan Matasaru, Tudor Jebelean |
FPGA Implementation of an Extended Binary GCD Algorithm for Systolic Reduction of Rational Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPL ![In: Field-Programmable Logic and Applications, The Roadmap to Reconfigurable Computing, 10th International Workshop, FPL 2000, Villach, Austria, August 27-30, 2000, Proceedings, pp. 810-813, 2000, Springer, 3-540-67899-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
31 | Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas |
GCD of Many Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings, pp. 310-317, 1999, Springer, 3-540-66200-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
31 | Tudor Jebelean |
Systolic Algorithms for Long Integer GCD Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONPAR ![In: Parallel Processing: CONPAR 94 - VAPP VI, Third Joint International Conference on Vector and Parallel Processing, Linz, Austria, September 6-8, 1994, Proceedings, pp. 241-252, 1994, Springer, 3-540-58430-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
31 | Tudor Jebelean |
Comparing several GCD algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Symposium on Computer Arithmetic ![In: 11th Symposium on Computer Arithmetic, 29 June - 2 July 1993, Windsor, Canada, Proceedings., pp. 180-185, 1993, IEEE Computer Society/, 0-8186-3862-1. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
31 | Jean-Louis Roch, Gilles Villard |
Parallel gcd and Lattice Basis Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONPAR ![In: Parallel Processing: CONPAR 92 - VAPP V, Second Joint International Conference on Vector and Parallel Processing, Lyon, France, September 1-4, 1992, Proceedings, pp. 557-564, 1992, Springer, 3-540-55895-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
25 | Keyvan Zarifi, Alex B. Gershman |
Blind channel estimation in DS-CDMA systems with unknown wide-sense stationary noise using generalized correlation decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2008, March 30 - April 4, 2008, Caesars Palace, Las Vegas, Nevada, USA, pp. 2809-2812, 2008, IEEE, 1-4244-1484-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Rafael E. Carrillo, Tuncer C. Aysal, Kenneth E. Barner |
Generalized cauchy distribution based robust estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2008, March 30 - April 4, 2008, Caesars Palace, Las Vegas, Nevada, USA, pp. 3389-3392, 2008, IEEE, 1-4244-1484-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Xiangyong Zeng, Nian Li, Lei Hu |
A Class of Nonbinary Codes and Sequence Families. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETA ![In: Sequences and Their Applications - SETA 2008, 5th International Conference, Lexington, KY, USA, September 14-18, 2008, Proceedings, pp. 81-94, 2008, Springer, 978-3-540-85911-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
correlation distribution, Linear code, exponential sum, quadratic form, weight distribution |
25 | Kazuhiro Yokoyama |
On systems of algebraic equations with parametric exponents II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 18(6), pp. 603-630, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Ideals with parametric exponents, Gröbner basis |
25 | Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro |
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 40(2), pp. 143-162, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Xiangyong Zeng, John Q. Liu, Lei Hu |
Generalized Kasami Sequences: The Large Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(7), pp. 2587-2598, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Dongxia Sun, Lihong Zhi |
Structured Low Rank Approximation of a Bezout Matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(2), pp. 427-437, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Bezout matrix, approximate greatest common divisor, structured nonlinear total least squares, symbolic/numeric hybrid method |
25 | Marc Moreno Maza, Yuzhen Xie |
Component-level parallelization of triangular decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PASCO ![In: Parallel Symbolic Computation, PASCO 2007, International Workshop, 27-28 July 2007, University of Western Ontario, London, Ontario, Canada, pp. 69-77, 2007, ACM, 978-1-59593-741-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
component-level, parallelization, triangular decompositions, polynomial system solving |
25 | Fabrizio Caruso |
The SARAG Library: Some Algorithms in Real Algebraic Geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMS ![In: Mathematical Software - ICMS 2006, Second International Congress on Mathematical Software, Castro Urdiales, Spain, September 1-3, 2006, Proceedings, pp. 122-131, 2006, Springer, 3-540-38084-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Gene Tsudik, Shouhuai Xu |
A Flexible Framework for Secret Handshakes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Privacy Enhancing Technologies ![In: Privacy Enhancing Technologies, 6th International Workshop, PET 2006, Cambridge, UK, June 28-30, 2006, Revised Selected Papers, pp. 295-315, 2006, Springer, 3-540-68790-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Loïck Lhote, Brigitte Vallée |
Sharp Estimates for the Main Parameters of the Euclid Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 689-702, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Sara Khodadad, Michael B. Monagan |
Fast rational function reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pp. 184-190, 2006, ACM, 1-59593-276-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
fast Euclidean algorithm, rational reconstruction, modular algorithms |
25 | Patricio Bulic, Veselko Gustin |
An efficient way to filter out data dependences with a sufficiently large distance between memory references. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 40(4), pp. 51-60, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
SIMD microprocessors, vectorizing compilers, data dependence analysis |
25 | Patricio Bulic, Veselko Gustin |
Fast Dependence Analysis in a Multimedia Vectorizing Compiler. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 12th Euromicro Workshop on Parallel, Distributed and Network-Based Processing (PDP 2004), 11-13 February 2004, A Coruna, Spain, pp. 176-183, 2004, IEEE Computer Society, 0-7695-2083-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Glauber Cintra, Yoshiko Wakabayashi |
Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings, pp. 175-190, 2004, Springer, 3-540-22067-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Patricio Bulic, Veselko Gustin |
On Dependence Analysis for SIMD Enhanced Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VECPAR ![In: High Performance Computing for Computational Science - VECPAR 2004, 6th International Conference, Valencia, Spain, June 28-30, 2004, Revised Selected and Invited Papers, pp. 527-540, 2004, Springer, 3-540-25424-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Patricio Bulic, Veselko Gustin |
Data Dependence Analysis for Intra-Register Vectorization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPDC ![In: 2nd International Symposium on Parallel and Distributed Computing (ISPDC 2003), 13-14 October 2003, Ljubljana, Slovenia, pp. 50-56, 2003, IEEE Computer Society, 0-7695-2069-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Hanno Lefmann |
Sparse Parity-Check Matrices over Finite Fields (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 112-121, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Nigel Boston, T. Charles Clancy, Y. Liow, Jonathan E. Webster |
Genus Two Hyperelliptic Curve Coprocessor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHES ![In: Cryptographic Hardware and Embedded Systems - CHES 2002, 4th International Workshop, Redwood Shores, CA, USA, August 13-15, 2002, Revised Papers, pp. 400-414, 2002, Springer, 3-540-00409-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Erich L. Kaltofen |
An output-sensitive variant of the baby steps/giant steps determinant algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings, pp. 138-144, 2002, ACM, 1-58113-484-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang |
Variations on a Theorem of Fine & Wilf. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 512-523, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Sidi Mohamed Sedjelmaci |
On a Parallel Extended Euclidean Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: 2001 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2001), 26-29 June 2001, Beirut, Lebanon, pp. 235-241, 2001, IEEE Computer Society, 0-7695-1165-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Nicos Karcanias, Marilena Mitrouli |
Numerical Computation of the Least Common Multiple of a Set of Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Comput. ![In: Reliab. Comput. 6(4), pp. 439-457, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Hiroshi Kai, Matu-Tarow Noda |
Hybrid Rational Function Approximation and Its Accuracy Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Comput. ![In: Reliab. Comput. 6(4), pp. 429-438, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Kuei-Ping Shih, Jang-Ping Sheu, Chih-Yung Chang |
Efficient Address Generation for Affine Subscripts in Data-Parallel Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 17(2), pp. 205-227, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
affine subscripts, multiple induction variables (MIVs), data distribution, distributed-memory multicomputers, single program multiple data (SPMD), data-parallel languages, address generation |
25 | Ching-Hsien Hsu, Sheng-Wen Bai, Yeh-Ching Chung, Chu-Sing Yang |
A Generalized Basic-Cycle Calculation Method for Efficient Array Redistribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(12), pp. 1201-1216, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
generalized basic-cycle calculation method, distributed memory multicomputers, Redistribution |
25 | Mihaly Agfalvi, Istvan Kadar, Erik Papp |
Generalization of Pick's theorem for surface of polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APL ![In: Proceedings of the International Conference on all Array Programming Languages, ALP 1999, Scranton, PA, USA, August 10-14, 1999., pp. 1-12, 1999, ACM, 1-58113-126-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
APL |
25 | James L. Massey, Shirlei Serconek |
Linear Complexity of Periodic Sequences: A General Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '96, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 1996, Proceedings, pp. 358-371, 1996, Springer, 3-540-61512-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Games-Chan algorithm, Hadamard product, Hasse derivative, hyperderivative, stream ciphers, Discrete Fourier transform, DFT, linear complexity |
25 | Kwang-Hui Lee |
A group communication protocol architecture for distributed network management systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the 4th International Conference on Computer Communications and Networks (ICCCN '95), September 20-23, 1995, Las Vegas, Nevada, USA, pp. 28, 1995, IEEE Computer Society, 0-8186-7180-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
group communication protocol architecture, distributed network management systems, managed object view interface, protocol overhead reduction, distributed group management, hierarchical group management, local group manager, group communication daemon, overlapped grouping facility, global group manager, hierarchical domain approach, distributed processing |
25 | Nader H. Bshouty |
On the Complexity of Functions for Random Access Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 40(2), pp. 211-223, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
indirect addressing, sorting, greatest common divisor, random access machine |
25 | Tudor Jebelean |
Improving the Multiprecision Euclidian Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISCO ![In: Design and Implementation of Symbolic Computation Systems, International Symposium, DISCO '93, Gmunden, Austria, September 15-17, 1993, Proceedings, pp. 45-58, 1993, Springer, 3-540-57235-X. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
25 | Kleanthis Psarris |
On exact data dependence analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICS ![In: Proceedings of the 6th international conference on Supercomputing, ICS 1992, Washington, DC, USA, July 19-24, 1992, pp. 303-312, 1992, ACM, 0-89791-485-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
25 | Yishay Mansour, Baruch Schieber, Prasoon Tiwari |
A Lower Bound for Integer Greatest Common Divisor Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 38(2), pp. 453-471, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
floor operation, greatest common devisor, mod operation, lower bound, truncation |
25 | Nader H. Bshouty |
Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings, pp. 55-65, 1991, Springer, 3-540-54029-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
21 | Bin Li, Jiawang Nie, Lihong Zhi |
Approximate GCDs of polynomials and SOS relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNC ![In: Symbolic-Numeric Computation, SNC 2007, International Workshop, 25-27 July 2007, University of Western Ontario, London, Ontario, Canada, pp. 205-206, 2007, ACM, 978-1-59593-744-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
SOS relaxation, global minimization, GCD |
21 | François Boulier, François Lemaire, Marc Moreno Maza |
PARDI!. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001, pp. 38-47, 2001, ACM, 1-58113-417-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
change of rankings, PDE, differential algebra, characteristic sets, gcd |
21 | Eric Allender, Michael E. Saks, Igor E. Shparlinski |
A Lower Bound for Primality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 10-14, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Circuit Complexity Lower Bounds, Primality, Square-Free Numbers, GCD |
20 | Xin Li 0009, Marc Moreno Maza, Wei Pan 0001 |
Computations modulo regular chains. ![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. 239-246, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
fast polynomial arithmetic, regular chain, regular gcd, polynomial systems, triangular decomposition, subresultants |