default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 48 matches
- 2002
- Sergei A. Abramov, Marko Petkovsek:
Rational Normal Forms and Minimal Decompositions of Hypergeometric Terms. J. Symb. Comput. 33(5): 521-543 (2002) - Christian Bauer, Alexander Frink, Richard Kreckel:
Introduction to the GiNaC Framework for Symbolic Computation within the C++ Programming Language. J. Symb. Comput. 33(1): 1-12 (2002) - Peter Berman:
Calculating the Galois Group of Y'= = = AY+ + + B, Y'= = = AY Completely Reducible. J. Symb. Comput. 33(6): 887-898 (2002) - Phelim P. Boyle, W. Tian, Fred Guan:
The Riccati Equation in Mathematical Finance. J. Symb. Comput. 33(3): 343-355 (2002) - Murray R. Bremner, Irvin Roy Hentzel:
Identities for the Associator in Alternative Algebras. J. Symb. Comput. 33(3): 255-273 (2002) - Eng-Wee Chionh, Ming Zhang, Ronald N. Goldman:
Fast Computation of the Bezout and Dixon Resultant Matrices. J. Symb. Comput. 33(1): 13-29 (2002) - George E. Collins:
A Fast Euclidean Algorithm for Gaussian Integers. J. Symb. Comput. 33(4): 385-392 (2002) - Gene Cooperman, Victor Grinberg:
Scalable Parallel Coset Enumeration: Bulk Definition and the Memory Wall. J. Symb. Comput. 33(5): 563-585 (2002) - Carlos D'Andrea, Ioannis Z. Emiris:
Hybrid Sparse Resultant Matrices for Bivariate Polynomials. J. Symb. Comput. 33(5): 587-608 (2002) - Bettina Eick, Charles R. B. Wright:
Computing Subgroups by Exhibition in Finite Solvable Groups. J. Symb. Comput. 33(2): 129-143 (2002) - Ioannis Z. Emiris, Victor Y. Pan:
Symbolic and Numeric Methods for Exploiting Structure in Constructing Resultant Matrices. J. Symb. Comput. 33(4): 393-413 (2002) - Elisabetta Fortuna, Patrizia M. Gianni, Barry M. Trager:
Derivations and Radicals of Polynomial Ideals over Fields of Arbitrary Characteristic. J. Symb. Comput. 33(5): 609-625 (2002) - Steven Fortune:
An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials. J. Symb. Comput. 33(5): 627-646 (2002) - Mikhail V. Foursov, Marc Moreno Maza:
On Computer-assisted Classification of Coupled Integrable Equations. J. Symb. Comput. 33(5): 647-660 (2002) - André Galligo, David Rupprecht:
Irreducible Decomposition of Curves. J. Symb. Comput. 33(5): 661-677 (2002) - Karin Gatermann, Birkett Huber:
A Family of Sparse Polynomial Systems Arising in Chemical Reaction Systems. J. Symb. Comput. 33(3): 275-305 (2002) - Willem A. de Graaf, Werner Nickel:
Constructing Faithful Representations of Finitely-generated Torsion-free Nilpotent Groups. J. Symb. Comput. 33(1): 31-41 (2002) - Jaime Gutierrez, Rosario Rubio San Miguel, David Sevilla:
On Multivariate Rational Function Decomposition. J. Symb. Comput. 33(5): 545-562 (2002) - Farshid Hajir, Christian Maire:
Tamely Ramified Towers and Discriminant Bounds for Number Fields-II. J. Symb. Comput. 33(4): 415-423 (2002) - Ralf Hemmecke:
Continuously Parameterized Symmetries and Buchberger's Algorithm. J. Symb. Comput. 33(1): 43-55 (2002) - Florian Hess:
Computing Riemann-Roch Spaces in Algebraic Function Fields and Related Topics. J. Symb. Comput. 33(4): 425-445 (2002) - Joris van der Hoeven:
FFT-like Multiplication of Linear Differential Operators. J. Symb. Comput. 33(1): 123-127 (2002) - Hoon Hong, Manfred Minimair:
Sparse Resultant of Composed Polynomials IMixed-. Unmixed Case. J. Symb. Comput. 33(4): 447-465 (2002) - K. Kalorkoti:
Predicting Zero Coefficients in Formal Power Series Computations. J. Symb. Comput. 33(3): 307-320 (2002) - Steve Linton, Götz Pfeiffer, Edmund F. Robertson, Nikola Ruskuc:
Computing Transformation Semigroups. J. Symb. Comput. 33(2): 145-162 (2002) - Noel G. Lloyd, Jane M. Pearson:
Symmetry in Planar Dynamical Systems. J. Symb. Comput. 33(3): 357-366 (2002) - Frank Lübeck:
On the Computation of Elementary Divisors of Integer Matrices. J. Symb. Comput. 33(1): 57-65 (2002) - Jonas Månsson, Patrik Nordbeck:
Regular Gröbner Bases. J. Symb. Comput. 33(2): 163-181 (2002) - Scott McCallum, George E. Collins:
Local Box Adjacency Algorithms for Cylindrical Algebraic Decompositions. J. Symb. Comput. 33(3): 321-342 (2002) - Manfred Minimair:
Sparse Resultant of Composed Polynomials II. Unmixed-Mixed Case. J. Symb. Comput. 33(4): 467-478 (2002)
skipping 18 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-13 22:05 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint