|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 238 occurrences of 170 keywords
|
|
|
Results
Found 457 publication records. Showing 457 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
110 | Xavier Redon, Paul Feautrier |
Detection of Recurrences in Sequential Programs with Loops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARLE ![In: PARLE '93, Parallel Architectures and Languages Europe, 5th International PARLE Conference, Munich, Germany, June 14-17, 1993, Proceedings, pp. 132-145, 1993, Springer, 3-540-56891-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
78 | J. Ramanujam, S. Vasanthakumar |
Statement-level independent partitioning of uniform recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 229-233, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
statement-level independent partitioning, uniform recurrences, constant dependence distance vectors, statement-level affine schedules, multiple nested loops, parallel programming, linear programming, linear programming, multiprocessor, code generation, synchronisation |
71 | V. L. Kurakin, Alexey S. Kuzmin, Viktor T. Markov, Alexander V. Mikhalev, Alexander A. Nechaev |
Linear Codes and Polylinear Recurrences over Finite Rings and Modules. ![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. 365-391, 1999, Springer, 3-540-66723-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
65 | Yixin Shou, Robert A. van Engelen |
Automatic SIMD vectorization of chains of recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICS ![In: Proceedings of the 22nd Annual International Conference on Supercomputing, ICS 2008, Island of Kos, Greece, June 7-12, 2008, pp. 245-255, 2008, ACM, 978-1-60558-158-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
chains of recurrences, short vector simd, vectorization, ILP |
65 | Beatrice Luca, Stefan Andrei, Hugh Anderson, Siau-Cheng Khoo |
Program transformation by solving recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PEPM ![In: Proceedings of the 2006 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2006, Charleston, South Carolina, USA, January 9-10, 2006, pp. 121-129, 2006, ACM, 1-59593-196-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
efficient time complexity, recurrences with one or multiple parameters, program transformation |
65 | Ricardo A. Baeza-Yates, Gaston H. Gonnet |
Average Case Analysis of Algorithms using Matrix Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'90, International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, Proceedings, pp. 110-119, 1990, Springer, 3-540-53504-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
average case, digital trees, matrix recurrences, Analysis of algorithms, search trees |
59 | David Eppstein |
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(4), pp. 492-509, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Automated analysis of algorithms, Davis-Putnam procedures, method of feasible directions, multivariate recurrences, quasiconvex programming, backtracking, worst-case analysis |
59 | Jih-Kwon Peir, Ron Cytron |
Minimum Distance: A Method for Partitioning Recurrences for Multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(8), pp. 1203-1211, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
partitioning recurrences, nonvectorizable uniform recurrences, totally independent computations, clusters, multiprocessors, computer networks, multiprocessing systems, parallel execution, numerical stability, minimum distance |
52 | Shojiro Sakata |
Finding a Minimal Polynomial Vector Set of a Vector of nD Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991, Proceedings, pp. 414-425, 1991, Springer, 3-540-54522-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
52 | Johnnie Birch, Robert A. van Engelen, Kyle A. Gallivan, Yixin Shou |
An empirical evaluation of chains of recurrences for array dependence testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PACT ![In: 15th International Conference on Parallel Architectures and Compilation Techniques (PACT 2006), Seattle, Washington, USA, September 16-20, 2006, pp. 295-304, 2006, ACM, 1-59593-264-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
chains of recurrences, dependence testing, loop optimization |
52 | Alin Bostan, Frédéric Chyzak, Bruno Salvy, Thomas Cluzeau |
Low complexity algorithms for linear recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pp. 31-38, 2006, ACM, 1-59593-276-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
creative telescoping, polynomial and rational solutions, summation, complexity, computer algebra, linear recurrences |
52 | Haigeng Wang, Alexandru Nicolau, Stephen Keung, Kai-Yeung Siu |
Computing Programs Containing Band Linear Recurrences on Vector Supercomputers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 7(8), pp. 769-782, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Band linear recurrences (BLRs), parallel evaluation of BLRs with resource constraints, programs with BLRs, vector supercomputer, parallel programming |
52 | Michael S. Schlansker, Vinod Kathail, Sadun Anik |
Height reduction of control recurrences for ILP processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICRO ![In: Proceedings of the 27th Annual International Symposium on Microarchitecture, San Jose, California, USA, November 30 - December 2, 1994, pp. 40-51, 1994, ACM / IEEE Computer Society, 0-89791-707-3. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
back-substitution, blocked back-substitution, control height reduction, parallelism, software pipeline, control dependences, loop optimization, recurrences |
46 | Rumen Andonov, Nicola Yanev, Hafid Bourzoufi |
Three-dimensional orthogonal tile sizing problem: mathematical programming approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASAP ![In: 1997 International Conference on Application-Specific Systems, Architectures, and Processors (ASAP '97), 14-16 July 1997, Zurich, Switzerland, pp. 209-218, 1997, IEEE Computer Society, 0-8186-7958-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
three-dimensional orthogonal tile sizing problem, mathematical programming approach, optimal tiling transformation, three-dimensional uniform recurrences, distributed-memory general-purpose machines, parallelizing compilers, running time, performance tuning, parallelising compilers, nonlinear integer programming, parallel codes |
45 | Sven Verdoolaege, Gerda Janssens, Maurice Bruynooghe |
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings, pp. 599-613, 2009, Springer, 978-3-642-02657-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
45 | Salvador Roura |
Improved master theorems for divide-and-conquer recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(2), pp. 170-205, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
master theorem, divide-and-conquer, asymptotic analysis |
45 | Bernd Grobauer |
Cost Recurrences for DML Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP '01), Firenze (Florence), Italy, September 3-5, 2001., pp. 253-264, 2001, ACM, 1-58113-415-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
ML |
45 | Eugene V. Zima |
On computational properties of chains of recurrences. ![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. 345, 2001, ACM, 1-58113-417-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
45 | Karl-Heinz Zimmermann, Wolfgang Achtziger |
Finding Space-Time Transformations for Uniform Recurrences via Branching Parametric Linear Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. VLSI Signal Process. ![In: J. VLSI Signal Process. 15(3), pp. 259-274, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
45 | Philippe Flajolet, Mordecai J. Golin |
Exact Asymptotics of Divide-and-Conquer Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings, pp. 137-149, 1993, Springer, 3-540-56939-1. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
45 | Yoshikazu Tanaka, Kyouko Iwasawa, Shizuo Gotou, Yukio Umetani |
Compiling techniques for first-order liner recurrences on a Vector computer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC ![In: Proceedings Supercomputing '88, Orlando, FL, USA, November 12-17, 1988, pp. 174-181, 1988, IEEE Computer Society, 0-8186-0882-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
40 | Roland W. Freund, Noël M. Nachtigal |
QMRPACK: A Package of QMR Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 22(1), pp. 46-77, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Lanczos method, coupled two-term recurrences, non-Hermitian matrices, quasi-minimal residual property, FORTRAN, iterative method, eigenvalues, transfer functions, linear systems, look-ahead, Krylov subspace, three-term recurrences |
39 | Leena Unnikrishnan, Scott D. Stoller |
Parametric heap usage analysis for functional programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 8th International Symposium on Memory Management, ISMM 2009, Dublin, Ireland, June 19-20, 2009, pp. 139-148, 2009, ACM, 978-1-60558-347-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
live heap space analysis, garbage collection, functional languages, recurrence relations |
39 | Anitha Priya Krishnan, Delphine Davis, Paul Okunieff, Walter O'Dell |
Random walk model based on DTI for predicting the microscopic spread of gliomas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBI ![In: Proceedings of the 2008 IEEE International Symposium on Biomedical Imaging: From Nano to Macro, Paris, France, May 14-17, 2008, pp. 891-894, 2008, IEEE, 978-1-4244-2003-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
39 | Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost |
Differential equations for algebraic functions. ![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. 25-32, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
algebraic series, creative telescoping, differential resolvents, complexity, computer algebra |
39 | David Eppstein |
Quasiconvex analysis of backtracking algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 788-797, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
39 | Xiaoxiong Zhong, Sanjay V. Rajopadhye, Ivan Wong |
Systematic generation of linear allocation functions in systolic array design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. VLSI Signal Process. ![In: J. VLSI Signal Process. 4(4), pp. 279-293, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
39 | Zahira Ammarguellat, Williams Ludwell Harrison III |
Automatic Recognition of Induction Variables and Recurrence Relations by Abstract Interpretation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation (PLDI), White Plains, New York, USA, June 20-22, 1990, pp. 283-295, 1990, ACM, 0-89791-364-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
39 | Sanjay V. Rajopadhye, Richard Fujimoto |
Systolic Array Synthesis by Static Analysis of Program Dependencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARLE (1) ![In: PARLE, Parallel Architectures and Languages Europe, Volume I: Parallel Architectures, Eindhoven, The Netherlands, June 15-19, 1987, Proceedings, pp. 295-310, 1987, Springer, 3-540-17943-7. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
39 | Ravi Kumar 0001, D. Sivakumar 0001 |
Efficient Self-Testing/Self-Correction of Linear Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 602-611, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
efficient self-testing, efficient self-correction, self-tester design, self-corrector design, result-checkers, linear function testing, counting arguments, matrix twist, convolution identities, VLSI chip testing, randomness-efficient self-tester, rational domains, signal processing, finite fields, program testing, polynomials, reduction, functions, spectral analysis, matrix groups, linear recurrences, control engineering |
39 | Simant Dube |
Using Fractal Geometry for Solving Divide-and-Conquer Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, pp. 191-200, 1993, Springer, 3-540-57568-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Hausdorff-Besikovitch dimension, divide-and-conquer recurrences, Fractals, fractal dimension, iterated function systems |
37 | Philippe Dumas 0001 |
Récurrences mahlériennes, suites automatiques, études asymptotiques. (Mahlerian recurrences, automatic sequences, asymptotic studies). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1993 |
RDF |
|
33 | Ralf Hinze |
Functional pearl: streams and unique fixed points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, ICFP 2008, Victoria, BC, Canada, September 20-28, 2008, pp. 189-200, 2008, ACM, 978-1-59593-919-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
finite calculus, unique fixed points, streams, generating functions, recurrences, coinduction |
33 | Bruno Salvy |
D-finiteness: algorithms and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 2-3, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
creative telescoping, computer algebra, linear recurrences, elimination, linear differential equations |
33 | Howard Cheng, Eugene V. Zima |
On accelerated methods to evaluate sums of products of rational numbers. ![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. 54-61, 2000, ACM, 1-58113-218-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
binary splitting, chains of recurrences, representation of integers |
33 | Albert G. Greenberg, Boris D. Lubachevsky, Isi Mitrani |
Superfast Parallel Discrete Event Simulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Model. Comput. Simul. ![In: ACM Trans. Model. Comput. Simul. 6(2), pp. 107-136, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
fixed-point computations, unbounded parallelism, relaxation, massively parallel computations, recurrences, superlinear speedup |
33 | Jordi Torres, Eduard Ayguadé, Jesús Labarta, Mateo Valero |
Loop Parallelization: Revisiting Framework of Unimodular Transformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96), January 24-26, 1996, Portugal, pp. 420-428, 1996, IEEE Computer Society, 0-8186-7376-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
linear loop transformations, nonlinear step, transformation process, maximum loop parallelism, perfect nested loops, tight recurrences, MIMD system, parallel algorithms, parallelizing algorithm, parallel programming, graph theory, dependence graph, loop parallelization, optimising compilers, coarse grain parallelism, unimodular transformations |
33 | Bruno Salvy, Paul Zimmermann |
GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 20(2), pp. 163-177, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Maple, computer algebra, generating functions, linear recurrences, linear differential equations |
31 | Nikita Gogin, Aleksandr Mylläri |
On the Average Growth Rate of Random Compositions of Fibonacci and Padovan Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing, 11th International Workshop, CASC 2009, Kobe, Japan, September 13-17, 2009. Proceedings, pp. 240-246, 2009, Springer, 978-3-642-04102-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | François Panneton, Pierre L'Ecuyer, Makoto Matsumoto |
Improved long-period generators based on linear recurrences modulo 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 32(1), pp. 1-16, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
GFSR linear recurrence modulo 2, linear feedback shift register, Random number generation, Mersenne twister |
31 | Pierre L'Ecuyer, François Panneton |
Fast random number generators based on linear recurrences modulo 2: overview and comparison. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Proceedings of the 37th Winter Simulation Conference, Orlando, FL, USA, December 4-7, 2005, pp. 110-119, 2005, IEEE Computer Society, 0-7803-9519-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Denis E. Khmelnov |
Search for Polynomial Solutions of Linear Functional Systems by Means of Induced Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Program. Comput. Softw. ![In: Program. Comput. Softw. 30(2), pp. 61-67, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Ivan Bricault, Ron Kikinis, Eric van Sonnenberg, Kemal Tuncali, Stuart G. Silverman |
3D Analysis of Radiofrequency-Ablated Tumors in Liver: A Computer-Aided Diagnosis Tool for Early Detection of Local Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICCAI (2) ![In: Medical Image Computing and Computer-Assisted Intervention -- MICCAI 2004, 7th International Conference Saint-Malo, France, September 26-29, 2004, Proceedings, Part II, pp. 1042-1043, 2004, Springer, 3-540-22977-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Hsien-Kuei Hwang |
Asymptotics of Divide-and-Conquer Recurrences: Batcher's Sorting Algorithm and a Minimum Euclidean Matching Heuristic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 22(4), pp. 529-546, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Minimum Euclidean matching, van der Corput's method, Divide-and-conquer, Exponential sums, Mellin transform |
31 | Karl-Heinz Zimmermann, Wolfgang Achtziger |
On Time Optimal Implementation of Uniform Recurrences onto Array Processors via Quadratic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. VLSI Signal Process. ![In: J. VLSI Signal Process. 19(1), pp. 19-38, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
space-time transformation, systolic array, quadratic programming, uniform recurrence equation |
31 | Salvador Roura |
An Improved Master Theorem for Divide-and-Conquer Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 449-459, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
31 | Olaf Bachmann, Paul S. Wang, Eugene V. Zima |
Chains of Recurrences - a Method to Expedite the Evaluation of Closed-form Functions. ![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. 242-249, 1994, ACM, 0-89791-638-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Common Lisp |
31 | Richard J. Fateman |
Lookup Tables, Recurrences and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, ISSAC '89, Portland, Oregon, USA, July 17-19, 1989, pp. 68-73, 1989, ACM, 0-89791-325-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
31 | S. Lakshmivarahan, Sudarshan K. Dhall |
Parallel Algorithms for Solving Certain Classes of Linear Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Fifth Conference, New Delhi, India, December 16-18, 1985, Proceedings, pp. 457-478, 1985, Springer, 3-540-16042-6. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
26 | Easwaran Raman, Guilherme Ottoni, Arun Raman, Matthew J. Bridges, David I. August |
Parallel-stage decoupled software pipelining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CGO ![In: Sixth International Symposium on Code Generation and Optimization (CGO 2008), April 5-9, 2008, Boston, MA, USA, pp. 114-123, 2008, ACM, 978-1-59593-978-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
doall, dswp, tlp, automatic parallelization, multi-core architectures, pipelined parallelism |
26 | Johnnie Birch, Kleanthis Psarris |
Discovering Maximum Parallelization Using Advanced Data Dependence Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC ![In: 10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008, 25-27 Sept. 2008, Dalian, China, pp. 103-112, 2008, IEEE Computer Society, 978-0-7695-3352-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Pawel Baturo, Marcin Piatkowski, Wojciech Rytter |
The Number of Runs in Sturmian Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings, pp. 252-261, 2008, Springer, 978-3-540-70843-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Neil Vachharajani, Ram Rangan, Easwaran Raman, Matthew J. Bridges, Guilherme Ottoni, David I. August |
Speculative Decoupled Software Pipelining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PACT ![In: 16th International Conference on Parallel Architectures and Compilation Techniques (PACT 2007), Brasov, Romania, September 15-19, 2007, pp. 49-59, 2007, IEEE Computer Society, 0-7695-2944-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Ali Doganaksoy, Faruk Göloglu |
On Lempel-Ziv Complexity of Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETA ![In: Sequences and Their Applications - SETA 2006, 4th International Conference, Beijing, China, September 24-28, 2006, Proceedings, pp. 180-189, 2006, Springer, 3-540-44523-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Lempel-Ziv complexity, ?2-statistics, randomness |
26 | Leslie Ann Goldberg, Russell A. Martin, Mike Paterson |
trong Spatial Mixing for Lattice Graphs with Fewer Colours. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 562-571, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Richard Ehrenborg, Harold Fox |
Inequalities for cd-Indices of Joins and Products of Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 23(3), pp. 427-452, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 06A07, 52B05 |
26 | Timothy J. Rolfe |
Spreadsheet-aided numerical experimentation: analytic formula for Fibonacci numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGCSE Bull. ![In: ACM SIGCSE Bull. 35(2), pp. 117-119, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Yosi Ben-Asher, Gadi Haber |
Parallel Solutions of Simple Indexed Recurrence Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 12(1), pp. 22-37, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Ordinary recurrence equations, indexed recurrence equations, pointer jumping, parallel prefix sums, Livermore Loops benchmark, parallelizing compilers, list ranking, tree contraction, Euler tour |
26 | Yosi Ben-Asher, Gadi Haber |
Parallel Solutions of Simple Index Recurrence Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '98 Parallel Processing, 4th International Euro-Par Conference, Southampton, UK, September 1-4, 1998, Proceedings, pp. 933-939, 1998, Springer, 3-540-64952-2. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Karl-Heinz Zimmermann |
A Unifying Lattice-Based Approach for the Partitioning of Systolic Arrays via LPGS and LSGP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. VLSI Signal Process. ![In: J. VLSI Signal Process. 17(1), pp. 21-41, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Alfredo Viola, Patricio V. Poblete |
The Analysis of Linear Probing Hashing with Buckets (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings, pp. 221-233, 1996, Springer, 3-540-61680-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
26 | David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano |
Sparse Dynamic Programming I: Linear Cost Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 39(3), pp. 519-545, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
dynamic programming, time complexity, sequence alignment, sparsity, recurrence |
20 | Arpith C. Jacob, Jeremy D. Buhler, Roger D. Chamberlain |
Design space exploration of throughput-optimized arrays from recurrence abstractions (abstract only). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPGA ![In: Proceedings of the ACM/SIGDA 18th International Symposium on Field Programmable Gate Arrays, FPGA 2010, Monterey, California, USA, February 21-23, 2010, pp. 286, 2010, ACM, 978-1-60558-911-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
fpga, dynamic programming, systolic array, throughput optimization, recurrences |
20 | Yixin Shou, Robert A. van Engelen, Johnnie Birch, Kyle A. Gallivan |
Toward efficient flow-sensitive induction variable analysis and dependence testing for loop optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 44st Annual Southeast Regional Conference, 2006, Melbourne, Florida, USA, March 10-12, 2006, pp. 1-6, 2006, ACM, 1-59593-315-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
loop parallelization, recurrences, induction variables, compiler algorithms |
20 | Alev Topuzoglu, Arne Winterhof |
On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 16(4), pp. 219-228, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Linear complexity profile, Nonlinear pseudorandom number generators, Inversive generators, Sequences over finite fields, Recurrences of higher order |
20 | Alin Bostan, Thomas Cluzeau, Bruno Salvy |
Fast algorithms for polynomial solutions of linear differential equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 45-52, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
complexity, computer algebra, linear recurrences, linear differential equations, polynomial solutions |
20 | Rumen Andonov, Stephan Balev, Sanjay V. Rajopadhye, Nicola Yanev |
Optimal Semi-Oblique Tiling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 14(9), pp. 944-960, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
2D uniform recurrences, communication-compuation granularity, loop blocking, perfect loop nests, locality, MPI, distributed memory machines, SPMD, BSP model, biological sequence alignment |
20 | Vicky Siu-Ngan Choi, Mordecai J. Golin |
Lopsided Trees: Analyses, Algorithms, and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings, pp. 538-549, 1996, Springer, 3-540-61440-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Varn Codes, Fibonacci Recurrences, Postal Model, Mellin Transforms |
20 | Josep Lluís Larriba-Pey, Juan J. Navarro, Oriol Roig, Angel Jorba |
A generalized vision of some parallel bidiagonal systems solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Supercomputing ![In: Proceedings of the 8th international conference on Supercomputing, ICS 1994, Manchester, UK, July 11-15, 1994, pp. 404-411, 1994, ACM, 0-89791-665-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
r-cyclic reduction, vector uniprocessors, divide and conquer, Gaussian elimination, linear recurrences |
20 | Ahmed El-Amawy |
A Systolic Architecture for Fast Dense Matrix Inversion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(3), pp. 449-455, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
fast dense matrix inversion, data-steering technique, feedback recurrences, VLSI, cellular arrays, Gaussian elimination, systolic architecture, VLSI algorithms, computerised signal processing |
20 | Mary Jane Irwin, Robert Michael Owens |
Fully Digit On-Line Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 32(4), pp. 402-406, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
Digit on-line algorithms, digit on-line architectures, redundant digit sets, pipelining, systolic arrays, linear recurrences |
20 | Robert K. Montoye, Duncan H. Lawrie |
A Practical Algorithm for the Solution of Triangular Systems on a Parallel Processing System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 31(11), pp. 1076-1082, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
limited processor algorithms, parallel memory storage schemes, parallel processing, Interconnection networks, numerical stability, linear recurrences |
20 | Daniel Gajski |
An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 30(3), pp. 190-206, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
triangular system solvers, Complexity of algorithms, pipelined processors, parallel processors, computer organization, linear recurrences, parallel evaluation |
20 | Bruno F. W. Whitte |
Algorithms: Algorithm 332: Jacobi polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 11(6), pp. 436-437, 1968. The full citation details ...](Pics/full.jpeg) |
1968 |
DBLP DOI BibTeX RDF |
Jacobi polynomials, orthogonal polynomials, special functions, three-term recurrences |
18 | Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai |
Identities and periodic oscillations of divide-and-conquer recurrences splitting at half. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 155, pp. 102653, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Tuo Dai, Bizhao Shi, Guojie Luo |
WideSA: A High Array Utilization Mapping Scheme for Uniform Recurrences on the Versal ACAP Architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.16792, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Soham De, Samuel L. Smith, Anushan Fernando, Aleksandar Botev, George-Cristian Muraru, Albert Gu, Ruba Haroun, Leonard Berrada, Yutian Chen, Srivatsan Srinivasan, Guillaume Desjardins, Arnaud Doucet, David Budden, Yee Whye Teh, Razvan Pascanu, Nando de Freitas, Çaglar Gülçehre |
Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.19427, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Phiraphat Sutthimat, Vichian Laohakosol, Rattiya Meesa |
A unified approach to derive explicit solutions of generalized second-order linear recurrences and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 347(2), pp. 113757, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab S. Sawhney, Jakub Tarnawski |
Online Edge Coloring via Tree Recurrences and Correlation Decay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 53(1), pp. 87-110, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Alaa Ibrahim, Bruno Salvy |
Positivity Certificates for Linear Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pp. 982-994, 2024, SIAM, 978-1-61197-791-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Chenglin Wang, Fangzhen Lin |
Solving Conditional Linear Recurrences for Program Verification: The Periodic Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 7(OOPSLA1), pp. 28-55, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Robert S. Maier 0001 |
Triangular recurrences, generalized Eulerian numbers, and related number triangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 146, pp. 102485, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | William Gilpin |
Recurrences reveal shared causal drivers of complex time series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.13516, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Alaa Ibrahim, Bruno Salvy |
Positivity certificates for linear recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.05930, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Shiv Sundram, Muhammad Usman Tariq, Fredrik Kjolstad |
Compiling Recurrences over Dense and Sparse Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.04660, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Antonio Orvieto, Soham De, Çaglar Gülçehre, Razvan Pascanu, Samuel L. Smith |
On the Universality of Linear Recurrences Followed by Nonlinear Projections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.11888, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Stefano Massaroli, Michael Poli, Daniel Y. Fu, Hermann Kumbong, Rom N. Parnichkun, Aman Timalsina, David W. Romero, Quinn McIntyre, Beidi Chen, Atri Rudra, Ce Zhang 0001, Christopher Ré, Stefano Ermon, Yoshua Bengio |
Laughing Hyena Distillery: Extracting Compact Recurrences From Convolutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.18780, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Jeffrey O. Shallit |
Proving properties of some greedily-defined integer recurrences via automata theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.06544, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Sergiy Koshkin, Daniel Rodriguez |
Linear recurrent cryptography: Golden-like cryptography for higher order linear recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 15(3), pp. 2250094:1-2250094:27, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Vichian Laohakosol, Rattiya Meesa, Phiraphat Sutthimat |
Closed-form solutions of general second order linear recurrences and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(1), pp. 113206, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Antonio Jiménez-Pastor, Marko Petkovsek |
The factorial-basis method for finding definite-sum solutions of linear recurrences with polynomial coefficients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 117, pp. 15-50, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Clemens Fuchs, Sebastian Heintze |
A polynomial variant of diophantine triples in linear recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Period. Math. Hung. ![In: Period. Math. Hung. 86(1), pp. 289-299, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Clemens Fuchs, Sebastian Heintze |
Correction to: A polynomial variant of diophantine triples in linear recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Period. Math. Hung. ![In: Period. Math. Hung. 86(1), pp. 300, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Jérémy Berthomieu |
Contributions to polynomial system solving: Recurrences and Gröbner bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2023 |
RDF |
|
18 | Stefano Massaroli, Michael Poli, Daniel Y. Fu, Hermann Kumbong, Rom N. Parnichkun, David W. Romero, Aman Timalsina, Quinn McIntyre, Beidi Chen, Atri Rudra, Ce Zhang 0001, Christopher Ré, Stefano Ermon, Yoshua Bengio |
Laughing Hyena Distillery: Extracting Compact Recurrences From Convolutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023., 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
18 | Waleed Mohamed Abd-Elhameed, Mohamed Salem Al-Harbi |
Some Formulas and Recurrences of Certain Orthogonal Polynomials Generalizing Chebyshev Polynomials of the Third-Kind. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 14(11), pp. 2309, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Xi Chen, Arthur Li Bo Yang, James Jing Yu Zhao |
Recurrences for Callan's Generalization of Narayana Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Syst. Sci. Complex. ![In: J. Syst. Sci. Complex. 35(4), pp. 1573-1585, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Elena Barcucci, Antonio Bernini, Renzo Pinzani |
Strings from linear recurrences and permutations: A Gray code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 938, pp. 112-120, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Nasir Siddiqui, Wajeeha Iftikhar, Muhammad Ehatisham-ul-Haq |
An Effective S-box Construction Based on Linear Recurrences with Constant Co-Efficient. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Pers. Commun. ![In: Wirel. Pers. Commun. 124(2), pp. 1109-1122, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Sergiy Koshkin, Daniel Rodriguez |
Linear recurrent cryptography: golden-like cryptography for higher order linear recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.11411, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 457 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ >>] |
|