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 33 matches
- 1998
- J. Stuart Aitken, Philip D. Gray, Thomas F. Melham, Muffy Thomas:
Interactive Theorem Proving: An Empirical Study of User Activity. J. Symb. Comput. 25(2): 263-284 (1998) - Joachim Apel:
The Theory of Involutive Divisions and an Application to Hilbert Function Computations. J. Symb. Comput. 25(6): 683-704 (1998) - Yves Bertot, Laurent Théry:
A Generic Approach to Building User Interfaces for Theorem Provers. J. Symb. Comput. 25(2): 161-194 (1998) - Jean-Camille Birget:
Infinite String Rewrite Systems and Complexity. J. Symb. Comput. 25(6): 759-793 (1998) - Hubert Comon:
Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules. J. Symb. Comput. 25(4): 397-419 (1998) - Hubert Comon:
Completion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving. J. Symb. Comput. 25(4): 421-453 (1998) - Elie Compoint:
Differential Equations and Algebraic Relations. J. Symb. Comput. 25(6): 705-725 (1998) - Wolfram Decker, Agnes E. Heydtmann, Frank-Olaf Schreyer:
Generating a Noetherian Normalization of the Invariant Ring of a Finite Group. J. Symb. Comput. 25(6): 727-731 (1998) - Simon Gray, Norbert Kajler, Paul S. Wang:
Design and Implementation of MP, a Protocol for Efficient Exchange of Mathematical Expressions. J. Symb. Comput. 25(2): 213-237 (1998) - Lajos Hajdu, T. Herendi:
Explicit Bounds for the Solutions of Elliptic Equations with Rational Coefficients. J. Symb. Comput. 25(3): 361-366 (1998) - Michael B. Hayden, Edmund A. Lamagna:
NEWTON: An Interactive Environment for Exploring Mathematics. J. Symb. Comput. 25(2): 195-212 (1998) - Claus Hintermeier, Claude Kirchner, Hélène Kirchner:
Dynamically Typed Computations for Order-Sorted Equational Presentations. J. Symb. Comput. 25(4): 455-526 (1998) - Hoon Hong:
Bounds for Absolute Positiveness of Multivariate Polynomials. J. Symb. Comput. 25(5): 571-585 (1998) - Hoon Hong:
Groebner Basis Under Composition I. J. Symb. Comput. 25(5): 643-663 (1998) - Ming-Deh A. Huang, Doug Ierardi:
Counting Points on Curves over Finite Fields. J. Symb. Comput. 25(1): 1-21 (1998) - Jon Jones, Nicholas P. Karampetakis, A. Clive Pugh:
The Computation and Application of the Generalized Inverse via Maple. J. Symb. Comput. 25(1): 99-124 (1998) - Norbert Kajler, Neil Soiffer:
A Survey of User Interfaces for Computer Algebra Systems. J. Symb. Comput. 25(2): 127-159 (1998) - Ladislav Kocbach, Richard Liska:
Generation and Verification of Algorithms for Symbolic-Numeric Processing. J. Symb. Comput. 25(3): 367-382 (1998) - Eddi H. Lo:
Finding Intersections and Normalizers in Finely Generated Nilpotent Groups. J. Symb. Comput. 25(1): 45-59 (1998) - Eddi H. Lo:
A Polycyclic Quotient Algorithm. J. Symb. Comput. 25(1): 61-97 (1998) - Helen Lowe, Alan Bundy, Duncan McLean:
The Use of Proof Planning for Co-operative Theorem Proving. J. Symb. Comput. 25(2): 239-261 (1998) - Klaus Madlener, Birgit Reinert:
A Generalization of Gröbner Basis Algorithms to Polycyclic Group Rings. J. Symb. Comput. 25(1): 23-43 (1998) - Aart Middeldorp, Satoshi Okui:
A Deterministic Lazy Narrowing Calculus. J. Symb. Comput. 25(6): 733-757 (1998) - Raphael Nauheim:
Systems of Algebraic Equations with Bad Reduction. J. Symb. Comput. 25(5): 619-641 (1998) - Mike F. Newman, Werner Nickel, Alice C. Niemeyer:
Descriptions of Groups of Primepower Order. J. Symb. Comput. 25(5): 665-682 (1998) - Beatrice Paternoster, Massimo Cafaro:
Computation of the Interval of Stability of Runge-Kutta-Nyström Methods. J. Symb. Comput. 25(3): 383-394 (1998) - Leanne J. Rylands, Donald E. Taylor:
Matrix Generators for the Orthogonal Groups. J. Symb. Comput. 25(3): 351-360 (1998) - Bruno Salvy, John Shackell:
Symbolic Asymptotics: Functions of Two Variables, Implicit Functions. J. Symb. Comput. 25(3): 329-349 (1998) - Jan Snellman:
Gröbner Bases and Normal Forms in a Subring of the Power Series Ring on Countably Many Variables. J. Symb. Comput. 25(3): 315-328 (1998) - Alexei Yu. Uteshev, Timofei M. Cherkasov:
The Search for the Maximum of a Polynomial. J. Symb. Comput. 25(5): 587-618 (1998)
skipping 3 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 2025-01-11 09:28 CET 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