ACM Communications in Computer Algebra, Volume 46 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > ACM Communications in Computer Algebra

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 46, Numbers 1/2, March / June 2012

Issue 179

• 
  • 
  • 
  • 
  • 
    James H. Davenport:
    Small algorithms for small systems. 1-9
• 
  • 
  • 
  • 
  • 
    John Fitch:
    James Griesmer 1929-2011. 10-11
• 
  • 
  • 
  • 
  • 
    Doron Zeilberger:
    Farewell to "W" (Herbert Saul Wilf), a true VISIONARY for whom EVERYTHING was INTERTWINED. 12-13
• 
  • 
  • 
  • 
  • 
    Jeremy Johnson:
    Abstracts of recent doctoral dissertations in computer algebra. 14-16

Issue 180

• 
  • 
  • 
  • 
  • 
    David R. Stoutemyer:
    Series crimes. 19-52
• 
  • 
  • 
  • 
  • 
    Jeremy Johnson:
    In Memoriam: Werner Krandick. 52-54
• 
  • 
  • 
  • 
  • 
    Tony Shaska, Daniel E. Steffy:
    East coast computer algebra day 2012 abstracts. 55-59
• 
  • 
  • 
  • 
  • 
    Jeremy Johnson:
    Abstracts of recent doctoral dissertations in computer algebra. 60-63

Volume 46, Numbers 3/4, September / December 2012

Issue 181

• 
  • 
  • 
  • 
  • 
    David J. Wilson, Russell J. Bradford, James H. Davenport:
    A repository for CAD examples. 67-69
• 
  • 
  • 
  • 
  • 
    Stefan Dodunekov 1945-2012. 70-71
• 
  • 
  • 
  • 
  • 
    Fatima K. Abu Salem:
    A cache-oblivious engineering of the G2V algorithm for computing Gröbner bases. 72-73
• 
  • 
  • 
  • 
  • 
    Skander Belhaj, Haïthem Ben Kahla:
    On the complexity of computing the GCD of two polynomials via Hankel matrices. 74-75
• 
  • 
  • 
  • 
  • 
    Felix Breuer, Zafeirakis Zafeirakopoulos:
    Partition analysis via polyhedral geometry. 76-77
• 
  • 
  • 
  • 
  • 
    Nader H. Bshouty:
    Testers. 78-79
• 
  • 
  • 
  • 
  • 
    Yongjae Cha, Veronika Pillwein:
    Closed form solutions of linear difference equations in terms of symmetric products. 80-81
• 
  • 
  • 
  • 
  • 
    Xavier Dahan:
    On the structure of lexicographic Gröbner bases in dimension zero. 82-83
• 
  • 
  • 
  • 
  • 
    Max Demenkov:
    Estimating region of attraction for polynomial vector fields by homotopy methods. 84-85
• 
  • 
  • 
  • 
  • 
    Gérard H. E. Duchamp, Vincel Hoang Ngoc Minh:
    Dual families in enveloping algebras. 86-87
• 
  • 
  • 
  • 
  • 
    Ioannis Z. Emiris, Tatjana Kalinka:
    Sparse implicitization using support prediction. 88-89
• 
  • 
  • 
  • 
  • 
    Claudia Fassino, Maria-Laura Torrente:
    Zero-dimensional ideals of limited precision points. 90-91
• 
  • 
  • 
  • 
  • 
    Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault:
    Fast change of ordering with exponent ω. 92-93
• 
  • 
  • 
  • 
  • 
    Laurent Hascoët, Shahadat Hossain, Trond Steihaug:
    Structured computation in optimization and algorithmic differentiation. 94-95
• 
  • 
  • 
  • 
  • 
    Mark van Hoeij, Vijay Jung Kunwar:
    Finding 2F1 type solutions of differential equations with 5 singularities. 96-97
• 
  • 
  • 
  • 
  • 
    V. D. Irtegov, T. N. Titorenko:
    Symbolic analysis of dynamic systems. 98-99
