default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEugene V. Zima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Benjamin Chen, Yu Li, Eugene Zima:
On a Two-Layer Modular Arithmetic. ACM Commun. Comput. Algebra 57(3): 133-136 (2023)- 2022
- [j12]Mark Giesbrecht, Hui Huang, George Labahn, Eugene Zima:
Efficient rational creative telescoping. J. Symb. Comput. 109: 57-87 (2022) - 2021
- [j11]Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:
Efficient q-integer linear decomposition of multivariate polynomials. J. Symb. Comput. 107: 122-144 (2021) - 2020
- [j10]Lingling Wang
, Xiaodong Lin, Eugene V. Zima, Chunguang Ma:
Towards Airbnb-Like Privacy-Enhanced Private Parking Spot Sharing Based on Blockchain. IEEE Trans. Veh. Technol. 69(3): 2411-2423 (2020) - [i3]Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:
Efficient q-Integer Linear Decomposition of Multivariate Polynomials. CoRR abs/2002.00124 (2020)
2010 – 2019
- 2019
- [c21]Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:
Efficient Integer-Linear Decomposition of Multivariate Polynomials. ISSAC 2019: 171-178 - [i2]Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:
Efficient Rational Creative Telescoping. CoRR abs/1909.06898 (2019) - 2018
- [j9]Eugene V. Zima:
Accelerating indefinite hypergeometric summation algorithms. ACM Commun. Comput. Algebra 52(3): 96-99 (2018) - 2016
- [e1]Sergei A. Abramov, Eugene V. Zima, Xiao-Shan Gao:
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016. ACM 2016, ISBN 978-1-4503-4380-0 [contents] - 2014
- [j8]Eugene V. Zima:
Direct Indefinite Summation. ACM Commun. Comput. Algebra 48(3/4): 145-147 (2014) - 2013
- [j7]Eugene V. Zima:
Accelerating Indefinite Summation: Simple Classes of Summands. Math. Comput. Sci. 7(4): 455-472 (2013) - 2011
- [j6]Ilias S. Kotsireas, Eugene V. Zima:
Abstracts of WWCA 2011 in honor of Herb Wilf's 80th birthday. ACM Commun. Comput. Algebra 45(1/2): 92-99 (2011) - [c20]Eugene V. Zima:
Synthetic division in the context of indefinite summation. SNC 2011: 151-152
2000 – 2009
- 2007
- [j5]Eugene V. Zima, A. M. Stewart:
Cunningham numbers in modular arithmetic. Program. Comput. Softw. 33(2): 80-86 (2007) - [c19]Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Paul Zimmermann, Eugene V. Zima:
Time-and space-efficient evaluation of some hypergeometric constants. ISSAC 2007: 85-91 - [i1]Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene V. Zima, Paul Zimmermann:
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants. CoRR abs/cs/0701151 (2007) - 2006
- [j4]Ilias S. Kotsireas, Eugene A. Zima:
WWCA 2006 abstracts. ACM Commun. Comput. Algebra 40(2): 52-59 (2006) - 2005
- [j3]Howard Cheng, Barry Gergel, Ethan Kim, Eugene V. Zima:
Space-efficient evaluation of hypergeometric series. SIGSAM Bull. 39(2): 41-52 (2005) - [j2]Howard Cheng, Barry Gergel, Ethan Kim, Eugene V. Zima:
Space-efficient evaluation of hypergeometric series. SIGSAM Bull. 39(3): 81-83 (2005) - 2003
- [c18]Jürgen Gerhard, Mark Giesbrecht, Arne Storjohann, Eugene V. Zima:
Shiftless decomposition and polynomial-time rational summation. ISSAC 2003: 119-126 - 2001
- [c17]Eugene V. Zima:
On computational properties of chains of recurrences. ISSAC 2001: 345 - 2000
- [c16]Howard Cheng, Eugene V. Zima:
On accelerated methods to evaluate sums of products of rational numbers. ISSAC 2000: 54-61
1990 – 1999
- 1999
- [c15]Eugene V. Zima:
Matrix Form of Polynomial Representation and Parallel Real Root Isolation. Applied Informatics 1999: 464-466 - [c14]V. Kislenkov, V. Mitrofanov, Eugene V. Zima:
How Fast Can We Compute Products? ISSAC 1999: 75-82 - 1998
- [c13]V. Kislenkov, V. Mitrofanov, Eugene V. Zima:
Multidimensional Chains of Recurrences. ISSAC 1998: 199-206 - 1997
- [j1]V. Mitrofanov, Eugene V. Zima:
Standalone MCR-based numerical engine. SIGSAM Bull. 31(3): 59-60 (1997) - [c12]Eugene V. Zima:
Mixed representation of polynomials oriented towards fast parallel shift. PASCO 1997: 150-155 - [c11]Eugene V. Zima:
Fast Parallel Computation of the Polynomial Shift. IPPS 1997: 402-406 - [c10]Sergei A. Abramov, Eugene V. Zima:
Minimal Completely Factorable Annihilators. ISSAC 1997: 290-297 - 1996
- [c9]Eugene V. Zima, Karthi R. Vadivelu, Thomas L. Casavant:
Mapping Techniques for Parallel Evaluation of Chains of Recurrences. IPPS 1996: 620-624 - [c8]Sergei A. Abramov, Eugene V. Zima:
D'Alembertian Solutions of Inhomogeneous Linear Equations (differential, difference, and some other). ISSAC 1996: 232-240 - [c7]Eugene V. Zima:
On Parallel Construction of Multidimensional Chains of Recurrences. Parcella 1996: 214-223 - 1995
- [c6]Eugene V. Zima:
Simplification and Optimization Transformations of Chains of Recurrences. ISSAC 1995: 42-50 - 1994
- [c5]Olaf Bachmann, Paul S. Wang, Eugene V. Zima:
Chains of Recurrences - a Method to Expedite the Evaluation of Closed-form Functions. ISSAC 1994: 242-249 - [c4]Eugene V. Zima:
Recurrent Relations Technique to Vectorize Function Evaluation in Loops. Parcella 1994: 161-168 - 1993
- [c3]Eugene V. Zima:
Numeric Code Optimization in Computer Algebra Systems and Recurrent Relations Technique. ISSAC 1993: 42-46 - 1992
- [c2]Eugene V. Zima:
Recurrent Relations and Speed-up of Computations Using Computer Algebra Systems. DISCO 1992: 152-161
1980 – 1989
- 1987
- [c1]Eugene V. Zima:
Transformation of computation formulae in systems of recurrence relations. EUROCAL 1987: 223-224
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
