The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for gcd with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1973-1986 (15) 1987-1991 (19) 1992-1993 (19) 1994-1995 (24) 1996-1997 (23) 1998-1999 (21) 2000-2001 (19) 2002-2003 (26) 2004 (15) 2005 (15) 2006 (21) 2007 (20) 2008 (26) 2009 (15) 2010-2011 (29) 2012-2013 (17) 2014-2015 (18) 2016-2018 (20) 2019-2020 (23) 2021-2022 (28) 2023-2024 (14)
Publication types (Num. hits)
article(195) incollection(3) inproceedings(226) phdthesis(3)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 228 occurrences of 180 keywords

Results
Found 427 publication records. Showing 427 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
122S. Unnikrishna Pillai, Ben Liang 0001 Two-Dimensional Blind Deconvolution Using a Robust GCD Approach. Search on Bibsonomy ICIP (1) The full citation details ... 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
114Akira Terui An iterative method for calculating approximate GCD of univariate polynomials. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximate polynomial gcd, gradient-projection method, optimization, ill-conditioned problem
114George Havas, Jean-Pierre Seifert The Complexity of the Extended GCD Problem. Search on Bibsonomy MFCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF computational problems of diophantine equations, extended gcd computations, Approximation algorithms, NP-hardness, probabilistically checkable proofs, interactive proof systems
93Saurabh Agarwal, Gudmund Skovbjerg Frandsen Binary GCD Like Algorithms for Some Complex Quadratic Rings. Search on Bibsonomy ANTS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
87K. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal Lower Bounds for Group Covering Designs. Search on Bibsonomy AAECC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
78Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. Search on Bibsonomy ISSAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximate multiple root, approximate polynomial gcd, multivariate polynomial gcd, singular polynomial, linear constraint, symbolic/numeric hybrid method
78Kenneth Weber The Accelerated Integer GCD Algorithm. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF integer greatest common divisor, number-theoretic computations, GCD
69Jennifer de Kleine, Michael B. Monagan, Allan D. Wittkopf Algorithms for the non-monic case of the sparse modular GCD algorithm. Search on Bibsonomy ISSAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Zippel's algorithm, polynomial greatest common divisors, sparse multivariate polynomials, probabilistic algorithms, modular algorithms
69Joachim von zur Gathen, Igor E. Shparlinski GCD of Random Linear Forms. Search on Bibsonomy ISAAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
69Mark van Hoeij, Michael B. Monagan Algorithms for polynomial GCD computation over algebraic function fields. Search on Bibsonomy ISSAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF modular algorithms
69Mark van Hoeij, Michael B. Monagan A modular GCD algorithm over number fields presented with multiple extensions. Search on Bibsonomy ISSAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
69S. Unnikrishna Pillai, Ben Liang 0001 Blind image deconvolution using a robust GCD approach. Search on Bibsonomy IEEE Trans. Image Process. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
69Mohamed Omar Rayes, Paul S. Wang, Kenneth Weber Parallelization of the Sparse Modular GCD Algorithm for Multivariate Polynomials on Shared Memory Multiprocessors. Search on Bibsonomy ISSAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
69Lars Langemyr An Asymptotically Fast Probabilitstic Algorithm for Computing Polynominal GCD's over an Algebraic Number Field. Search on Bibsonomy AAECC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
65Saurabh Agarwal, Gudmund Skovbjerg Frandsen A New GCD Algorithm for Quadratic Number Rings with Unique Factorization. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF quadratic number ring, quadratic form reduction, gcd
64Abdulah Abdulah Zadeh High Speed Modular Divider Based on GCD Algorithm. Search on Bibsonomy ICICS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF GCD algorithm, Radix four, Finite Field, ECC
64Seyed Mohammad Mahdi Javadi, Michael B. Monagan A sparse modular GCD algorithm for polynomials over algebraic function fields. Search on Bibsonomy ISSAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF GCD algorithms, sparse interpolation, algebraic function fields
64Dario Andrea Bini, Paola Boito Structured matrix-based methods for polynomial in-gcd: analysis and comparisons. Search on Bibsonomy ISSAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF bézout matrix, cauchy matrices, displacement structure, polynomial gcd, sylvester matrix
64Marc Joye, Pascal Paillier GCD-Free Algorithms for Computing Modular Inverses. Search on Bibsonomy CHES The full citation details ... 2003 DBLP  DOI  BibTeX  RDF RSA key generation, GCD algorithms, embedded software, efficient implementations, prime numbers, Modular inverses
64Marc Moreno Maza, Renaud Rioboo Polynomial Gcd Computations over Towers of Algebraic Extensions. Search on Bibsonomy AAECC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Polynomial gcd, zero dimensional systems, AXIOM, triangular sets, algebraic numbers, subresultants
56Pramook Khungurn, Hiroshi Sekigawa, Kiyoshi Shirayanagi Minimum converging precision of the QR-factorization algorithm for real polynomial GCD. Search on Bibsonomy ISSAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF algebraic algorithm stabilization, polynomial greatest common divisor
56Joachim von zur Gathen, Igor E. Shparlinski GCD of Random Linear Combinations. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
56Giovanni Cesari Parallel Implementation of Schönhage's Integer GCD Algorithm. Search on Bibsonomy ANTS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
53Joachim von zur Gathen, Igor E. Shparlinski Approximate Polynomial gcd: Small Degree and Small Height Perturbations. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Euclidean algorithm, gcd, approximate computation
52Daniel Lichtblau Half-GCD and fast rational recovery. Search on Bibsonomy ISSAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF integer gcd, rational recovery, subquadratic arithmetic
49Yueming Wang, Gang Pan 0001, Zhaohui Wu 0001 3D Face Recognition in the Presence of Expression: A Guidance-based Constraint Deformation Approach. Search on Bibsonomy CVPR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
49Erich L. Kaltofen, Lihong Zhi Hybrid symbolic-numeric computation. Search on Bibsonomy ISSAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF symbolic/numeric hybrid methods
46Tudor Jebelean Design of a systolic coprocessor for rational addition. Search on Bibsonomy ASAP The full citation details ... 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
45Chang Hoon Kim, Soonhak Kwon, Jong Jin Kim, Chun Pyo Hong A Compact and Fast Division Architecture for a Finite Field. Search on Bibsonomy ICCSA (1) The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Extended Binary GCD, VLSI, Finite Field, Division
45Kleanthis Psarris, Santosh Pande Classical dependence analysis techniques: sufficiently accurate in practice. Search on Bibsonomy HICSS (2) The full citation details ... 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
44Zhonggang Zeng, Barry H. Dayton The approximate GCD of inexact polynomials. Search on Bibsonomy ISSAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF squarefree, polynomial, factorization, greatest common divisor
44Ivan Damgård, Gudmund Skovbjerg Frandsen Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers. Search on Bibsonomy FCT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
44Sidi Mohamed Sedjelmaci On a parallel Lehmer-Euclid GCD algorithm. Search on Bibsonomy ISSAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
41Shuhong Gao, Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi Approximate factorization of multivariate polynomials via differential equations. Search on Bibsonomy ISSAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF approximate gcd, multivariate gcd, multivariate polynomial factorization, symbolic numeric hybrid method, singular value decomposition, approximate factorization
39David Shallcross, Victor Y. Pan, Yu Lin-Kriz The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF NC equivalence, planar integer linear programming, Euclidean GCD, NC-reduction, remainder sequence, positive integers, Euclidean algorithm, P-completeness
38Ahmet Ipek Upper bounds for the condition numbers of the GCD and the reciprocal GCD matrices in spectral norm. Search on Bibsonomy Comput. Math. Appl. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
38Weiduan Feng, Shaofang Hong, Jianrong Zhao Divisibility properties of power LCM matrices by power GCD matrices on gcd-closed sets. Search on Bibsonomy Discret. Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
38André Weilert (1+i)-ary GCD Computation in Z[i] as an Analogue to the Binary GCD Algorithm. Search on Bibsonomy J. Symb. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
38Rachid 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 1993   RDF
38Alain Guyot OCAPI: architecture of a VLSI coprocessor for the GCD and the extended GCD of large numbers. Search on Bibsonomy IEEE Symposium on Computer Arithmetic The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
38Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet GCDHEU: Heuristic Polynomial GCD Algorithm Based On Integer GCD Computation. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
38Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation. Search on Bibsonomy EUROSAM The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
37Loïck Lhote, Brigitte Vallée Gaussian Laws for the Main Parameters of the Euclid Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 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
37Doreen Hertel, Alexander Pott Two results on maximum nonlinear functions. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF 05B25, AMS Classifications 05B10
37Keyvan Zarifi, Alex B. Gershman Generalized Correlation Decomposition-Based Blind Channel Estimation in DS-CDMA Systems With Unknown Wide-Sense Stationary Noise. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
37Khoongming Khoo, Guang Gong, Douglas R. Stinson A New Characterization of Semi-bent and Bent Functions on Finite Fields*. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF AMS Classification 11T71
37Howard Cheng, George Labahn On computing polynomial GCDs in alternate bases. Search on Bibsonomy ISSAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Krylov matrices, fraction-free arithmetic, orthogonal polynomials, euclidean algorithm, subresultants
37Hui Li 0002, Brian Williams 0001 Generalized Conflict Learning for Hybrid Discrete/Linear Optimization. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Michael B. Monagan, Allan D. Wittkopf On the design and implementation of Brown's algorithm over the integers and number fields. Search on Bibsonomy ISSAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
37Mark J. Encarnación On a Modular Algorithm for Computing GCDs of Polynomials over Algebraic Number Fields. Search on Bibsonomy ISSAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
34Xiangyun Kong, David Klappholz, Kleanthis Psarris The I Test: An Improved Dependence Test for Automatic Parallelization and Vectorization. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 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
33Masaru Sanuki, Tateaki Sasaki Computing Approximate GCDs in Ill-conditioned Cases. Search on Bibsonomy SNC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF approximate GCD, stabilization, euclidean algorithm, ill-conditioned problem
33Kleanthis Psarris, Xiangyun Kong, David Klappholz The Direction Vector I Test. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 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
31Laura Ruff, Tudor Jebelean Functional-Based Synthesis of a Systolic Array for GCD Computation. Search on Bibsonomy IFL The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
31Damien Stehlé, Paul Zimmermann A Binary Recursive Gcd Algorithm. Search on Bibsonomy ANTS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
31Andreas Maletti Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids. Search on Bibsonomy CIAA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
31Xukai Zou, Byrav Ramamurthy, Spyros S. Magliveras A GCD attack resistant CRTHACS for secure group communications. Search on Bibsonomy ITCC (2) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
31Bogdan Matasaru, Tudor Jebelean FPGA Implementation of an Extended Binary GCD Algorithm for Systolic Reduction of Rational Numbers. Search on Bibsonomy FPL The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
31Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas GCD of Many Integers. Search on Bibsonomy COCOON The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
31Tudor Jebelean Systolic Algorithms for Long Integer GCD Computation. Search on Bibsonomy CONPAR The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
31Tudor Jebelean Comparing several GCD algorithms. Search on Bibsonomy IEEE Symposium on Computer Arithmetic The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
31Jean-Louis Roch, Gilles Villard Parallel gcd and Lattice Basis Reduction. Search on Bibsonomy CONPAR The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
25Keyvan Zarifi, Alex B. Gershman Blind channel estimation in DS-CDMA systems with unknown wide-sense stationary noise using generalized correlation decomposition. Search on Bibsonomy ICASSP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25Rafael E. Carrillo, Tuncer C. Aysal, Kenneth E. Barner Generalized cauchy distribution based robust estimation. Search on Bibsonomy ICASSP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25Xiangyong Zeng, Nian Li, Lei Hu A Class of Nonbinary Codes and Sequence Families. Search on Bibsonomy SETA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF correlation distribution, Linear code, exponential sum, quadratic form, weight distribution
25Kazuhiro Yokoyama On systems of algebraic equations with parametric exponents II. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Ideals with parametric exponents, Gröbner basis
25Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
25Xiangyong Zeng, John Q. Liu, Lei Hu Generalized Kasami Sequences: The Large Set. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
25Dongxia Sun, Lihong Zhi Structured Low Rank Approximation of a Bezout Matrix. Search on Bibsonomy Math. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Bezout matrix, approximate greatest common divisor, structured nonlinear total least squares, symbolic/numeric hybrid method
25Marc Moreno Maza, Yuzhen Xie Component-level parallelization of triangular decompositions. Search on Bibsonomy PASCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF component-level, parallelization, triangular decompositions, polynomial system solving
25Fabrizio Caruso The SARAG Library: Some Algorithms in Real Algebraic Geometry. Search on Bibsonomy ICMS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
25Gene Tsudik, Shouhuai Xu A Flexible Framework for Secret Handshakes. Search on Bibsonomy Privacy Enhancing Technologies The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
25Loïck Lhote, Brigitte Vallée Sharp Estimates for the Main Parameters of the Euclid Algorithm. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
25Sara Khodadad, Michael B. Monagan Fast rational function reconstruction. Search on Bibsonomy ISSAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF fast Euclidean algorithm, rational reconstruction, modular algorithms
25Patricio Bulic, Veselko Gustin An efficient way to filter out data dependences with a sufficiently large distance between memory references. Search on Bibsonomy ACM SIGPLAN Notices The full citation details ... 2005 DBLP  DOI  BibTeX  RDF SIMD microprocessors, vectorizing compilers, data dependence analysis
25Patricio Bulic, Veselko Gustin Fast Dependence Analysis in a Multimedia Vectorizing Compiler. Search on Bibsonomy PDP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
25Glauber Cintra, Yoshiko Wakabayashi Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems. Search on Bibsonomy WEA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
25Patricio Bulic, Veselko Gustin On Dependence Analysis for SIMD Enhanced Processors. Search on Bibsonomy VECPAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
25Patricio Bulic, Veselko Gustin Data Dependence Analysis for Intra-Register Vectorization. Search on Bibsonomy ISPDC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
25Hanno Lefmann Sparse Parity-Check Matrices over Finite Fields (Extended Abstract). Search on Bibsonomy COCOON The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
25Nigel Boston, T. Charles Clancy, Y. Liow, Jonathan E. Webster Genus Two Hyperelliptic Curve Coprocessor. Search on Bibsonomy CHES The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
25Erich L. Kaltofen An output-sensitive variant of the baby steps/giant steps determinant algorithm. Search on Bibsonomy ISSAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
25Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang Variations on a Theorem of Fine & Wilf. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
25Sidi Mohamed Sedjelmaci On a Parallel Extended Euclidean Algorithm. Search on Bibsonomy AICCSA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
25Nicos Karcanias, Marilena Mitrouli Numerical Computation of the Least Common Multiple of a Set of Polynomials. Search on Bibsonomy Reliab. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
25Hiroshi Kai, Matu-Tarow Noda Hybrid Rational Function Approximation and Its Accuracy Analysis. Search on Bibsonomy Reliab. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
25Kuei-Ping Shih, Jang-Ping Sheu, Chih-Yung Chang Efficient Address Generation for Affine Subscripts in Data-Parallel Programs. Search on Bibsonomy J. Supercomput. The full citation details ... 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
25Ching-Hsien Hsu, Sheng-Wen Bai, Yeh-Ching Chung, Chu-Sing Yang A Generalized Basic-Cycle Calculation Method for Efficient Array Redistribution. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF generalized basic-cycle calculation method, distributed memory multicomputers, Redistribution
25Mihaly Agfalvi, Istvan Kadar, Erik Papp Generalization of Pick's theorem for surface of polyhedra. Search on Bibsonomy APL The full citation details ... 1999 DBLP  DOI  BibTeX  RDF APL
25James L. Massey, Shirlei Serconek Linear Complexity of Periodic Sequences: A General Theory. Search on Bibsonomy CRYPTO The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Games-Chan algorithm, Hadamard product, Hasse derivative, hyperderivative, stream ciphers, Discrete Fourier transform, DFT, linear complexity
25Kwang-Hui Lee A group communication protocol architecture for distributed network management systems. Search on Bibsonomy ICCCN The full citation details ... 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
25Nader H. Bshouty On the Complexity of Functions for Random Access Machines. Search on Bibsonomy J. ACM The full citation details ... 1993 DBLP  DOI  BibTeX  RDF indirect addressing, sorting, greatest common divisor, random access machine
25Tudor Jebelean Improving the Multiprecision Euclidian Algorithm. Search on Bibsonomy DISCO The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
25Kleanthis Psarris On exact data dependence analysis. Search on Bibsonomy ICS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
25Yishay Mansour, Baruch Schieber, Prasoon Tiwari A Lower Bound for Integer Greatest Common Divisor Computations. Search on Bibsonomy J. ACM The full citation details ... 1991 DBLP  DOI  BibTeX  RDF floor operation, greatest common devisor, mod operation, lower bound, truncation
25Nader H. Bshouty Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains. Search on Bibsonomy ICCI The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
21Bin Li, Jiawang Nie, Lihong Zhi Approximate GCDs of polynomials and SOS relaxation. Search on Bibsonomy SNC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF SOS relaxation, global minimization, GCD
21François Boulier, François Lemaire, Marc Moreno Maza PARDI!. Search on Bibsonomy ISSAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF change of rankings, PDE, differential algebra, characteristic sets, gcd
21Eric Allender, Michael E. Saks, Igor E. Shparlinski A Lower Bound for Primality. Search on Bibsonomy CCC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Circuit Complexity Lower Bounds, Primality, Square-Free Numbers, GCD
20Xin Li 0009, Marc Moreno Maza, Wei Pan 0001 Computations modulo regular chains. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF fast polynomial arithmetic, regular chain, regular gcd, polynomial systems, triangular decomposition, subresultants
Displaying result #1 - #100 of 427 (100 per page; Change: )
Pages: [1][2][3][4][5][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license