• 
  • 
  • 
  • 
  • 
    Maximilian Jaroschek:
    Improved polynomial remainder sequences for ore polynomials. 100-101
• 
  • 
  • 
  • 
  • 
    Hao Jiang, Stef Graillat, Roberto Barrio:
    Accurate computing elementary symmetric functions. 102-103
• 
  • 
  • 
  • 
  • 
    Dejan Jovanovic, Leonardo de Moura:
    Solving non-linear arithmetic. 104-105
• 
  • 
  • 
  • 
  • 
    George Labahn, Johannes Middeke:
    Gröbner walk for computing matrix normal forms over Ore polynomials. 106-107
• 
  • 
  • 
  • 
  • 
    Romain Lebreton, Esmaeil Mehrabi, Éric Schost:
    On the complexity of computing certain resultants. 108-109
• 
  • 
  • 
  • 
  • 
    Wei Li, Chun-Ming Yuan, Xiao-Shan Gao:
    Sparse differential resultant for laurent differential polynomials. 110-111
• 
  • 
  • 
  • 
  • 
    Alberto Llorente, Jorge Mozo-Fernández:
    Numeric-symbolic methods for computing the Liouvillian solutions of differential equations and systems. 112-113
• 
  • 
  • 
  • 
  • 
    Thang Luu Ba:
    The matrix based representations of the intersection curves. 114-115
• 
  • 
  • 
  • 
  • 
    Kosaku Nagasaka:
    Backward error analysis of approximate Gröbner basis. 116-117
• 
  • 
  • 
  • 
  • 
    Esteban Segura Ugalde:
    Polynomial root-finding via structured matrices. 118-119
• 
  • 
  • 
  • 
  • 
    Hiroshi Sekigawa, Kiyoshi Shirayanagi:
    Maximal perturbation for preserving the number of solutions of a polynomial system. 120-121
• 
  • 
  • 
  • 
  • 
    Konstantin Usevich, Ivan Markovsky:
    Variable projection methods for approximate GCD computations. 122-124
• 
  • 
  • 
  • 
  • 
    Wenyuan Wu, Jingwei Chen, Yong Feng:
    An efficient algorithm to factorize sparse bivariate polynomials over the rationals. 125-126
• 
  • 
  • 
  • 
  • 
    Jeremy Johnson:
    Abstracts of recent doctoral dissertations in computer algebra. 127-129
• 
  • 
  • 
  • 
  • 
    David R. Stoutemyer:
    Series misdemeanors. 134-153
• 
  • 
  • 
  • 
  • 
    Anja Korporal, Georg Regensburger, Markus Rosenkranz:
    ISSAC 2012 software demonstrations: Symbolic computation for ordinary boundary problems in maple. 154-156
• 
  • 
  • 
  • 
  • 
    Moulay A. Barkatou, Eckhard Pflügel, Flavia Stan:
    ISOLDE: a maple package for systems of linear functional equations. 157-159
• 
  • 
  • 
  • 
  • 
    Isabel Bermejo, Eva García-Llorente, Philippe Gimenez:
    monomialideal.lib. 160-161
• 
  • 
  • 
  • 
  • 
    The HPC-GAP project:
    Parallel programming support in GAP. 161-163
• 
  • 
  • 
  • 
  • 
    Michael B. Monagan, Roman Pearce:
    POLY: a new polynomial data structure for Maple 17. 164-167
• 
  • 
  • 
  • 
  • 
    Guillaume Quintin:
    The decoding Library for list decoding. 168-170
• 
  • 
  • 
  • 
  • 
    Xiaoyu Chen, Dongming Wang, Ting Zhao:
    GeoText: an intelligent dynamic geometry textbook. 171-175
• 
  • 
  • 
  • 
  • 
    Jeremy Johnson:
    Abstracts of recent doctoral dissertations in computer algebra. 176-179

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).

load links from unpaywall.org

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).

load content from archive.org

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 .

load data from openalex.org

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.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: